相关论文: Chromatic Polynomial, Colered Jones Function and q…
Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…
In this work, we give a formula for the logarithmic invariant of knots in terms of certain derivatives of the colored Jones invariant. This invariant is related to the logarithmic conformal field theory, and was defined by using the centers…
We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar…
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney's broken cycle theorem for hypergraphs, as well as deriving an…
This paper discusses ways to categorify chromatic, dichromatic and Penrose polynomials, including categorifications of integer evaluations of chromatic polynomials. We show that with an appropriate choice of variables the coefficients of…
We introduce the concepts of marked multi-colorings, marked chromatic polynomials, and marked (multivariate) independence series for hypergraphs. We show that the coefficients of the q-th power of the marked independence series of a…
We define several new types of quantum chromatic numbers of a graph and characterise them in terms of operator system tensor products. We establish inequalities between these chromatic numbers and other parameters of graphs studied in the…
This article gives the foundations of the colored Jones polynomial for singular knots. We extend Masbum and Vogel's algorithm to compute the colored Jones polynomial for any singular knot. We also introduce the tail of the colored Jones…
For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known…
We formulate a conjecture (already proven by A. Kricker) about the structure of Kontsevich integral of a knot. We describe its value in terms of the generating functions for the numbers of external edges attached to closed 3-valent…
In this note we classify when a skew Schur function is a positive linear combination of power sum symmetric functions. We then use this to determine precisely when any scalar multiple of a skew Schur function is the chromatic symmetric…
We express the colored Jones polynomial as the inverse of the quantum determinant of a matrix with entries in the $q$-Weyl algebra of $q$-operators, evaluated at the trivial function (plus simple substitutions). The Kashaev invariant is…
Steingrimsson (2001) showed that the chromatic polynomial of a graph is the Hilbert function of a relative Stanley-Reisner ideal. We approach this result from the point of view of Ehrhart theory and give a sufficient criterion for when the…
In this paper, we introduce and study two variants of the chromatic quasisymmetric function of a graph: the total chromatic quasisymmetric function via vertex labeling and via acyclic orientations. The original definition of the chromatic…
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of `knot invariants', among…
The $A$-polynomial is conjectured to be obtained from the potential function of the colored Jones polynomial by elimination. The AJ conjecture also implies the relationship between the $A$-polynomial and the colored Jones polynomial. In…
We consider the potential function of the colored Jones polynomial for a link with arbitrary colors and obtain the cone-manifold structure for the link complement. In addition, we establish a relationship between a saddle point equation and…
We express the integral form Macdonald polynomials as a weighted sum of Shareshian and Wachs' chromatic quasisymmetric functions of certain graphs. Then we use known expansions of these chromatic quasisymmetric functions into Schur and…
This paper describes an improvement in the upper bound for the magnitude of a coefficient of a term in the chromatic polynomial of a general graph. If $a_r$ is the coefficient of the $q^r$ term in the chromatic polynomial $P(G,q)$, where…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…