Related papers: Chromatic polynomial and the $\mathfrak{so}$ weigh…
Let ${\cal L}$ be a variation of Hodge structures on the complement $X^{*}$ of a normal crossing divisor (NCD) $ Y$ in a smooth analytic variety $X$ and let $ j: X^{*} = X - Y \to X $ denotes the open embedding. The purpose of this paper is…
Multivariate extensions of the Krawtchouk polynomials have been studied by numerous authors in recent decades by exploring new connections to probability, representation theory and quantum integrability. We develop a theory of multivariate…
In an earlier paper, the present authors (2013) introduced the altermatic number of graphs and used Tucker's Lemma, an equivalent combinatorial version of the Borsuk-Ulam Theorem, to show that the altermatic number is a lower bound for the…
A common generalization for the chromatic polynomial and the flow polynomial of a graph $G$ is the Tutte polynomial $T(G;x,y)$. The combinatorial meaning for the coefficients of $T$ was discovered by Tutte at the beginning of its…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
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…
In the paper, we search for monochromatic infinite additive structures involving polynomials over $\mathbb{N}$. It is proved that for any $r\in \mathbb{N}$, any two distinct natural numbers $a,b$, and any $2$-coloring of $\mathbb{N}$, there…
We study binomially weighted summation methods given by \[ (x_n)_{n\in \mathbb{N}} \mapsto \left(\sum_{k=0}^n\binom{n}{k}r^k(1-r)^{n-k}x_k\right)_{n\in \mathbb{N}} \] for $r\in (0,1)$, and their behavior under composition with summation…
We consider the notion of a $(q,m)$-polymatroid, due to Shiromoto, and the more general notion of $(q,m)$-demi-polymatroid, and show how generalized weights can be defined for them. Further, we establish a duality for these weights…
The absolute value of the coefficient of $q$ in the chromatic polynomial of a graph $G$ is known as the chromatic discriminant of $G$ and is denoted $\alpha(G)$. There is a well known recurrence formula for $\alpha(G)$ that comes from the…
By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…
We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. The converse statement is easy…
A {\em $3$-graph} is a connected cubic graph such that each vertex is is equipped with a cyclic order of the edges incident with it. A {\em weight system} is a function $f$ on the collection of $3$-graphs which is {\em antisymmetric}:…
In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…
Chromatic derivatives and series expansions of bandlimited functions have recently been introduced in signal processing and they have been shown to be useful in practical applications. We extend the notion of chromatic derivative using…
The chromatic polynomial of a graph G counts the number of proper colorings of G. We give an affirmative answer to the conjecture of Read and Rota-Heron-Welsh that the absolute values of the coefficients of the chromatic polynomial form a…
We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…
We give a combinatorial characterization of Fulton's operational Chow cohomology groups of a complete , $\Q$-factorial, rational T-variety of complexity one in terms of so called generalized Minkowsky weights in the contraction-free case.…
We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$. Our first contribution is an…
The chromatic polynomial of a graph $G$, denoted $P(G,m)$, is equal to the number of proper $m$-colorings of $G$. The list color function of graph $G$, denoted $P_{\ell}(G,m)$, is a list analogue of the chromatic polynomial that has been…