Related papers: Viewing counting polynomials as Hilbert functions …

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

We discover new linear relations between the chromatic symmetric functions of certain sequences of graphs and apply these relations to find new families of e-positive unit interval graphs. Motivated by the results of Gebhard and Sagan, we…

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…

Given a function from $\mathbb{Z}_n$ to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over $\mathbb{Z}_n$ by constructing…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…

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…

We prove a general inclusion-exclusion relation for the extended chromatic symmetric function of a weighted graph, which specializes to (extended) $k$-deletion, and we give two methods to obtain numerous new bases from weighted graphs for…

Riemannian Geometry, Topology and Dynamics permit to introduce partially defined holomorphic functions on the variety of representations of the fundamental group of a manifold. The functions we consider are the complex valued Ray-Singer…

The Hilbert function, its generating function and the Hilbert polynomial of a graded ring R have been extensively studied since the famous paper of Hilbert: Ueber die Theorie der algebraischen Formen [Hil90]. In particular, the coefficients…

In a recent paper, Cristofaro-Gardiner--Li--Stanley [CGLS15] constructed examples of irrational triangles whose Ehrhart functions (i.e. lattice-point count) are polynomials when restricted to positive integer dilation factors. This is very…

We consider a formula of Stanley that expresses the Ehrhart generating polynomial of a polyhedral complex in terms of the h-polynomials of toric varieties. We prove that the coefficients in this expression are all non-negative and show that…

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

The q-state Potts model can be defined on an arbitrary finite graph, and its partition function encodes much important information about that graph, including its chromatic polynomial, flow polynomial and reliability polynomial. The complex…

We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edges, which generalize the notions of colorings and flows over a graph. We show that the corresponding arithmetic chromatic polynomial and…

In earlier work we studied features of non-holomorphic modular functions associated with Feynman graphs for a conformal scalar field theory on a two-dimensional torus with zero external momenta at all vertices. Such functions, which we will…

We discuss Hilbert-Kunz function from when it was originally defined to its recent developments. A brief history of Hilbert-Kunz theory is first recounted. Then we review several techniques involved in the study of Hilbert-Kunz functions by…

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…

Let $A = K[x_1, ..., x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\deg x_i = 1$. Let $I$ be a homogeneous ideal of $A$ with $I \ne A$ and $H_{A/I}$ the Hilbert function of the quotient algebra $A / I$. Given…

Stanley [9] introduced the chromatic symmetric function ${\bf X}_G$ associated to a simple graph $G$ as a generalization of the chromatic polynomial of $G$. In this paper we present a novel technique to write ${\bf X}_G$ as a linear…