Related papers: Enumerating Colorings, Tensions and Flows in Cell …
Building on recently established enumerative connections between lambda calculus and the theory of embedded graphs (or "maps"), this paper develops an analogy between typing (of lambda terms) and coloring (of maps). Our starting point is…
The colored HOMFLY polynomials, which describe Wilson loop averages in Chern-Simons theory, possess an especially simple representation for torus knots, which begins from quantum R-matrix and ends up with a trivially-looking split W…
This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…
We study the connections between link invariants, the chromatic polynomial, geometric representations of models of statistical mechanics, and their common underlying algebraic structure. We establish a relation between several algebras and…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
We inductively define layers of colorings of knot and knotted surface diagrams using ternary quasigroups. Homological invariants from such systems of colorings use shorter differentials and of higher degree than the standard homology…
This work brings together ideas of mixing graph colourings, discrete homotopy, and precolouring extension. A particular focus is circular colourings. We prove that all the $(k,q)$-colourings of a graph $G$ can be obtained by successively…
We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We…
Around 10 years ago, Agol and Krushkal showed that the number of chromatic polynomials $P_{G}$ arising from graphs $G$ on $n$ vertices grows exponentially with $n$, by establishing that the (dual) flow polynomial…
Consider a finite field $\mathbb F_q$, $q=p^d$, where $p$ is an odd number. Let $M=(E,r)$ be a regular matroid; denote by ${\mathcal B}$ the family of its bases, $\bar s(M;\alpha)=\sum_{B\in {\mathcal B}}\prod_{e\not\in B} \alpha_e$, where…
We propose a conjectural counting formula for the coefficients of the chromatic symmetric function of unit interval graphs using reinforcement learning. The formula counts specific disjoint cycle-tuples in the graphs, referred to as…
We use a Dyck path model for unit-interval graphs to study the chromatic quasisymmetric functions introduced by Shareshian and Wachs, as well as vertical strip --- in particular, unicellular LLT polynomials. We show that there are parallel…
A full selfconsistent set of equations is deduced to describe the kinetics and dynamics of charged quasiparticles (electrons, holes etc.) with arbitrary dispersion law in crystalline solids subjected to time-varying deformations. The set…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
There are many extremely challenging problems about existence of monochromatic arithmetic progressions in colorings of groups. Many theorems hold only for abelian groups as results on non-abelian groups are often much more difficult to…
In geometric, algebraic, and topological combinatorics, the unimodality of combinatorial generating polynomials is frequently studied. Unimodality follows when the polynomial is (real) stable, a property often deduced via the theory of…
We consider the Potts model in a magnetic field on an arbitrary graph $G$. Using a formula of F. Y. Wu for the partition function $Z$ of this model as a sum over spanning subgraphs of $G$, we prove some properties of $Z$ concerning…
Averbouch, Godlin and Makowsky define the edge elimination polynomial of a graph by a recurrence relation with respect to the deletion, contraction and extraction of an edge. It generalizes some well-known graph polynomials such as the…
For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…
K\H{o}nig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem for general graphs are celebrated results in graph theory and combinatorial optimization. Schrijver generalized K\H{o}nig's theorem to a framework…