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,742 papers · 148 categories

Trend · papers per month

17335066 · May 202619922001200920172026
48 results for triple grid diagrams

The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.

problem Constructing Lagrangian surfaces in complex projective space.
method Defining and analyzing triple grid diagrams to determine Lagrangian caps and surfaces.
result Triple grid diagrams can determine closed Lagrangian surfaces in CP2\mathbb{CP}^2 under certain conditions.

New method constructs moduli spaces of Lagrangian surfaces in CP^2 from grid diagrams.

problem Constructing explicit examples of triple grid diagrams for Lagrangian surfaces in CP^2.
method Elegant geometric construction reducing to linear algebra.
result Explicit construction of moduli space of triple grid diagrams.

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 ↗

A triple vector bundle is a cube of vector bundle structures which commute in the (strict) categorical sense. A grid in a triple vector bundle is a collection of sections of each bundle structure with certain linearity properties. A grid provides two routes around each face of the triple vector bundle, and six routes f…

2017-05-02abs ↗pdf ↗

This paper shows how to create surface-links with many triple points.

problem Creating surface-links with a large number of triple points.
method Analogous to knot diagrams, the paper uses broken sheet diagrams to project surface-links and analyze their triple points.
result There are non-split surface-links with arbitrarily many triple points.

Enumerates knots up to five crossings and describes moves between them.

problem Counting and classifying knots up to a specific number of crossings.
method Generated tables of minimal diagrams and derived moves between knots.
result Conjecture about a lower bound for the triple-crossing number based on Alexander polynomial.

We present a grid diagram analogue of Carter, Rieger and Saito's smooth movie theorem. Specifically, we give definitions for grid movies, grid movie isotopies and present a definition of grid planar isotopy as a particular subset of the grid diagram moves: stabilization, destabilization and commutation. We show that gr…

2013-03-07abs ↗pdf ↗

Formula for computing triple-cup product from Heegaard diagrams of 3-manifolds.

problem Computing the triple-cup product invariant of 3-manifolds.
method Explicit formula from Heegaard diagrams and reduction of Turaev's homotopy intersection form.
result Triple-cup product can be recovered from Heegaard diagrams and Turaev's form.

Half grid diagrams prove every link can be represented by a special type of grid diagram.

problem Representing links using grid diagrams and related invariants.
method Defining half grid diagrams and constructing canonical pairs, proving equivalence to Jones' construction, relating to classical link invariants.
result Established a new method to relate the oriented Thompson index to classical link invariants and provided bounds for knot invariants.

Paper shows how to represent Milnor's triple linking number using chord diagrams and doodle invariants.

problem Tackles the representation of Milnor's triple linking number.
method Establishes an analogous description for Milnor's triple linking number using counts of chord diagrams and doodle invariants.
result Shows that Milnor's triple linking number can be represented in terms of chord diagrams and doodle invariants.

Formula for Milnor triple linking number in link diagrams with multiple crossings.

problem Calculating Milnor triple linking number for complex link diagrams.
method Polyak-Viro type formula with explicit computation of configuration space integral.
result Formula applicable to diagrams with triple or more crossings.

Roseman moves are seven types of local modification for surface-link diagrams in 33-space which generate ambient isotopies of surface-links in 44-space. In this paper, we focus on Roseman moves involving triple points, one of which is the famous tetrahedral move, and discuss their independence. For each diagram of an…

2015-11-10abs ↗pdf ↗

This paper compiles and calculates triple point numbers for surface-links in Yoshikawa's table.

problem Determining the triple point number of surface-links in Yoshikawa's table.
method Using broken sheet diagrams, the paper compiles known triple point numbers and calculates or bounds the remaining ones.
result Compilation and calculation of triple point numbers for surface-links in Yoshikawa's table.

Minimal grid diagrams found for 13-crossing prime knots with 13 arc index.

problem Finding minimal grid diagrams for prime knots with specific crossing and arc indices.
method Used Knotscape to generate spanning trees and obtain minimal arc presentations in grid diagrams.
result 9,988 prime knots with 13 crossings and 13 arc index were identified.

Paper explores relationships between triple chords and a specific homotopy relation in knot theory.

problem Understanding the relationship between triple chords and a homotopy equivalence class in knot theory.
method Analyzes the number of triple chords and their connection to the strong (1, 2) homotopy equivalence class.
result Prime knot projections are trivialized by strong (1, 2) homotopy if they have no triple chords.

We explore a somewhat unexpected connection between knot Floer homology and shellable posets, via grid diagrams. Given a grid presentation of a knot K inside S^3, we define a poset which has an associated chain complex whose homology is the knot Floer homology of K. We then prove that the closed intervals of this poset…

2009-01-15abs ↗pdf ↗

We review the use of grid diagrams in the development of Heegaard Floer theory. We describe the construction of the combinatorial link Floer complex, and the resulting algorithm for unknot detection. We also explain how grid diagrams can be used to show that the Heegaard Floer invariants of 3-manifolds and 4-manifolds …

2012-10-14abs ↗pdf ↗

We use grid diagrams to investigate the Ozsvath-Szabo concordance invariant tau, and to prove that |tau(K_1)-tau(K_2)|<=g, whenever there is a genus g knot cobordism joining K_1 to K_2. This leads to an entirely grid diagram-based proof of Kronheimer-Mrowka's theorem, formerly known as the Milnor conjecture.

2010-11-24abs ↗pdf ↗

Minimal grid diagrams for 15,735 knots with 14 crossings and arc index 14.

problem Representing prime knots with 14 crossings and specific arc indices using grid diagrams.
method Enumerated all prime knots with 14 crossings, categorized by arc index, and found minimal grid diagrams for those with arc index 14.
result 8,027 knots with arc index 13 and 15,735 knots with arc index 14 were represented by minimal grid diagrams.

Inspired by the paper on quantum knots and knot mosaics [23] and grid diagrams (or arc presentations), used extensively in the computations of Heegaard-Floer knot homology [2,3,7,24], we construct the more concise representation of knot mosaics and grid diagrams via mirror-curves. Tame knot theory is equivalent to knot…

2011-06-19abs ↗pdf ↗

We give combinatorial descriptions of the Heegaard Floer homology groups for arbitrary three-manifolds (with coefficients in Z/2). The descriptions are based on presenting the three-manifold as an integer surgery on a link in the three-sphere, and then using a grid diagram for the link. We also give combinatorial descr…

2009-10-01abs ↗pdf ↗

Grid diagrams encode useful geometric information about knots in S^3. In particular, they can be used to combinatorially define the knot Floer homology of a knot K in S^3, and they have a straightforward connection to Legendrian representatives of K in (S^3, ξ_\st), where ξ_\st is the standard, tight contact structure.…

2008-04-18abs ↗pdf ↗

Minimal grid diagrams found for 13-crossing prime knots.

problem Finding the simplest grid diagrams for prime knots with 13 crossings.
method Converted prime alternating knots to grid diagrams, focusing on minimal configurations.
result 4878 prime alternating knots with 13 crossings have been represented by grid diagrams with 15 vertical segments.

We define combinatorial invariants of Legendrian and transverse links in universally tight lens spaces using grid diagrams, generalizing [OST08] and prove that they are equivalent to the invariants defined in [BVVV13] and [LOSS09]. We use these combinatorial invariants to characterize index one grid diagrams for knots …

2018-09-19abs ↗pdf ↗

We describe some regular techniques of calculating finite degree invariants of triple points free smooth plane curves S1R2S^1 \to R^2. They are a direct analog of similar techniques for knot invariants and are based on the calculus of {\em triangular diagrams} and {\em connected hypergraphs} in the same way as the calcul…

2014-07-27abs ↗pdf ↗

We extend the theory of combinatorial link Floer homology to a class of oriented spatial graphs called transverse spatial graphs. To do this, we define the notion of a grid diagram representing a transverse spatial graph, which we call a graph grid diagram. We prove that two graph grid diagrams representing the same tr…

2015-06-15abs ↗pdf ↗

In this short note we highlight some of the differences between cube diagrams and grid diagrams. We also list examples of small cube diagrams for all knots up to 7 crossings and give some examples of links.

2009-07-30abs ↗pdf ↗

A method for vectorizing persistence diagrams simplifies topological data analysis.

problem Challenges in integrating persistence diagrams into machine learning pipelines.
method Quantized Persistence and Integral transforms of Diagrams (Qupid) using binning and discrete transforms.
result Qupid preserves highly competitive performances compared to state-of-the-art methods across various classification tasks.

Similar to knots in S^3, any knot in a lens space has a grid diagram from which one can combinatorially compute all of its knot Floer homology invariants. We give an explicit description of the generators, differentials, and rational Maslov and Alexander gradings in terms of combinatorial data on the grid diagram. Moti…

2007-10-01abs ↗pdf ↗

In paper "A new twist on Lorenz links" (Journal of Topology 2(2009), 227-248) Joan Birman and Ilya Kofman prove the coincidence of the class of Lorenz links and the class of twisted links. The proof in that work is algebraic. We will identify this class in terms of grid diagrams and provide a transparent geometric argu…

2010-06-15abs ↗pdf ↗

Study on typical knots and links using grid diagrams, focusing on size, components, and writhe.

problem Understanding the statistical behavior of knots and links, especially their typical properties.
method Modeling knots and links with grid diagrams, examining three invariants: size, components, and writhe, through numerical analysis.
result The size of a random knot is uniformly distributed and linearly dependent on grid size, while the number of components follows a distribution whose mean and variance grow with log_2 of grid size.