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

132264395527 · Jun 202019922001200920172026
48 results for pairwise linking numbers

Any two knots admit orientation preserving homeomorphic Seifert surfaces, as can be seen by stabilizing. There is a generalization of a Seifert surface to the setting of links called a C-complex. In this paper, we ask when two links will admit orientation preserving homeomorphic C-complexes. In the case of 2-component …

2016-04-18abs ↗pdf ↗

This paper improves bounds on how many Delta-moves are needed to trivialize a link.

problem Counting the minimum number of Delta-moves to make a link homotopy trivial.
method Classification of link homotopy and extremal graph theory.
result Quadratic and cubic upper bounds on the homotopy trivializing numbers of links.

Milnor's triple linking numbers of a link in the 3-sphere are interpreted geometrically in terms of the pattern of intersections of the Seifert surfaces of the components of the link. This generalizes the well known formula as an algebraic count of triple points when the pairwise linking numbers vanish.

2001-09-28abs ↗pdf ↗

If L_1 and L_2 are two Brunnian links with all pairwise linking numbers 0, then we show that L_1 and L_2 are equivalent if and only if they have homeomorphic complements. In particular, this holds for all Brunnian links with at least three components. If L_1 is a Brunnian link with all pairwise linking numbers 0, and t…

1999-12-01abs ↗pdf ↗

Proves any three or more knots can form a genus-zero link in a 3-manifold.

problem Realizing any finite collection of knots as components of a genus-zero link.
method Proves the realizability of knots as components of genus-zero links in 3-manifolds, controlling pairwise linking numbers.
result Any finite collection of at least three isotopy classes of knots can form a genus-zero link in a 3-manifold, satisfying a specific condition.

For links with vanishing pairwise linking numbers, the link components bound pairwise disjoint surfaces in B4B^{4}. In this paper, we describe the set of genera of such surfaces in terms of the hh-function, which is a link invariant from Heegaard Floer homology. In particular, we use the hh-function to give lower bou…

2018-05-05abs ↗pdf ↗

We give a refined value group for the collection of triple linking numbers of links in the 3-sphere. Given two links with the same pairwise linking numbers we show that they have the same refined triple linking number collection if and only if the links admit homeomorphic surface systems. Moreover these two conditions …

2017-09-25abs ↗pdf ↗

Bar-Natan used Chinese characters to show that finite type invariants classify string links up to homotopy. In this paper, I construct the correct spaces of chord diagrams and Chinese characters for links up to homotopy. I use these spaces to show that the only rational finite type invariants of link homotopy are the p…

1998-07-29abs ↗pdf ↗

Every link in the 3-sphere has a projection to the plane where the only singularities are pairwise transverse triple points. The associated diagram, with height information at each triple point, is a triple-crossing diagram of the link. We give a set of diagrammatic moves on triple-crossing diagrams analogous to the Re…

2017-06-28abs ↗pdf ↗

New methods for delta-moves on algebraically split links identified.

problem Understanding delta-moves on algebraically split links.
method Introducing self and mixed delta-moves, proving equivalence, and calculating delta-splitting numbers.
result Two links are mixed delta-equivalent if they have the same pairwise linking number and components.

Study on links formed by pseudocircle arrangements, focusing on three unavoidable cases.

problem Counting non-equivalent positive oriented links with pseudocircle arrangements as shadows.
method Analyzing three unavoidable arrangements of pseudocircles to estimate the number of non-equivalent links.
result Sharp estimates on the number of non-equivalent positive oriented links for the three unavoidable arrangements.

Links can be transformed into many others using a specific operation.

problem Understanding the relationship between strongly quasipositive links and their concordance.
method Used a satellite operation with a slice knot to transform links.
result Strongly quasipositive links can be transformed into infinitely many other links.

Delta-unlinking number measures how to unlink algebraically split links.

problem Measuring unlinking complexity of algebraically split links.
method Defining delta-unlinking number as minimum delta-moves to unlink, proving bounds and calculating specific values.
result Precise delta-unlinking numbers for algebraically split prime links up to 9 crossings, and 4-genus values for most.

In the 1950's Milnor defined a family of higher order invariants generalizing the linking number. Even the first of these new invariants, the triple linking number, has received and fruitful study since its inception. In the case that LL has vanishing pairwise linking numbers, this triple linking number gives an integ…

2019-01-16abs ↗pdf ↗

We will prove that, for a 22 or 33 component LL-space link, HFLHFL^- is completely determined by the multi-variable Alexander polynomial of all the sub-links of LL, as well as the pairwise linking numbers of all the components of LL. We will also give some restrictions on the multi-variable Alexander polynomial of …

2015-05-05abs ↗pdf ↗

For a Legendrian (2,n)(2,n) torus knot or link with maximal Thurston-Bennequin number, Ekholm, Honda, and Kálmán constructed CnC_n exact Lagrangian fillings, where CnC_n is the nn-th Catalan number. We show that these exact Lagrangian fillings are pairwise non-isotopic through exact Lagrangian isotopy. To do that, we com…

2016-07-11abs ↗pdf ↗

We study the space of "link maps": the space of maps of a disjoint union of compact, closed manifolds P_1, . . ., P_k into a manifold N whose images are pairwise disjoint. We apply the manifold calculus of functors developed by Goodwillie and Weiss to study the difference between it and its linear and quadratic approxi…

2007-02-06abs ↗pdf ↗

We recall the definition of the quadratic helicity invariant and of the higher asymptotic ergodic MM-invariant. We present a simpler new proof (in part) that the MM-invariant is ergodic. The MM-invariant is a higher invariant, this means that for the magnetic field with closed magnetic lines the invariant is not a f…

2015-03-18abs ↗pdf ↗

Develops a new causal model for path-dependent link prediction.

problem Existing causal models assume fixed node factors, but real-world links can depend on existing ones.
method Introduces causal lifting and structural pairwise embeddings for path-dependent link prediction.
result Validated on three scenarios, demonstrating improved accuracy for causal link prediction.

Let LL be an nn-component link (n>1n>1) with pairwise nonzero linking numbers in a rational homology 33-sphere YY. Assume the link complement X:=Yν(L)X:=Y\setminusν(L) has nondegenerate Thurston norm. In this paper, we study when a Thurston norm-minimizing surface SS properly embedded in XX remains norm-minimizing after…

2019-06-20abs ↗pdf ↗

The paper proves infinitely many strong symplectic fillings for cusp singularity links.

problem Proving the existence of infinitely many strong symplectic fillings for specific types of singularity links.
method Analyzing Sol3Sol^3-manifolds and SL~(2;R)\widetilde{SL}(2;\mathbb{R})-manifolds with canonical contact structures.
result Links of cusp, unimodal, and hyperbolic Brieskorn singularities admit infinitely many non-diffeomorphic strong symplectic fillings.

Cross-entropy loss linked to metric learning, outperforming complex pairwise losses.

problem Improving metric learning performance without complex optimization schemes.
method Theoretical analysis linking cross-entropy to pairwise losses, showing cross-entropy as an upper bound and equivalent to mutual information maximization.
result Minimizing cross-entropy is equivalent to maximizing mutual information, leading to state-of-the-art performance.

New method for quandle presentations of surface knots in 4-manifolds.

problem Computing fundamental quandle presentations for surface knots in arbitrary 4-manifolds.
method Wirtinger type presentation of the fundamental quandle for surface links in 4-manifolds.
result Infinitely many pairwise non-local surface knots with specific bridge numbers in certain 4-manifolds.

Mazur's knot exterior is described by a single regular ideal octahedron, leading to hyperbolic structures related to the Whitehead link.

problem Proving nonhomeomorphism of boundaries of Mazur and Jester manifolds
method Using hyperbolic geometry, Dehn filling, and systolic geodesics
result Proving the boundaries of all Mazur and Jester manifolds are pairwise nonhomeomorphic

Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conjecture that it can be algorithmically checked if an (ordered or unorde…

2019-08-11abs ↗pdf ↗

Networks provide a powerful formalism for modeling complex systems by using a model of pairwise interactions. But much of the structure within these systems involves interactions that take place among more than two nodes at once; for example, communication within a group rather than person-to person, collaboration amon…

2018-02-20abs ↗pdf ↗

The paper analyzes cryptocurrency trading networks using pairwise and high-order dependencies.

problem Understanding information flows and dependencies in cryptocurrency markets.
method Defined a cryptocurrency trading network using weekly log returns, analyzed using Granger causality and O-information.
result High-order dependencies reveal that stable coins play a major role in high-order effects.

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.

Paper proposes Pcomp classification for binary classification with pairwise confidence comparisons.

problem Lack of pointwise labels due to privacy, confidentiality, or security reasons.
method Developed Pcomp classification, derived an unbiased risk estimator (URE), and improved it using correction functions and consistency regularization.
result Demonstrated the effectiveness of Pcomp classification methods.