English
Related papers

Related papers: Kauffman bracket polynomials, perfect matchings an…

200 papers

Given a knot complement X and its p-fold cyclic cover X_p, we identify twisted polynomials associated to 1-dimensional linear representations of the fundamental group of X_p with twisted polynomials associated to related p-dimensional…

Geometric Topology · Mathematics 2013-09-30 Chris Herald , Paul Kirk , Charles Livingston

We extend recent work by Howie, Mathews and Purcell to simplify the calculation of A-polynomials for any family of hyperbolic knots related by twisting. The main result follows from the observation that equations defining the deformation…

Geometric Topology · Mathematics 2023-08-22 Em K. Thompson

We design exact polynomial expansions of a class of Feynman--Kac particle distributions. These expansions are finite and are parametrized by coalescent trees and other related combinatorial quantities. The accuracy of the expansions at any…

Probability · Mathematics 2009-06-24 Pierre Del Moral , Frédéric Patras , Sylvain Rubenthaler

We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…

Data Structures and Algorithms · Computer Science 2024-07-12 Kristóf Bérczi , Tamás Király , Yusuke Kobayashi , Yutaro Yamaguchi , Yu Yokoi

J. S. Wilson proved in 1971 an isomorphism between the structural lattice associated to a group belonging to his second class of groups with every proper quotient finite and the Boolean algebra of clopen subsets of Cantor's ternary set. In…

Group Theory · Mathematics 2026-01-29 Jorge Fariña-Asategui , Rostislav Grigorchuk

To a plane algebraic curve of degree n, Moishezon associated a braid monodromy homomorphism from a finitely generated free group to Artin's braid group B_n. Using Hansen's polynomial covering space theory, we give a new interpretation of…

alg-geom · Mathematics 2008-02-03 Daniel C. Cohen , Alexander I. Suciu

Eisermann has shown that the Jones polynomial of a $n$-component ribbon link $L\subset S^3$ is divided by the Jones polynomial of the trivial $n$-component link. We improve this theorem by extending its range of application from links in…

Geometric Topology · Mathematics 2015-03-20 Alessio Carrega , Bruno Martelli

We use recoupling theory to study the Kauffman bracket skein module of the quaternionic manifold over Z[A,A^{-1}] localized by inverting all the cyclotomic polynomials. We prove that the skein module is spanned by five elements. Using the…

Geometric Topology · Mathematics 2015-12-22 Patrick M. Gilmer , John M. Harris

The pioneering work of Jones and Kauffman unveiled a fruitful relationship between statistical mechanics and knot theory. Recently, Jones introduced two subgroups $\vec{F}$ and $\vec{T}$ of the Thompson groups $F$ and $T$, respectively,…

Group Theory · Mathematics 2018-11-05 Valeriano Aiello , Roberto Conti

We classify the Montesinos links up to mutation and 5-move equivalence, and obtain from this a Jones and Kauffman polynomial test for a Montesinos link.

Geometric Topology · Mathematics 2008-08-30 A. Stoimenow

We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs with a given bipartite degree sequence. For tree degree sequences, we obtain closed formulas for the possible…

Combinatorics · Mathematics 2018-08-30 F. Bock , D. Rautenbach

For arborescent links, we present an efficient method of computing their Alexander polynomials. Applying this method, we express the Alexander polynomials of Montesinos links in terms of certain functions associated to rational tangles…

Geometric Topology · Mathematics 2026-04-02 Haimiao Chen

We establish a combinatorial realization of continued fractions as quotients of cardinalities of sets. These sets are sets of perfect matchings of certain graphs, the snake graphs, that appear naturally in the theory of cluster algebras. To…

Combinatorics · Mathematics 2019-02-20 Ilke Canakci , Ralf Schiffler

Motivated by a conjecture of Gy\'arf\'as, recently B\"ottcher, Hladk\'y, Piguet, and Taraz showed that every collection $T_1,\dots,T_t$ of trees on $n$ vertices with $\sum_{i=1}^te(T_i)\leq \binom{n}{2}$ and with bounded maximum degree, can…

Combinatorics · Mathematics 2016-04-20 Silvia Messuti , Vojtěch Rödl , Mathias Schacht

Stokes' manifolds, also known as wild character varieties, carry a natural symplectic structure. Our goal is to provide explicit log-canonical coordinates for these natural Poisson structures on the Stokes' manifolds of polynomial…

Symplectic Geometry · Mathematics 2022-02-02 Marco Bertola , Sofia Tarricone

In this paper, we apply Kauffman bracket skein algebras to develop a theory of skein adequate links in thickened surfaces. We show that any alternating link diagram on a surface is skein adequate. We apply our theory to establish the first…

Geometric Topology · Mathematics 2023-08-02 Hans U. Boden , Homayun Karimi , Adam S. Sikora

A formula for factorizations of the full twist in the braid group $Br_{2m}$ depending on any four factorizations of the full twist in $Br_{m}$ is given. Applying this formula, a symplectic 4-manifold $X$ and two isotopic generic coverings…

Algebraic Geometry · Mathematics 2007-05-23 Vik. S. Kulikov

Theory of motivic superpolynomials is developed, including its extension to algebraic links colored by rows, relations to $L$-functions of plane curve singularities, the justification of the motivic versions of Weak Riemann Hypothesis, and…

Quantum Algebra · Mathematics 2025-08-26 Ivan Cherednik

We investigate an application of crossing parity for the bracket expansion of the Jones polynomial for virtual knots. In addition we consider an application of parity for the arrow polynomial as well as for the categorifications of both…

Geometric Topology · Mathematics 2011-10-25 Aaron Kaestner , Louis H. Kauffman

We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain…

Data Structures and Algorithms · Computer Science 2021-03-17 Farzam Ebrahimnejad , Ansh Nagda , Shayan Oveis Gharan