Related papers: An equivalent formulation of chromatic quasi-polyn…
The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced…
We introduce and study the notion of the $G$-Tutte polynomial for a list $\mathcal{A}$ of elements in a finitely generated abelian group $\Gamma$ and an abelian group $G$, which is defined by counting the number of homomorphisms from…
The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…
Motivated by Stanley's generalization of the chromatic polynomial of a graph to the chromatic symmetric function, we introduce the characteristic polynomial of a representation of the symmetric group, or more generally, of a symmetric…
The quantum chromatic number, $\chi_q(G)$, of a graph $G$ was originally defined as the minimal number of colors necessary in a quantum protocol in which two provers that cannot communicate with each other but share an entangled state can…
The $U$-polynomial of Noble and Welsh is known to have intimate connections with the Potts model as well as with several important graph polynomials. For each graph $G$, $U(G)$ is equivalent to Stanley's symmetric bad colouring polynomial…
We state combinatorial formulas for hyperoctahedral group ($\mathfrak B_n$) character evaluations of the form $\chi( {{\widetilde C}_w}^{\negthickspace\negthickspace BC}\negthickspace(1))$, where ${{\widetilde…
We consider a graph polynomial \xi(G;x,y,z) introduced by Averbouch, Godlin, and Makowsky (2007). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a bivariate chromatic polynomial defined by Dohmen, Poenitz…
Given a graph $G$ of order $n$, the $\sigma$-$polynomial$ of $G$ is the generating function $\sigma(G,x) = \sum a_{i}x^{i}$ where $a_{i}$ is the number of partitions of the vertex set of $G$ into $i$ nonempty independent sets. Such…
Similar to linear spaces, many examples of quasilinear spaces have a notion of multiplication of the elements. To characterising these examples, in the present paper we generalize the notion of quasilinear spaces and introduce…
In 1970 Hajnal and Szemer\'edi proved a conjecture of Erd\"os that for a graph with maximum degree $\Delta$, there exists an equitable $\Delta+1$ coloring; that is a coloring where color class sizes differ by at most $1$. In 2007 Kierstand…
Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…
We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…
We introduce the concept of Almost-Companion Matrix (ACM) by relaxing the non-derogatory property of the standard Companion Matrix (CM). That is, we define an ACM as a matrix whose characteristic polynomial coincides with a given monic and…
The non-negative integer cocharge statistic on words was introduced in the 1970's by Lascoux and Sch\"utzenberger to combinatorially characterize the Hall-Littlewood polynomials. Cocharge has since been used to explain phenomena ranging…
The orbital bivariate chromatic polynomial, introduced in this article, counts the number of ways to color the vertices of a graph with $\lambda$ colors such that adjacent vertices either receive distinct colors from a set of $\lambda$…
Arithmetical invariants---such as sets of lengths, catenary and tame degrees---describe the non-uniqueness of factorizations in atomic monoids. We study these arithmetical invariants by the monoid of relations and by presentations of the…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
The quantum double Schubert polynomials studied by Kirillov and Maeno, and by Ciocan-Fontanine and Fulton, are shown to represent Schubert classes in Kim's presentation of the equivariant quantum cohomology of the flag variety. We define…
Partial cubes are the graphs which can be embedded into hypercubes. The {\em cube polynomial} of a graph $G$ is a counting polynomial of induced hypercubes of $G$, which is defined as $C(G,x):=\sum_{i\geqslant 0}\alpha_i(G)x^i$, where…