Related papers: An equivalent formulation of chromatic quasi-polyn…

In his work of 1969, Merle E. Manis introduced valuations on commutative rings. Recently, the class of totally quasi-ordered rings was developped by the second author. In the present paper, we establish the notion of compatibility between…

The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…

A recent result of Lofano and Paolini expresses the characteristic polynomial of a real hyperplane arrangement in terms of a projection statistic on the regions of the arrangement. We use this result to give an alternative proof for Greene…

We show that the quasiequational theory of a relatively congruence modular quasivariety of left $R$-modules is determined by a two-sided ideal in $R$ together with a filter of left ideals. The two-sided ideal encodes the identities that…

The chromatic quasisymmetric functions (csf) of Shareshian and Wachs associated to unit interval orders have attracted a lot of interest since their introduction in 2016, both in combinatorics and geometry, because of their relation to the…

In this paper, we describe the relationship between the quasi-component q(G) of a (perfectly) minimal pseudocompact abelian group G and the quasi-component q(\widetilde G) of its completion. Specifically, we characterize the pairs (C,A) of…

We present a non-standard proof of the fact that the existence of a local (i.e. restricted to a point) characteristic-zero, semi-parametric lifting for a variety defined by the zero locus of polynomial equations over the integers is…

Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any…

Motivated by Dohmen-P\"onitz-Tittmann's bivariate chromatic polynomial $\chi_G(x,y)$, which counts all $x$-colorings of a graph $G$ such that adjacent vertices get different colors if they are $\le y$, we introduce a bivarate version of…

We give a new interpretation of the chromatic polynomial of a simple graph G in terms of the Kac-Moody Lie algebra with Dynkin diagram G. We show that the chromatic polynomial is essentially the q-Kostant partition function of this Lie…

For a colour cluster $\C =(\mathcal{C}_1,\mathcal{C}_2, \mathcal{C}_3,\dots,\mathcal{C}_\ell)$, $\mathcal{C}_i$ is a colour class, and $|\mathcal{C}_i|=r_i \geq 1$, we investigate a simple connected graph structure $G^{\C}$, which…

Building off of many recent advances in the subject by many different researchers, we describe a picture of A-equivariant chromatic homotopy theory which mirrors the now classical non-equivariant picture of Morava, Miller-Ravenel-Wilson,…

In this paper, for each graph $G$, we def\mbox{}ine a chain complex of graded modules over the ring of polynomials, whose graded Euler characteristic is equal to the chromatic polynomial of $G$. Furthermore, we def\mbox{}ine a chain complex…

In terms of the creative microscoping method recently introduced by Guo and Zudilin [Adv. Math. 346 (2019), 329--358], we find a $q$-supercongruence with four parameters modulo $\Phi_n(q)(1-aq^n)(a-q^n)$, where $\Phi_n(q)$ denotes the…

We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $\mathbb{F}_q$-isomorphism classes…

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…

The notion of $S$-labeling of graphs, where $S$ is a subset of a symmetric group, was introduced in 2019 by Jin, Wong, and Zhu. This notion provides the framework for a common generalization of various well studied notions of graph…

The minimum number of total independent partition sets of $V \cup E$ of a graph $G=(V,E)$ is called the \emph{total chromatic number} of $G$, denoted by $\chi''(G)$. If the difference between cardinalities of any two total independent sets…

The Schur functions, a basis for the symmetric polynomials (Sym), encode the irreducible representations of the symmetric group, $\mathfrak{S}_n$, via the Frobenius characteristic map. In 1996, Krob and Thibon defined a quasisymmetric…

We develop representation theory of the rational Cherednik algebra H associated to a finite Coxeter group W in a vector space h. It is applied to show that, for integral values of parameter `c', the algebra H is simple and Morita equivalent…