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

14274154 · May 202619922001200920172026
48 results for grid diagram

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.

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 ↗

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.

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.

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.

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 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.

In this paper, we define the set of singular grid diagrams SG\mathcal{SG} which provides a unified description for singular links, singular Legendrian links, singular transverse links, and singular braids. We also classify the complete set of all equivalence relations on SG\mathcal{SG} which induce the bijection onto e…

2017-08-12abs ↗pdf ↗

We explain how to compute the Jones polynomial of a link from one of its grid diagrams and we observe a connection between Bigelow's homological definition of the Jones polynomial and Kauffman's definition of the Jones polynomial. Consequently, we prove that the Maslov grading on the Seidel-Smith symplectic link invari…

2009-02-19abs ↗pdf ↗

According to the idea of Ozsváth, Stipsicz and Szabó, we define the knot invariant ΥΥ without the holomorphic theory, using constructions from grid homology. We develop a homology theory using grid diagrams, and show that ΥΥ, as introduced this way, is a well-defined knot invariant. We reprove some important proposit…

2019-03-14abs ↗pdf ↗

Study grid homology of diagonal knots, finding key terms related to prime factors and decompositions.

problem Determine grid homology of diagonal knots and compare them to other knot types.
method Use grid diagrams and combinatorial knot Floer homology to analyze diagonal knots.
result Grid homology detects the number of prime factors and decompositions of the knot into non-integer tangles.

Using a Heegaard diagram for the pullback of a knot KS3K \subset S^3 in its cyclic branched cover Σm(K)Σ_m(K) obtained from a grid diagram for KK, we give a combinatorial proof for the invariance of the associated combinatorial knot Floer homology over Z\mathbb{Z}.

2018-04-30abs ↗pdf ↗

This paper is a short introduction to the combinatorial version of tangle Floer homology defined in "Combinatorial tangle Floer homology". There are two equivalent definitions---one in terms of strand diagrams, and one in terms of bordered grid diagrams. We present both, discuss the correspondence, and carry out some e…

2016-04-28abs ↗pdf ↗

For knots in S^3, the bi-graded hat version of knot Floer homology is defined over Z; however, for a link L in S^3 with #|L|=l>1, there are 2^{l-1} bi-graded hat versions of link Floer homology defined over Z, the multi-graded hat version of link Floer homology is only defined over F_2 from holomorphic considerations, …

2010-02-04abs ↗pdf ↗

Given a grid presentation of a knot (or link) K in the three-sphere, we describe a Heegaard diagram for the knot complement in which the Heegaard surface is a torus and all elementary domains are squares. Using this diagram, we obtain a purely combinatorial description of the knot Floer homology of K.

2006-07-26abs ↗pdf ↗

The paper examines linking numbers in grid models and finds polynomial moments.

problem Analyzing linking numbers in grid models.
method Examined linking numbers as a random variable on isotopy classes of 2-component links, computed moments and limits.
result The uuth moment of the linking number is a polynomial in the grid size with degree dud\leq u, and all odd moments vanish.