Related papers: A New Polynomial for Checkerboard-Colorable 4-Vale…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
We study "holomorphic quadratic differentials" on graphs. We relate them to the reactive power in an LC circuit, and also to the chromatic polynomial of a graph. Specifically, we show that the chromatic polynomial $\chi$ of a graph $G$, at…
We construct a 2-variable link polynomial, called $W_L$, for classical links by considering simultaneously the Kauffman state models for the Alexander and for the Jones polynomials. We conjecture that this polynomial is the product of two…
A group invariant for links in thickened closed orientable surfaces is studied. Associated polynomial invariants are defined. The group detects nontriviality of a virtual link and determines its virtual genus.
We define new notions of groups of virtual and welded knots (or links) and we study their relations with other invariants, in particular the Kauffman group of a virtual knot.
We introduce colored Jones polynomials of nanowords and their categorification. We also prove the existence of a Khovanov-type bicomplex which has three grades.
This paper describes how many known graph polynomials arise from the coefficients of chromatic symmetric function expansions in different bases, and studies a new polynomial arising by expanding over a basis given by chromatic symmetric…
We extend the definition of the colored Jones polynomials to framed links and trivalent graphs in S^3 # k S^2 X S^1 using a state-sum formulation based on Turaev's shadows. Then, we prove that the natural extension of the Volume Conjecture…
We show that given an arbitrary set of four plane unit vectors $v_1, v_2, v_3, v_4$, the Cayley graph generated by $\{\pm v_1, \pm v_2, \pm v_3, \pm v_4\}$ is always $3$-colorable. Indeed, we show that this is a specific case of a much more…
We construct a quantum algorithm to approximate efficiently the colored Jones polynomial of the plat presentation of any oriented link L at a fixed root of unity q. Our construction is based on SU(2) Chern-Simons topological quantum field…
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…
We enhance the pointed quandle counting invariant of linkoids through the use of quivers analogously to quandle coloring quivers. This allows us to generalize the in-degree polynomial invariant of links to linkoids. Additionally, we…
The Jones polynomial and Khovanov homology of a classical link are invariants that depend upon an initial choice of orientation for the link. In this paper, we give a Khovanov homology theory for unoriented virtual links. The graded Euler…
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…
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-colorable, hamiltonian, etc.) if and only if a related system…
The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
Hexagon relations are algebraic realizations of four-dimensional Pachner moves. `Constant' -- not depending on a 4-simplex in a triangulation of a 4-manifold -- hexagon relations are proposed, and their polynomial-valued cohomology is…
In this article we describe a new inductive approach to compute the chromatic polynomial of simple graphs and the characteristic polynomial of central hyperplane arrangements.
Quantum knot invariants (like colored HOMFLY-PT or Kauffman polynomials) are a distinguished class of non-perturbative topological invariants. Any known way to construct them (via Chern-Simons theory or quantum R-matrix) starts with a…