相关论文: The colored Jones function is q-holonomic

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

Quantum invariants like the colored Jones polynomial are algebraic in nature but are conjectured to detect important information about the geometry of links. In this thesis we explore these connections using an enhanced version of the RT…

We give a recursion for the multivariate Rogers-Szeg\"o polynomials, along with another recursive functional equation, and apply them to compute special values. We also consider the sum of all $q$-multinomial coefficients of some fixed…

We introduce $H$-chromatic symmetric functions, $X_{G}^{H}$, which use the $H$-coloring of a graph $G$ to define a generalization of Stanley's chromatic symmetric functions. We say two graphs $G_1$ and $G_2$ are $H$-chromatically equivalent…

The AJ Conjecture relates a quantum invariant, a minimal order recursion for the colored Jones polynomial of a knot (known as the $\hat{A}$ polynomial), with a classical invariant, namely the defining polynomial $A$ of the $\psl$ character…

Coloured Jones and Alexander polynomials are sequences of quantum invariants recovering the Jones and Alexander polynomials at the first terms. We show that they can be seen conceptually in the same manner, using topological tools, as…

The q-state Potts model can be defined on an arbitrary finite graph, and its partition function encodes much important information about that graph, including its chromatic polynomial, flow polynomial and reliability polynomial. The complex…

We study the chromatic quasisymmetric class function of a linearized combinatorial Hopf monoid. Given a linearized combinatorial Hopf monoid $H$, and an $H$-structure $h$ on a set $N$, there are proper colorings of $h$, generalizing graph…

We propose a conjecture to compute the all-order asymptotic expansion of the colored Jones polynomial of the complement of a hyperbolic knot, J_N(q = exp(2u/N)) when N goes to infinity. Our conjecture claims that the asymptotic expansion of…

We offer a new proof that a certain q-analogue of multinomial coeffi- cients furnishes a q-counting of the set of permutations of an associated multiset of positive integers, according to the number of inversions in such arrangements. Our…

We introduce colored Jones polynomials of nanowords and their categorification. We also prove the existence of a Khovanov-type bicomplex which has three grades.

Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…

We reveal a relationship between the colored Jones polynomial and the A-polynomial for twist knots. We demonstrate that an asymptotics of the $N$-colored Jones polynomial in large $N$ gives the potential function, and that the A-polynomial…

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…

For the potential function of a link diagram induced by the optimistic limit of the colored Jones polynomial, we show the existence of a solution of the hyperbolicity equations by directly constructing it. This construction is based on the…

We study the behavior of the degree of the colored Jones polynomial and the boundary slopes of knots under the operation of cabling. We show that, under certain hypothesis on this degree, if a knot $K$ satisfies the Slope Conjecture then a…

Using the definition of colouring of $2$-edge-coloured graphs derived from $2$-edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to $2$-edge-coloured graphs. We find closed forms for the first three…

The Stanley chromatic symmetric function $X_G$ of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology…

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…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…