The paper connects knot theory and cluster algebras via dimer face polynomials.
problem Understanding the relationship between knot theory and cluster algebras.
method Analyzing dimer face polynomials and their connections to Alexander polynomials and cluster algebras.
result Dimer face polynomials are multivariate generalizations of Alexander polynomials and F-polynomials in cluster algebras. We develop a dimer model for the Alexander polynomial of a knot. This recovers Kauffman's state sum model for the Alexander polynomial using the language of dimers. By providing some additional structure we are able to extend this model to give a state sum formula for the twisted Alexander polynomial of a knot dependin…
Alternative proof of Alexander polynomial trapezoid conjecture using dimers.
problem Alexander polynomial trapezoid conjecture for special alternating links.
method Dimer model approach to Alexander polynomial.
result Shorter and more accessible proof of Azarpendar, Juhász, and Kálmán's result.
Quantum model for knotted graphs from knot theory.
problem Constructing an isotopy invariant polynomial for knotted bipartite ribbon graphs.
method Applying quantum topology to construct an isotopy invariant polynomial.
result Computed the expected number of loops in the double dimer model.
New methods classify convex lattice polygons for affine dimers.
problem Not all convex lattice polygons are characteristic polygons of affine dimers.
method General constructions and algorithm for finding affine dimers with prescribed polygons.
result All lattice triangles, generalised parallelograms, and polygons of genus at most two admit an affine dimer.
Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological space called the dimer space of the graph. This space turns out to be a cubed comp…
Fox coloring provides a combinatorial framework for studying dihedral representations of the knot group. The less well-known concept of Dehn coloring captures the same data. Recent work of Carter-Silver-Williams clarifies the relationship between the two focusing on how one transitions between Fox and Dehn colorings. I…
Let L be any infinite biperiodic alternating link. We show that for any sequence of finite links that Folner converges almost everywhere to L, their determinant densities converge to the Mahler measure of the 2-variable characteristic polynomial of the toroidal dimer model on an associated biperiodic graph.
The Vol-Det Conjecture relates the volume and the determinant of a hyperbolic alternating link in S3. We use exact computations of Mahler measures of two-variable polynomials to prove the Vol-Det Conjecture for many infinite families of alternating links. We conjecture a new lower bound for the Mahler measure of cer…
This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of perfect matchings (or dimers) of this graph. The weights are Tutte'…
Partition functions for dimers on closed oriented surfaces are known to be alternating sums of Pfaffians of Kasteleyn matrices. In this paper, we obtain the formula for the coefficients in terms of discrete spin structures.
In a previous paper, we showed how certain orientations of the edges of a graph G embedded in a closed oriented surface S can be understood as discrete spin structures on S. We then used this correspondence to give a geometric proof of the Pfaffian formula for the partition function of the dimer model on G. In the pres…
Integrable dynamics explained via geometric maps and cluster algebras.
problem Integrable dynamics in projective geometry.
method Twisted triple crossing diagram maps and cluster integrable systems.
result Cross-ratio dynamics described by geometric R-matrices. We establish a correspondence between the dimer model on a bipartite graph and a circle pattern with the combinatorics of that graph, which holds for graphs that are either planar or embedded on the torus. The set of positive face weights on the graph gives a set of global coordinates on the space of circle patterns wi…
The study examines how gamma positivity and PL homeomorphism types affect simplicial spheres.
problem Understanding gamma positivity and its relation to PL homeomorphism types in simplicial spheres.
method Using edge contractions and the link condition as proxies for flagness, the study analyzes the effect of gamma positivity on simplicial spheres.
result The link condition has a trivial effect on gamma vectors of high-dimensional simplicial spheres with nonnegative gamma vectors.
The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained using purely geometrical methods. The key step in the proof consists of a corres…
The paper confirms a conjecture linking link bipyramid volume and Mahler measure.
problem Link bipyramid volume and Mahler measure relationship for alternating links.
method Using isoradial graphs and spanning trees on lattices, the authors confirm the conjecture for two examples and calculate five more.
result The conjecture is confirmed for specific examples of alternating links.
DEO uses gradient information to escape saddle points in neural networks.
problem Training deep neural networks struggles with flat regions and saddle points.
method Dimer-Enhanced Optimization (DEO) uses gradient information to estimate curvature and escape saddle points.
result DEO improves training efficiency and performance compared to standard first-order methods.
A new method trains physics-constrained neural networks more efficiently.
problem Training machine learning tools with limited data and physical constraints.
method Dual-Dimer method for searching saddle points in nonconvex-nonconcave functions.
result The Dual-Dimer method improves training efficiency and convergence speed.
Study integrability of quantized six-vertex model on torus.
problem Integrability of a specific lattice model on a torus.
method Defined layer transfer matrices and tetrahedron equations for admissible graphs.
result Established commutativity of transfer matrices and derived quantum Hamiltonians.
We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach provides an interesting alternative to the well-known graph cut paradigm in that it …
Graphs and local systems count multiwebs.
problem Counting multiwebs in graphs with local systems.
method Using Kasteleyn matrices and web-traces.
result Determinant of Kasteleyn matrix counts multiwebs.
New algebraic numbers defined by a specific equation.
problem No direct problem stated; focuses on new algebraic numbers.
method Definition of superalgebraic Markov numbers via a Grassmann integer equation.
result Introduced new algebraic numbers with applications in Teichmüller spaces.
Develops TCD maps to relate discrete differential geometry and cluster algebras.
problem Capturing constraints and dynamics in discrete differential geometry.
method Triple crossing diagram maps (TCD maps) and geometric operations.
result Establishes a hierarchy of cluster structures on TCD maps.
The abstract theorem is extended to higher genus surfaces.
problem Generalizing the web trace theorem to higher genus surfaces.
method Geometric derivation and spin geometry of embedded loops.
result Expansion of twisted Kasteleyn matrices for higher genus surfaces.
Machine learning classifies topological phases in leaky photonic lattices.
problem Classifying topological phases in leaky photonic lattices using limited data.
method A fully connected neural network trained on bulk intensity measurements.
result Accurate determination of topological properties from intensity distributions.
Novel symmetry found in nanocarbons' discrete principal curvature structure.
problem Identifying novel symmetries in nanocarbons' geometric structures.
method First-principles calculations and discrete geometry analysis.
result Discovery of a novel symmetry (pre-constant discrete principal curvature) in nanocarbons.
The Kac-Ward formula allows to compute the Ising partition function on a planar graph G with straight edges from the determinant of a matrix of size 2N, where N denotes the number of edges of G. In this paper, we extend this formula to any finite graph: the partition function can be written as an alternating sum of the…
Promoter is a short region of DNA which is responsible for initiating transcription of specific genes. Development of computational tools for automatic identification of promoters is in high demand. According to the difference of functions, promoters can be of different types. Promoters may have both intra and inter cl…
New F-polynomial distinguishes knotoid diagrams not previously possible.
problem Polynomial invariants for knotoids.
method Introduced F-polynomial and constructed distinguishing examples. result New invariant F distinguishes knotoids not previously possible. The paper studies polynomials and ideals from colored Jones polynomials for links.
problem Understanding the structure of colored Jones polynomials for links.
method Investigates commutative and noncommutative ideals derived from colored Jones polynomials.
result Formulates the link version of the AJ conjecture.
Paper constructs a new approach to extract Affine Index Polynomial from Sawollek Polynomial.
problem Examining relationships between Affine Index Polynomial and Sawollek Polynomial.
method New approach to extract Affine Index Polynomial from Sawollek Polynomial.
result Constructs a concise proof of Mellor's Theorem.
This paper studies the Riley polynomial of 2-bridge knots using Chebyshev polynomials.
problem Understanding the Riley polynomial of 2-bridge knots and its splitting property.
method Introducing ε-Chebyshev polynomials to express and split the Riley polynomial.
result Explicit formula for the splitting polynomial as ε-Chebyshev polynomials.
Novel knot polynomials from Gaussian calculus show half vanish and determine Jones polynomials.
problem Understanding and characterizing knot polynomials from Gaussian calculus.
method Gaussian calculus of generating series for noncommutative algebras, connected sum of knots.
result Half of the polynomials vanish and three polynomials are explicitly given.
The paper defines and classifies Cappell-Shaneson polynomials.
problem Characterizing Cappell-Shaneson polynomials.
method Algebraic conditions on polynomials, reduction modulo primes, and construction of infinite series.
result Complete lists of Cappell-Shaneson polynomials of degrees 4 and 5, and several infinite series of degree 6.
Developed algorithms to compute three polynomial invariants of veering triangulations.
problem Computing polynomial invariants of veering triangulations.
method Introduced and used algorithms for taut, veering, and Teichmüller polynomials based on upper and lower tracks of veering triangulations.
result Proved that the lower and upper taut polynomials are equal but the veering polynomials can differ.
Study links weaving knots with polynomial coefficients and lattice numbers.
problem Understanding polynomial coefficients of weaving knots and their lattice counterparts.
method Established relationships between Jones and Chebyshev polynomials, and derived explicit formulas for Alexander polynomials.
result Proved coefficients of Jones polynomial are Whitney numbers of Lucas lattices and satisfied Fox's trapezoidal conjecture.
Study revisits Alexander-Conway and Kauffman bracket polynomials for pretzel links.
problem Understanding polynomial invariants of pretzel links.
method Revisits Alexander-Conway and Kauffman bracket polynomials for pretzel links P(1,1,n). result Reveals properties of Alexander-Conway and Kauffman bracket polynomials for P(1,1,n). Paper connects AJ conjecture and colored Jones polynomial potential function.
problem Relationship between A-polynomial and colored Jones polynomial. method Connects AJ conjecture and colored Jones polynomial potential function.
result Establishes connection between A-polynomial and colored Jones polynomial potential function. Associated with each oriented link is the two variable Homflypt polynomial. The Morton-Franks-Williams (MFW) inequality gives rise to an expression for the Homflypt polynomial with MFW coefficient polynomials. These MFW coefficient polynomials are labelled in a braid-dependent manner and may be zero, but display a numb…
This paper investigates the equivalence between Yamada polynomial and Jones polynomial of associated links for brunnian θ-curves.
problem Understanding the relationship between Yamada polynomial and Jones polynomial for θ-curves.
method Investigates the equivalence between the normalized Yamada polynomial of θ-curves and the Jones polynomial of their associated links.
result Shows that the two polynomials are equivalent for brunnian θ-curves.
The taut polynomial equals a twisted Alexander polynomial.
problem Understanding the relationship between taut polynomials and Alexander polynomials.
method Defined taut polynomial of veering triangulations and proved it equals a twisted Alexander polynomial.
result The taut polynomial equals a twisted Alexander polynomial of the underlying manifold.
Quantum polynomials are derived from a specific tribracket structure.
problem Quantum enhancement polynomials for oriented links.
method Defined using a canonical two-element tribracket, proving polynomials can be derived from five specific ones.
result Universal quantum enhancement polynomials are strictly stronger than the Jones polynomial.
We classify rooted trees which have strictly unimodal q-polynomials (plucking polynomial). We also give criteria for a trapezoidal shape of a plucking polynomial. We generalize results of Pak and Panova on strict unimodality of q-binomial coefficients. We discuss which polynomials can be realized as plucking polynomial…
New polynomials detect non-rotatable knotoid shapes.
problem Detecting non-rotatable knotoid shapes.
method Defined homotopy index polynomials for knotoids.
result Homotopy polynomials detect non-rotatable spherical knotoids.
Innovates polynomial invariant for tribrackets.
problem Counting and distinguishing knots and links.
method Introduces subtribracket polynomials and uses them to enhance counting.
result Enhanced counting invariant for knots and links.
Researchers extend Alexander polynomial to knotoids and linkoids.
problem Defining and studying Alexander polynomial extensions for knotoids and linkoids.
method Developed and proved conjecture on mock Alexander polynomial for knotoids and linkoids.
result Proved conjecture on mock Alexander polynomial for knotoids and linkoids.
Unified ADO and colored Jones polynomials for knots.
problem Determining ADO polynomials from colored Jones polynomials.
method Constructing a two-variable knot invariant using completions of rings and algebra.
result Unified invariant maps colored Jones polynomials to ADO polynomials.