Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

4488131175 · Jun 202019922001200920172026
48 results for intersection matrix

3-manifold triangulation can be reconstructed from its intersection matrix.

problem Reconstructing the triangulation of 3-manifolds from their intersection matrix.
method Using the intersection matrix of a simplicial complex to determine the triangulation of a 3-manifold up to isomorphism.
result The intersection matrix is sufficient to determine the triangulation of a 3-manifold up to isomorphism.

We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graph, and show that these weight systems are related to the weight systems induced by the Conway a…

2003-12-17abs ↗pdf ↗

The paper proves embedding conditions for complexes in manifolds using matrix rank criteria.

problem Embedding kk-dimensional simplicial complexes into (k1)(k-1)-connected PL manifolds.
method Proves embedding conditions using a skew-symmetric matrix with low rank over Q\mathbb Q.
result Embedding conditions for kk-complexes in 2k2k-manifolds are equivalent to low-rank matrix conditions.

In a previous paper, we defined an operation μμ that generalizes Turaev's cobracket for loops on a surface. We showed that, in contrast to the cobracket, this operation gives a formula for the minimum number of self-intersections of a loop in a given free homotopy class. In this paper we consider the corresponding que…

2011-07-24abs ↗pdf ↗

The paper connects Riemannian Gaussian distributions to random matrix theory and diffusion kernels.

problem Analyzing Riemannian Gaussian distributions on symmetric spaces.
method Analytical computation of marginals using orthogonal and skew orthogonal polynomials, and diffusion kernels.
result Riemannian Gaussian distributions are random matrix types, and their probability density functions can be computed analytically.

Study of Hamiltonian flows on character varieties for self-intersecting curves.

problem Analyzing periodic orbits of Hamiltonian flows on character varieties.
method Explicit computations in Fock-Goncharov coordinates.
result Hamiltonian flows of trace functions associated to self-intersecting curves on a pair of pants have periodic orbits.

In this paper, we show that the Lie superalgebra spo(2l+2n)\mathfrak{spo}(2l+2|n) is into the intersection of Lie superalgebra of contact vector fields K(2l+1n)\mathcal{K}(2l+1|n) and the Lie superalgebra of projective vector fields pgl(2l+2n)\mathfrak{pgl}(2l+2|n). We use mainly the embedding used by P. Mathonet and F. Radoux in "\textit{ …

2016-06-30abs ↗pdf ↗

New method reduces computational cost for nonnegative low rank matrix approximation.

problem Efficiently compute nonnegative low rank matrix approximation for nonnegative matrices.
method Alternating projections onto tangent spaces of fixed rank matrices manifold and nonnegative matrix manifold.
result Sequence converges linearly to optimal solutions, showing better performance in terms of computational time and accuracy.

BEGIN network models binary data without parametric assumptions.

problem Conditional independence in non-parametric families of binary data.
method BEGIN network models binary data using sparse linear representations and block factorizations.
result BEGIN network captures conditional independence for arbitrary binary and multinomial variables.

This paper concerns cluster algebras with principal coefficients A(S,M) associated to bordered surfaces (S,M), and is a companion to a concurrent work of the authors with Schiffler [MSW2]. Given any (generalized) arc or loop in the surface -- with or without self-intersections -- we associate an element of (the fractio…

2011-08-17abs ↗pdf ↗

Given a matrix the seriation problem consists in permuting its rows in such way that all its columns have the same shape, for example, they are monotone increasing. We propose a statistical approach to this problem where the matrix of interest is observed with noise and study the corresponding minimax rate of estimatio…

2016-07-08abs ↗pdf ↗

It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system. We give two curious formulas for the weight system of a colored Jones fun…

2002-03-01abs ↗pdf ↗

Tensor networks improve anomaly detection at LHC for new physics.

problem Identifying new phenomena in proton collision events at LHC.
method Tensor network-based anomaly detection using Matrix Product State with an isometric feature map.
result Tensor networks outperform established quantum methods in identifying new phenomena.

To each ribbon graph we assign a so-called L-space, which is a Lagrangian subspace in an even-dimensional vector space with the standard symplectic form. This invariant generalizes the notion of the intersection matrix of a chord diagram. Moreover, the actions of Morse perestroikas (or taking a partial dual) and Vassil…

2014-01-23abs ↗pdf ↗

The paper examines how closed curves on surfaces intersect and how this intersection determines the curves.

problem Determining closed curves on surfaces based on their intersections.
method Constructing and studying kk-equivalent curves, analyzing intersections with other curves.
result Curves are determined by their intersections with all other curves, but non-simple curves require infinitely many intersections to distinguish.

The paper finds diffeomorphic complex intersections with distinct Hodge numbers.

problem Identifying complex intersections with different Hodge numbers.
method Provided three pairs of 3-dimensional and one pair of 5-dimensional complex complete intersections, all diffeomorphic but with different Hodge numbers.
result Diffeomorphic complex intersections can have different Hodge numbers.

In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given by parametric representation) in Euclidean space R^5. In transversal intersection…

2016-01-17abs ↗pdf ↗

We generalize the PL intersection product for chains on PL manifolds and for intersection chains on PL stratified pseudomanifolds to products of locally finite chains on non-compact spaces that are natural with respect to restriction to open sets. This is necessary to sheafify the intersection product, an essential ste…

2016-09-20abs ↗pdf ↗

Conditions for curves on a torus with specific pairwise intersections.

problem Finding curves on a torus with prescribed pairwise intersections.
method Necessary and sufficient conditions for curves on a torus with given pairwise intersections.
result Necessary and sufficient conditions for the existence of curves on a torus with specific pairwise intersections.

Study properties of self-similar continua with finite intersection property.

problem Characterize self-similar continua with finite intersection property.
method Prove intersection graph criterion, finite order theorem, and parameter matching theorem.
result All Jordan arcs starting from a intersection point in such continuum on a plane should have the same slope parameter at that point.

By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical Alexander polynomial invariants for smooth or PL locally-flat knots. We show that the i…

2003-07-10abs ↗pdf ↗

James McClure recently showed that the domain for the intersection pairing of PL chains on a PL manifold MM is a subcomplex of C(M)C(M)C_*(M)\otimes C_*(M) that is quasi-isomorphic to C(M)C(M)C_*(M)\otimes C_*(M) and, more generally, that the intersection pairing endows C(M)C_*(M) with the structure of a partially-defined commutati…

2008-08-12abs ↗pdf ↗

The paper extends intersection theory for b-divisors, proving monotonicity and volume inequalities.

problem Intersection theory for b-divisors and monotonicity of intersection products.
method Developed general intersection theory of nef b-divisors, defined restricted volume, proved monotonicity.
result Proved quantitative monotonicity of intersection product and new volume inequalities.

Study intersection polynomials of long virtual knots with supporting genera.

problem Characterize long virtual knots using geometric invariants.
method Define and analyze 11- and 22-supporting genera, and use them to filter long virtual knots.
result Provide complete realizability criteria for all twelve intersection polynomials.

New invariant csmc_{sm} simplifies computing geometric invariants of recursive group orbits.

problem Computing geometric invariants of recursive group orbits is hard.
method Introduced new invariant csmc_{sm} and used it to compute invariants explicitly.
result Explicit formulas for local Euler obstructions and sectional Euler characteristics.