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.
New perspective on Heegaard splittings using square complexes and combinatorial measurements.
We study the geometry of fully augmented link complements in by looking at their link diagrams. We extend the method introduced by Thistlethwaite and Tsvietkova to fully augmented links and define a system of algebraic equations in terms of parameters coming from edges and crossings of the link diagrams. Combinin…
In this article we study the differential graded algebra (DGA) invariant associated to Legendrian knots in tight lens spaces. Given a grid number one diagram for a knot in L(p, q), we show how to construct a special Lagrangian diagram suitable for computing the DGA invariant for the Legendrian knot specified by the dia…
Given any representation V of a complex linear reductive Lie group G_0, we show that a larger semi-simple Lie group G with g=g_0 + V + V* + ..., exists precisely when V has a finite number of G_0-orbits. In particular, V admits an open G_0-orbit. Furthermore, this corresponds to an augmentation of the Dynkin diagram of…
For any Legendrian knot in (R^3,ker(dz-ydx)), we show that the existence of an augmentation to any field of the Chekanov-Eliashberg differential graded algebra over Z[t,t^{-1}] is equivalent to the existence of a ruling of the front diagram, generalizing results of Fuchs, Ishkhanov, and Sabloff. We also show that any e…
We study the fibration of augmented link complements. Given the diagram of an augmented link we associate a spanning surface and a graph. We then show that this surface is a fiber for the link complement if and only if the associated graph is a tree. We further show that fibration is preserved under Dehn filling on cer…
We investigate the geometry of hyperbolic knots and links whose diagrams have a high amount of twisting of multiple strands. We find information on volume and certain isotopy classes of geodesics for the complements of these links, based only on a diagram. The results are obtained by finding geometric information on ge…
Generalizes fully augmented links to doubled 3-manifolds with geometric bounds.
This work classifies belted sum decompositions of fully augmented links.
We consider knots whose diagrams have a high amount of twisting of multiple strands. By encircling twists on multiple strands with unknotted curves, we obtain a link called a generalized augmented link. Dehn filling this link gives the original knot. We classify those generalized augmented links that are Seifert fibere…
Given a Legendrian link in , we extend the definition of a normal ruling from given by Lavrov and Rutherford and show that the existence of an augmentation to any field of the Chekanov-Eliashberg differential graded algebra over is equivalent to the existence of a …
New method clusters infant vocalizations using topological data.
We show that if a Legendrian knot in standard contact ${\bb R}^3$ possesses a generating family then there exists an augmentation of the Chekanov-Eliashberg DGA so that the associated linearized contact homology (LCH) is isomorphic to singular homology groups arising from the generating family. In this setting we show …
For various series of complex semi-simple Lie algebras $\fg (t)$ equipped with irreducible representations , we decompose the tensor powers of into irreducible factors in a uniform manner, using a tool we call {\it diagram induction}. In particular, we interpret the decompostion formulas of Deligne \cite{d…
Study of braid varieties and their Legendrian isotopy.
Generalizes Thistlethwaite-Tsvietkova method to 3-manifolds.
New examples show no upper bounds on link volumes on incompressible surfaces.
If a hyperbolic link has a prime alternating diagram D, then we show that the link complement's volume can be estimated directly from D. We define a very elementary invariant of the diagram D, its twist number t(D), and show that the volume lies between v_3(t(D) - 2)/2 and v_3(16t(D) - 16), where v_3 is the volume of a…
Knot invariants and quiver stability linked through full twists.
We introduce several techniques for sampling and visualizing the latent spaces of generative models. Replacing linear interpolation with spherical linear interpolation prevents diverging from a model's prior distribution and produces sharper samples. J-Diagrams and MINE grids are introduced as visualizations of manifol…
We compute the Chekanov-Eliashberg contact homology of what we call the Legendrian closure of a positive braid. We also construct an augmentation for each such link diagram. Then we apply the monodromy techniques established in an earlier paper to a certain natural loop in the space L' of positive Legendrian (p,q) toru…
We define ruling invariants for even-valence Legendrian graphs in standard contact three-space. We prove that rulings exist if and only if the DGA of the graph, introduced by the first two authors, has an augmentation. We set up the usual ruling polynomials for various notions of gradedness and prove that if the graph …
The paper refines transformations of lattice diagrams and introduces dotted diagrams.
This note explains how to transform Heegaard diagrams into framed link diagrams.
New minimal link diagrams found, including torus links and homogeneous ones.
Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.
Kernelized Taylor diagram visualizes data populations with fewer assumptions.
We consider S^1-families of Legendrian knots in the standard contact R^3. We define the monodromy of such a loop, which is an automorphism of the Chekanov-Eliashberg contact homology of the starting (and ending) point. We prove this monodromy is a homotopy invariant of the loop. We also establish techniques to address …
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …
Study categorizes knots and links as rigid or shaky based on Reidemeister moves.
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…
Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …
Problems on region choices for knot and link diagrams solved using Alexander numbering.
Table of symmetric diagrams for knots up to 10 crossings.
The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we provide a framework for working with subknots inside of knot diagrams via knotoid dia…
Proves minimal crossing diagrams for specific spatial graphs.
Rectangular diagrams help analyze foliations in 3-sphere.
Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alter…
The paper explores when specific knot operations simplify diagrams.
Gauss diagrams' properties can change with Hamiltonian cycle choice.
New estimate of semimeander complexity for knots with more than 10 crossings.
Paper proves link diagrams can be realized for some but not all types of links.
GridPyM handles grid diagrams for knot theory.
There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…
The study improves inequalities for link diagrams and introduces weak rectangular diagrams.
In this paper, a link diagram is said to be minimal if no Reidemeister move I or II can be applied to it to reduce the number of crossings. We show that for an arbitrary diagram D of a link without a trivial split component, a minimal diagram obtained by applying Reidemeister moves I and II to D is unique. The proof al…
Algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.