Related papers: A note on a combinatorial interpretation of the e-…
Three decades ago, Stanley and Brenti initiated the study of the Kazhdan--Lusztig--Stanley (KLS) functions, putting on common ground several polynomials appearing in algebraic combinatorics, discrete geometry, and representation theory. In…
Stanley introduced expressions for the normalized characters of the symmetric group and stated some positivity conjectures for these expressions. Here, we give an affirmative partial answer to Stanley's positivity conjectures about the…
Let $d >1$ and $(A_n)_{n \ge 1}$ be a sequence of independent identically distributed random matrices with nonnegative entries and no zero column. This induces a Markov chain $M_n = A_n M_{n-1}$ on the cone of d-vectors with nonnegative…
Skewing operators play a central role in the symmetric function theory because of the importance of the product structure of the symmetric function space. The theory of noncommutative symmetric functions is a useful tool for studying…
Non-commutative graph theory is an operator space generalization of graph theory. Well known graph parameters such as the independence number and Lov\'asz theta function were first generalized to this setting by Duan, Severini, and Winter.…
Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…
As starting point, we formulate a corollary to the Quantitative Combinatorial Nullstellensatz. This corollary does not require the consideration of any coefficients of polynomials, only evaluations of polynomial functions. In certain…
Let $G=(V,E)$ be a simple graph with $V=\{1,2,\cdots,n\}$ and $\chi(G,x)$ be its chromatic polynomial. For an ordering $\pi=(v_1,v_2,\cdots,v_n)$ of elements of $V$, let $\delta_G(\pi)$ be the number of $i$'s, where $1\le i\le n-1$, with…
Given a partition l and a composition b, the stretched Kostka coefficient K_{l, b}(n) is the map sending each positive integer n to the Kostka coefficient indexed by nl and nb. Kirillov and Reshetikhin (1986) have shown that stretched…
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…
For integer q>1, we derive edge q-colouring models for (i) the Tutte polynomial of a graph G on the hyperbola H_q, (ii) the symmetric weight enumerator of the set of group-valued q-flows of G, and (iii) a more general vertex colouring model…
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…
As introduced by Gutman and Harary, the independence polynomial of a graph serves as the generating polynomial of its independent sets. In 1987, Alavi, Malde, Schwenk and Erd\H{o}s conjectured that the independence polynomials of all trees…
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 generalized degree polynomial $\mathbf{G}_T(x,y,z)$ of a tree $T$ is an invariant introduced by Crew that enumerates subsets of vertices by size and number of internal and boundary edges. Aliste-Prieto et al. proved that $\mathbf{G}_T$…
Let $f: V(G)\cup E(G)\rightarrow \{1,2,\dots,k\}$ be a non-proper total $k$-coloring of $G$. Define a weight function on total coloring as $$\phi(x)=f(x)+\sum\limits_{e\ni x}f(e)+\sum\limits_{y\in N(x)}f(y),$$ where $N(x)=\{y\in V(G)|xy\in…
We give a proof of the generalized Cauchy identity for double Grothendieck polynomials, a combinatorial interpretation of the stable double Grothendieck polynomials in terms of triples of tableaux, and an interpolation between the stable…
J. Przytycki has established a connection between the Hochschild homology of an algebra $A$ and the chromatic graph homology of a polygon graph with coefficients in $A$. In general the chromatic graph homology is not defined in the case…
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…
Cylindric skew Schur functions, a generalization of skew Schur functions, are closely related to the famous problem finding a combinatorial formula for the 3-point Gromov-Witten invariants of Grassmannian. In this paper, we prove cylindric…