Related papers: Polynomial graph invariants and the KP hierarchy

Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane…

As introduced by Gutman and Harary, the independence polynomial of a graph serves as the generating polynomial of its independent sets. In 1987, Alavi, Malde, Schwenk and Erd\H{o}s conjectured that the independence polynomials of all trees…

We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…

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…

We present a mathematical proof of the Aganagic-Dijkgraaf-Klemm-Mari\~no-Vafa Conjecture proposed in 2006, which states that the generating function of the topological vertex, i.e., the generating function of the open Gromov-Witten…

For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…

In this paper, we present some properties on chromatic polynomials of hypergraphs which do not hold for chromatic polynomials of graphs. We first show that chromatic polynomials of hypergraphs have all integers as their zeros and contain…

We review the integration of the KP hierarchy in several non-standard contexts. Specifically, we consider KP in the following associative differential algebras: an algebra equipped with a nilpotent derivation; an algebra of functions…

Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…

The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this…

In this paper, we introduce the concept of the weighted (harmonic) chromatic polynomials of graphs and discuss some of its properties. We also present the notion of the weighted (harmonic) Tutte--Grothendieck polynomials of graphs and give…

Link/knot invariants are series with integer coefficients, and it is a long-standing problem to get them positive and possessing cohomological interpretation. Constructing positive "superpolynomials" is not straightforward, especially for…

For a hypergraphic polytope there is a weighted quasisymmetric function which enumerates positive integer points in its normal fan and determines its f-polynomial. This quasisymmetric function invariant of hypergraphs extends the Stanley…

We introduce a superspace analogue of combinatorial Hopf algebras (Aguiar-Bergeron-Sottile, 2006), and show that the Hopf superalgebra of quasi-symmetric (resp. symmetric) functions in superspace (Fishel-Lapointe-Pinto, 2019) is a terminal…

We introduce graph potentials, which are Laurent polynomials associated to (colored) trivalent graphs. We show that the birational type of the graph potential only depends on the homotopy type of the colored graph, and use this to define a…

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…

The goal of this note is to study integrable properties of a generating function of the HOMFLY-PT invariants of the Hopf link colored with different representations. We demonstrate that such a generating function is a $\tau$-function of the…

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 introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…

We study the chromatic symmetric function on graphs, and show that its kernel is spanned by the modular relations. We generalize this result to the chromatic quasisymmetric function on hypergraphic polytopes, a family of generalized…