We introduce the concept of a relative Tutte polynomial of colored graphs. We show that this relative Tutte polynomial can be computed in a way similar to the classical spanning tree expansion used by Tutte in his original paper on this subject. We then apply the relative Tutte polynomial to virtual knot theory. More specifically, we show that the Kauffman bracket polynomial (hence the Jones polynomial) of a virtual knot can be computed from the relative Tutte polynomial of its face (Tait) graph with some suitable variable substitutions. Our method offers an alternative to the ribbon graph approach, using the face graph obtained from the virtual link diagram directly.
The Bollobás-Riordan polynomial [Math. Ann. 323, 81 (2002)] is a universal polynomial invariant for ribbon graphs. We find an extension of this polynomial for a particular family of combinatorial objects, called rank 3 weakly-colored stranded graphs. Stranded graphs arise in the study of tensor models for quantum gravity in physics, and generalize graphs and ribbon graphs. We present a seven-variable polynomial invariant of these graphs, which obeys a contraction/deletion recursion relation similar to that of the Tutte and Bollobás-Riordan polynomials. However, it is defined on a much broader …
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recursively by deleting and contracting edges. We generalize this invariant to any class of combinatorial objects with deletion and contraction operations, associating to each such class a universal Tutte character by a functorial procedure. We show that these invariants satisfy a universal property and convolution formulae similar to the Tutte polynomial. With this machinery we recover classical invariants for delta-matroids, matroid perspectives, relative and colored matroids, generalized permutohe…
Let $G$ be a connected general graph. Let $f\colon V(G)\to \Z^+$ be a function. We show that $G$ satisfies the Tutte-type condition \[ o(G-S)\le f(S)\qquad\text{for all vertex subsets $S$}, \] if and only if it contains a colored $J_f^*$-factor for any $2$-end-coloring, where $J_f^*(v)$ is the union of all odd integers smaller than $f(v)$ and the integer $f(v)$ itself. This is a generalization of the $(1,f)$-odd factor characterization theorem, and answers a problem of Cui and Kano. We also derive an analogous characterization for graphs of odd orders, which addresses a problem of Akiyama and …
The tail of the colored Jones polynomial of an alternating link is a $q$-series invariant whose first $n$ terms coincide with the first $n$ terms of the $n$-th colored Jones polynomial. Recently, it has been shown that the tail of the colored Jones polynomial of torus knots give rise to Ramanujan type identities. In this paper, we study $q$-series identities coming from the colored Jones polynomial of pretzel knots. We prove a false theta function identity that goes back to Ramanujan and we give a natural generalization of this identity using the tail of the colored Jones polynomial of Pretzel…
Let $K_{(m,p)}$ denote the family of double twist knots where $2m-1$ and $2p$ are non-zero integers denoting the number of half-twists in each region. Using a result of Takata, we prove a formula for the colored Jones polynomial of $K_{(-m,-p)}$ and $K_{(-m,p)}$. The latter case leads to new families of $q$-hypergeometric series generalizing the Kontsevich-Zagier series. We also use Bailey pairs and formulas of Walsh to find cyclotomic-like expansions for the colored Jones polynomials of $K_{(m,p)}$ and $K_{(m,-p)}$.
Polynomials on stranded graphs are higher dimensional generalization of Tutte and Bollobás-Riordan polynomials [Math. Ann. 323 (2002), 81-96]. Here, we deepen the analysis of the polynomial invariant defined on rank 3 weakly-colored stranded graphs introduced in arXiv:1301.1987. We successfully find in dimension $D\geq3$ a modified Euler characteristic with $D-2$ parameters. Using this modified invariant, we extend the rank 3 weakly-colored graph polynomial, and its main properties, on rank 4 and then on arbitrary rank $D$ weakly-colored stranded graphs.
Originally in 1954 the Tutte polynomial was a bivariate polynomial associated to a graph in order to enumerate the colorings of this graph and of its dual graph at the same time. However the Tutte polynomial reveals more of the internal structure of a graph, and contains even other specializations from other sciences like the Jones polynomial in Knot theory, the partition function of the Pott model in statistical physics, and the reliability polynomial in network theory. In this article, we study the Tutte polynomial associated to more general objects which are the arrangements of hyperplanes.…
We rewrite the (extended) Ooguri-Vafa partition function for colored HOMFLY-PT polynomials for torus knots in terms of the free-fermion (semi-infinite wedge) formalism, making it very similar to the generating function for double Hurwitz numbers. This allows us to conjecture the combinatorial meaning of full expansion of the correlation differentials obtained via the topological recursion on the Brini-Eynard-Mariño spectral curve for the colored HOMFLY-PT polynomials of torus knots. This correspondence suggests a structural combinatorial result for the extended Ooguri-Vafa partition function. …
We prove that topological recursion applied to the spectral curve of colored HOMFLY-PT polynomials of torus knots reproduces the n-point functions of a particular partition function called the extended Ooguri-Vafa partition function. This generalizes and refines the results of Brini-Eynard-Marino and Borot-Eynard-Orantin. We also discuss how the statement of spectral curve topological recursion in this case fits into the program of Alexandrov-Chapuy-Eynard-Harnad of establishing the topological recursion for general weighted double Hurwitz numbers partition functions (a.k.a. KP tau-functions o…
We extend the table of Garoufalidis, Le and Zagier concerning conjectural Rogers-Ramanujan type identities for tails of colored Jones polynomials to all alternating knots up to 10 crossings. We then prove these new identities using q-series techniques.
