相关论文: Chromatic Polynomial, Colered Jones Function and q…
A new algorithm to obtain the chromatic number of a finite, connected graph is proposed in this paper. The algorithm is based on contraction of non adjacent vertices.
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…
Let $\mathfrak g$ be a Borcherds algebra with the associated graph $G$. We prove that the chromatic symmetric function of $G$ can be recovered from the Weyl denominator identity of $\mathfrak g$ and this gives a Lie theoretic proof of…
The chromatic symmetric function $X_G$ of a graph $G$ was introduced by Stanley. In this paper we introduce a quasisymmetric generalization $X^k_G$ called the $k$-chromatic quasisymmetric function of $G$ and show that it is positive in the…
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
DP-coloring (also called correspondence coloring) is a generalization of list coloring that was introduced by Dvo\v{r}\'{a}k and Postle in 2015. The chromatic polynomial of a graph is an important notion in algebraic combinatorics that was…
Richard P. Stanley defined the chromatic symmetric function of a simple graph and has conjectured that every tree is determined by its chromatic symmetric function. Recently, Takahiro Hasebe and the author proved that the order…
We introduce a new approach to universal quantum knot invariants that emphasizes generating functions instead of generators and relations. All the relevant generating functions are shown to be perturbed Gaussians of the form $Pe^G$, where…
We survey some uses of adjoint functors in graph theory pertaining to colourings, complexity reductions, multiplicativity, circular colourings and tree duality. The exposition of these applications through adjoint functors unifies the…
A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…
By means of color chord diagrams we establish a necessary and sufficient condition for $O$-topological equivalence of functions with one essentially critical point on oriented surfaces with edge. We also calculate the number of…
The absolute value of the coefficient of $q$ in the chromatic polynomial of a graph $G$ is known as the chromatic discriminant of $G$ and is denoted $\alpha(G)$. There is a well known recurrence formula for $\alpha(G)$ that comes from the…
q-Supernomial coefficients are generalizations of the q-binomial coefficients. They can be defined as the coefficients of the Hall-Littlewood symmetric function in a product of the complete symmetric functions or the elementary symmetric…
We calculate limits of the colored Jones polynomials of the figure-eight knot and conclude that in most cases they determine the volumes and the Chern--Simons invariants of the three-manifolds obtained by Dehn surgeries along it.
In this paper, we extend the chromatic symmetric function $X$ to a chromatic $k$-multisymmetric function $X_k$, defined for graphs equipped with a partition of their vertex set into $k$ parts. We demonstrate that this new function retains…
The amplitudes of refined Chern-Simons (CS) theory, colored by antisymmetric (or symmetric) representations, conjecturally generate the Lambda^r- (or S^r-) colored triply graded homology of (n,m) torus knots. This paper is devoted to the…
The Stanley-Stembridge conjecture asserts that the chromatic symmetric function of a $(3+1)$-free graph is $e$-positive. Recently, Hikita proved this conjecture by giving an explicit $e$-expansion of the Shareshian-Wachs $q$-chromatic…
Classical A-polynomials $A(\ell,m)$ define constraints on coordinates $\ell$ and $m$ in $SL(2,\mathbb{C})$ (a complexification of $SU(2)$) character varieties associated to knot complements $S^3\setminus K$. Quantum A-polynomials $\hat…
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…
A well-known result of Alon shows that the coloring number of a graph is bounded by a function of its choosability. We explore this relationship in a more general setting with relaxed assumptions on color classes, encoded by a graph…