相关论文: Chromatic Polynomial, Colered Jones Function and q…
We define an operation of jets on graphs inspired by the corresponding notion in commutative algebra and algebraic geometry. We examine a few graph theoretic properties and invariants of this construction, including chromatic numbers,…
We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…
The colored Jones polynomial of links has two natural normalizations: one in which the n-colored unknot evaluates to [n+1], the quantum dimension of the (n+1)-dimensional irreducible representation of quantum sl(2), and the other in which…
We introduce the notion of colorful minors, which generalizes the classical concept of rooted minors in graphs. A $q$-colorful graph is defined as a pair $(G, \chi),$ where $G$ is a graph and $\chi$ assigns to each vertex a (possibly empty)…
Let $P(G,q)$ be the chromatic polynomial for coloring the $n$-vertex graph $G$ with $q$ colors, and define $W=\lim_{n \to \infty}P(G,q)^{1/n}$. Besides their mathematical interest, these functions are important in statistical physics. We…
It is a challenging problem to construct an efficient quantum algorithm which can compute the Jones' polynomial for any knot or link obtained from platting or capping of a $2n$-strand braid. We recapitulate the construction of braid-group…
Plethysm is a fundamental operation in symmetric function theory, derived directly from its connection with representation theory. However, it does not admit a simple combinatorial interpretation, and finding coefficients of Schur function…
We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…
The notion of chckerboard colorability for virtual links and abstract links is introduced. We study the Jones polynomials of virtual links and abstruct links. It is proved that a certain property of the Jones polynomials of classical links…
Stanley introduced the chromatic symmetric function of a simple graph, which is a generalization of a chromatic polynomial. This is expressed in terms of the integer points of the complements of the corresponding graphic arrangement.…
Quandle Coloring Quivers are directed graph-valued invariants of classical and virtual knots and links associated to finite quandles. Quandle action quivers are subquivers of the full quandle coloring quiver associated to quandle actions by…
Let $\mathcal{C}$ be a proper minor-closed class of graphs. Given the minors excluded in $\mathcal{C}$, we determine the maximum $q$-centered chromatic number and the maximum $q$th weak coloring number of graphs in $\mathcal{C}$ within an…
We derive a functional relation between the generating functions of connected chord diagrams and 2-connected chord diagrams. This relation enables us to calculate an asymptotic expansion for the number of 2-connected chord diagrams on $n$…
In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the…
Richard Stanley defined the chromatic symmetric function $X_G$ of a graph $G$ and asked whether there are non-isomorphic trees $T$ and $U$ with $X_T=X_U$. We study variants of the chromatic symmetric function for rooted graphs, where we…
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a…
A simple geometric way is suggested to derive the Ward identities in the Chern-Simons theory, also known as quantum $A$- and $C$-polynomials for knots. In quasi-classical limit it is closely related to the well publicized augmentation…
In 1995, Stanley introduced the chromatic symmetric function of a graph, which specializes to its chromatic polynomial, and which has been the focus of intense research. In 2017, Shareshian, Wachs, and Ellzey defined a refinement of this…
We prove that the coefficients of the colored Jones polynomial of alternating links stabilize under increasing the number of twists in the twist regions of the link diagram. This gives us an infinite family of $q$-power series derived from…
I show various calculations of the limit of the colored Jones function for the figure-eight knot and confirm R. Kashaev's conjecture in this case.