Related papers: Kauffman bracket polynomials, perfect matchings an…
Quantum enhancement polynomials are invariants for oriented links, defined in association with an algebraic structure called a tribracket. In this paper, we focus on the particular case of the canonical two-element tribracket. We prove…
By now it is well established that the quantum dimensions of descendants of the adjoint representation can be described in a universal form, independent of a particular family of simple Lie algebras. The Rosso-Jones formula then implies a…
We propose a method to compute complex volume of 2-bridge link complements. Our construction sheds light on a relationship between cluster variables with coefficients and canonical decompositions of link complements.
Knots naturally appear in continuous dynamical systems as flow periodic trajectories. However, discrete dynamical systems are also closely connected with the theory of knots and links. For example, for Pixton diffeomorphisms, the…
This article is devoted to the computation of Jack connection coefficients, a generalization of the connection coefficients of two classical commutative subalgebras of the group algebra of the symmetric group: the class algebra and the…
Let $R$ and $B$ be two disjoint sets of points in the plane such that $|B|\leqslant |R|$, and no three points of $R\cup B$ are collinear. We show that the geometric complete bipartite graph $K(R,B)$ contains a non-crossing spanning tree…
Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to…
We establish a relation between the Bollobas-Riordan polynomial of a ribbon graph with the relative Tutte polynomial of a plane graph obtained from the ribbon graph using its projection to the plane in a nontrivial way. Also we give a…
In this work we present a coupled-cluster theory for the propagation of multireference electronic systems initiating at general quantum mechanical states. Our formalism is based on the infinitesimal analysis of modified cluster operators,…
For cluster algebras from surfaces, there is a known formula for cluster variables and F-polynomials in terms of the perfect matchings of snake graphs. If the cluster algebra has trivial coefficients, there is also a known formula for…
In this article we extend evaluations of the Kauffman bracket on regular isotopy classes of knots and links to a variety of functors defined on the category of framed tangles. We show that many such functors exist, and that they correspond…
Diagrams and Reidemeister moves for links in a twisted S^1-bundle over an unorientable surface are introduced. Using these diagrams, we compute the Kauffman Bracket Skein Module (KBSM) of the connected sum of two projective spaces. In…
This note presents several results in graph theory inspired by the author's work in the proof theory of linear logic; these results are purely combinatorial and do not involve logic. We show that trails avoiding forbidden transitions,…
For a Morse function f on a compact oriented manifold M, we show that f has more critical points than the number required by the Morse inequalities if and only if there exists a certain class of link in M whose components have nontrivial…
The paper introduces Slope Conjecture which relates the degree of the Jones polynomial of a knot and its parallels with the slopes of incompressible surfaces in the knot complement. More precisely, we introduce two knot invariants, the…
Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…
We consider hyperbolic links that admit alternating projections on surfaces in compact, irreducible 3-manifolds. We show that, under some mild hypotheses, the volume of the complement of such a link is bounded below in terms of a Kauffman…
We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…
The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph. We propose a very short proof of this result which amounts to comparing Taylor…
This is an introductory survey on cluster algebras and their (additive) categorification using derived categories of Ginzburg algebras. After a gentle introduction to cluster combinatorics, we review important examples of coordinate rings…