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.

169,341 papers · 148 categories

Trend · papers per month

132264395527 · Jun 202019922001200920182026
48 results for pairwise linking number

The paper examines when links can have homeomorphic C-complexes.

problem When do two links have homeomorphic C-complexes?
method The paper investigates the conditions under which two links admit homeomorphic C-complexes, focusing on pairwise and triple linking numbers.
result Pairwise linking number provides a complete obstruction for 2-component links, while Milnor's triple linking number provides a complete obstruction for 3 or more components with zero pairwise linking number.

The paper uses Heegaard Floer homology to find lower bounds on link genera.

problem Finding lower bounds on the 4-genus of links with vanishing pairwise linking numbers.
method Using the h-function from Heegaard Floer homology to describe genera of surfaces bounded by link components.
result The h-function provides lower bounds for the 4-genus of links, and these bounds are sharp for some L-space links.

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.

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 ↗

Study on diagrams of links with triple-crossings and their properties.

problem Understanding the structure and properties of links using triple-crossing diagrams.
method Developed a set of moves analogous to Reidemeister moves for triple-crossing diagrams and defined the triple-crossing number.
result For nontrivial, nonsplit links other than the Hopf link, the triple-crossing number is strictly greater than the quintuple-crossing number.

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.

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.

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.

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 ↗

New invariant refines Milnor's triple linking number, revealing more information for complex links.

problem Indeterminacy of Milnor's triple linking number in complex link configurations.
method Introduced a new invariant called the total triple linking number, refining Milnor's original.
result The total triple linking number is non-trivial for every (n6)(n\ge 6)-component link, providing more information than classical triple linking numbers.

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 ↗

Researchers found unique exact Lagrangian fillings for a specific type of knot.

problem Tackling the uniqueness of exact Lagrangian fillings for Legendrian (2,n)(2,n) torus knots.
method Computed augmentations induced by exact Lagrangian fillings to distinguish them.
result Identified that these exact Lagrangian fillings are pairwise non-isotopic.

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.

S3C2 uses Siamese networks for semi-supervised clustering with pairwise constraints.

problem Semi-supervised clustering with pairwise constraints.
method S3C2 decomposes SSC into two classification tasks: first, using Siamese networks to label unlabeled pairs; second, using the labeled dataset for clustering.
result S3C2 outperforms existing SSC methods on various datasets.

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.

Study higher-order interactions in networks, proposing link prediction as a new benchmark.

problem Understanding higher-order interactions in complex systems.
method Temporal analysis of 19 datasets, focusing on interactions involving more than two nodes.
result Higher-order interactions are consistent across different systems, with tie strength and edge density influencing their presence.

Method learns all edges and link parameters globally for binary pairwise Markov models.

problem Learning sparse Ising models with sparsity assumption.
method l1-regularized logistic regression for simultaneous estimation of all edges and link parameters.
result Numerical experiments show the advantage of the simultaneous estimation method.

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

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.