Minimal moves for surfaces in 4D identified.
problem Classifying surfaces embedded in 4D space.
method Derived minimal generating set of planar moves.
result Identified minimal moves for surfaces in 4D.
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,051 papers · 148 categories
Trend · papers per month
48 results for “planar diagrams”
Grid Moviesmath.GT
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…
Paper introduces a new invariant for planar knotoids.
problem Defining an invariant for planar knotoids.
method Using Gauss diagrams and transcendental functions.
result The invariant is a Vassiliev invariant of order one.
We want to construct a homological link invariant whose Euler characteristic is MOY polynomial as Khovanov and Rozansky constructed a categorification of HOMFLY polynomial. The present paper gives the first step to construct a categorification of MOY polynomial. For the essential colored planar diagrams with additional…
Study improves isoperimetric inequality for random groups.
problem Improving isoperimetric inequality for random groups.
method Generalizing the inequality to non-planar diagrams.
result Non-planar isoperimetric inequality established.
A New Way to Tabulate Knotsmath.GT
We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1 vertices. The number of valence 1 vertices of the trees is called the girth of the kno…
Paper refines braidoid equivalence for spherical knotoids.
problem Equivalence of knotoid diagrams in spherical space.
method Refined -equivalence of braidoid diagrams.
result Equivalence theorem for multi-knotoid diagrams in .
Planar pure braids form a group that acts on a CAT(0) cubical complex.
problem Characterizing the structure of planar pure braids as a group.
method Demonstrated that the planar pure braid group is a diagram group.
result The planar pure braid group is a diagram group.
In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand alone object and discuss its relationship with link diagrams. We give an explicit …
We describe some of the algebra underlying the decomposition of planar grid diagrams. This provides a useful toy model for an extension of Heegaard Floer homology to 3-manifolds with parametrized boundary. This paper is meant to serve as a gentle introduction to the subject, and does not itself have immediate topologic…
In a recent work of Ayaka Shimizu, she defined an operation named region crossing change on link diagrams, and showed that region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that region crossing change on a 2-component link diagram is an unknotting operation if and only…
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general graphs have not been studied, and are potentially equally valuable in the study…
The paper explores knotoid invariants on the plane using quandles and cocycles.
problem Classifying planar knotoids due to their complexity and lack of invariants.
method Investigates equivalence of planar knotoids using quandle colorings and cocycle invariants.
result Introduces a new invariant called the triangular quandle cocycle invariant.
Virtual knots are associated with knot diagrams, which are not obligatory planar. The recently suggested generalization from N=2 to arbitrary N of the Kauffman-Khovanov calculus of cycles in resolved diagrams can be straightforwardly applied to non-planar case. In simple examples we demonstrate that this construction p…
Virtual Knot Theorymath.GT
Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via graphical diagrams with virtual crossings. Virtual knot theory studies non-planar Gauss…
Classifies doodles into prime and super prime types, describing them with doodle codes.
problem Classifying doodles into prime and super prime types.
method Using doodle codes to describe complementary regions and enumerate doodle diagrams.
result Super prime doodles have a Hamiltonian circuit.
We study first order local invariants of Vassiliev type for Lagrangian immersions with generic planar caustics. For this we produce some examples of 2-parameter families of Lagrangian maps and study their bifurcation diagrams.
In this brief note, we give an explicit sequence of Heegaard moves interpolating between local versions of the Kauffman-states Heegaard diagram and the planar Heegaard diagram used in knot Floer homology, and show how these local moves can be used to go between the global versions of the Heegaard diagrams.
We classify link diagrams with Turaev genus one and two in terms of an alternating tangle structure of the link diagram. The proof involves surgery along simple closed curves on the Turaev surface, called cutting loops, which have corresponding cutting arcs that are visible on the planar link diagram. These also provid…
Proves minimal crossing diagrams for specific spatial graphs.
problem Proving minimal crossing diagrams for spatial graphs.
method Analyzing adequate diagrams and replacing vertices and edges.
result All 1-vertex spatial graphs with adequate diagrams have minimal crossing number.
We describe the space of arrow diagram formulas for virtual knot diagrams in the annulus as the kernel of a linear map, inspired from a conjecture due to M. Polyak. As a main application, we slightly improve Grishanov-Vassiliev's theorem for planar chain invariants.
Minimal moves for surfaces in 4D discovered, linking planar and spatial moves.
problem Finding the minimal set of moves for surfaces in 4D.
method Derived minimal generating set of spatial moves, translated into planar moves.
result Minimal generating set of spatial moves for surfaces in 4D.
A graph G is called "minimalizable" if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by crossing changes. If, furthermore, the minimal diagram is unique up to crossing changes then G is called "strongly minimalizable". In this article, it is explained how minimalizability of a gr…
Paper defines a jellyfish algorithm for a specific subfactor planar algebra.
problem Diagrammatic presentation of generators and relations for subfactor planar algebra.
method Diagrammatic presentation and proof of well-definedness of jellyfish algorithm.
result Jellyfish algorithm is a well-defined surjection onto C for subfactor planar algebra.
Planar decomposition simplifies HOMFLY polynomial calculation for certain knots and links.
problem Calculating HOMFLY polynomial for specific types of knots and links.
method Planar decomposition of bipartite diagrams, lifting from sl(2) to sl(N).
result HOMFLY polynomials of many knots and links have planar decompositions.
KnotMosaics package simplifies knot theory computations in SageMath.
problem Efficiently computing knot mosaic diagrams and their properties.
method Developed a SageMath package for knot mosaic diagrams, implementing validation, strand tracing, and computation algorithms.
result Enabled easy computation of knot mosaic diagrams and their properties.
We characterize planar diagrams which may be divided into n arc embeddings in terms of their chord diagrams, generalizing a result of Taniyama for the case n = 2. Two algorithms are provided, one which finds a minimal arc embedding (in quadradic time in the number of crossings), and one which constructs a minimal subdi…
Paper proves a conjecture about knot invariants using diagrams.
problem Relating quantum and classical knot invariants.
method Introduced a diagrammatic version of the AJ Conjecture's polynomial, proved one direction of the conjecture.
result Proved one direction of the AJ Conjecture using knot diagrams and state sums.
The paper extends knot polynomials to annular and toroidal pseudo links.
problem Analyzing pseudo links with undefined crossings.
method Introducing Kauffman bracket and Jones-type polynomials for annular and toroidal pseudo links.
result New tools for studying annular and toroidal pseudo links.
We show that a small tree-decomposition of a knot diagram induces a small sphere-decomposition of the corresponding knot. This, in turn, implies that the knot admits a small essential planar meridional surface or a small bridge sphere. We use this to give the first examples of knots where any diagram has high tree-widt…
Immersed flat ribbon knotsmath.GT
Study minimum ribbonlength of immersed flat knots and links.
problem Finding the minimum ribbonlength for immersed planar knots and links.
method Embedding into disk diagram space to find length minimizers.
result Computed minimal ribbonlength for some knot and link diagrams.
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.
Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.
problem Unknottability of spatial graphs by region crossing changes.
method Region crossing changes to switch over/under relations within regions of spatial graph diagrams.
result Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.
Universal Knot Diagramsmath.GT
We study collections of planar curves that yield diagrams for all knots. In particular, we show that a very special class called potholder curves carries all knots. This has implications for realizing all knots and links as special types of meanders and braids. We also introduce and apply a method to compare the effici…
In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of ribbon graphs. We describe an extension of the flow polynomial to virtual graphs, t…
Algorithm constructs and classifies weaving diagrams using combinatorial methods.
problem Classifying unique weaving diagrams with over/under information.
method Systematic algorithm based on tiling and crossing matrices.
result Classification of periodic structures based on minimum crossings.
It is shown that there exist alternating non-Montesinos knots whose essential spanning surfaces with maximal and minimal boundary slopes are not realised by the checkerboard surfaces coming from a reduced alternating planar diagram.
We introduce and study graphic lambda calculus, a visual language which can be used for representing untyped lambda calculus, but it can also be used for computations in emergent algebras or for representing Reidemeister moves of locally planar tangle diagrams.
New method for calculating HOMFLY polynomials in symmetric representations.
problem Calculating HOMFLY polynomials for symmetric representations.
method Planar decomposition and projection to symmetric representations.
result Restoration of planarity and new insights into HOMFLY polynomials.
The Link Smoothing Gamemath.CO
We introduce a topological combinatorial game called the Link Smoothing Game. The game is played on the shadow of a link diagram and legal moves consist of smoothing precrossings. One player's goal is to keep the diagram connected while the other player's goal is to disconnect the shadow. We make significant progress t…
Well-quasi-orders proved on embedded planar graphs.
problem Proving well-quasi-orders on embedded planar graphs.
method Careful analysis and extensions of classical methods for embedded minor relations.
result Embedded minor relations are well-quasi-orders on various classes of embedded planar graphs.
A plane curve is a knot diagram in which each crossing is replaced by a 4-valent vertex, and so are dual to a subset of planar quadrangulations. The aim of this paper is to introduce a new tool for sampling diagrams via sampling of plane curves. At present the most efficient method for sampling diagrams is rejection sa…
This paper classifies a specific weave type by their crossing number.
problem Classifying doubly periodic untwisted (p,q)-weaves.
method Classification by crossing number, introducing crossing matrix for equivalence.
result Classification of untwisted (p,q)-weaves by their crossing number.
Unbraided wiring diagrams for Stein fillings of lens spaces are described.
problem Constructing Stein fillings of lens spaces with canonical contact structures.
method Algorithm to draw unbraided wiring diagrams equivalent to Lefschetz fibrations.
result Wiring diagrams can be extended to symplectic graphical disks with marked points.
Parity in Knotoidsmath.GT
The paper explores parity in knotoids and virtual knots, proving a conjecture and introducing a new polynomial.
problem Investigating parity in knotoids and its relation to virtual knots.
method Introducing a planar parity bracket polynomial and using the Nikonov/Manturov theorem.
result Minimal diagrams of knot-type knotoids have zero height.
We use mathematical induction to prove that the horizontal composition in the class of coherently diagonal complexes is indeed a binary operation. That is to say, the embedding of two coherently diagonal complexes in an alternating planar diagram produces a coherently diagonal complex.
Classifies Morse flows on 3-sphere with specific saddle connections.
problem Classifying Morse-Smale flows on a 3-sphere with specific saddle connections.
method Used generalized Heegaard diagrams (Pr-diagrams) to classify flows.
result Found all possible, up to homeomorphism, ways to embed two circles in a 2-sphere with no more than 10 points of transversal intersection.
Algorithm finds knot diagrams from exterior triangulations.
problem Finding knot diagrams from their exteriors.
method First practical algorithm for finding diagrams from triangulations of exteriors.
result First diagrams for 23 link exteriors with over 2,500 crossings.