Related papers: $e$-positivity of vertical strip LLT polynomials

A univariate trace polynomial is a polynomial in a variable x and formal trace symbols Tr(x^j). Such an expression can be naturally evaluated on matrices, where the trace symbols are evaluated as normalized traces. This paper addresses…

For any Schur function $s_{\nu}$, the associated {\em delta operator} $\Delta'_{s_{\nu}}$ is a linear operator on the ring of symmetric functions which has the modified Macdonald polynomials as an eigenbasis. When $\nu = (1^{n-1})$ is a…

Given a directed graph E we describe a method for constructing a Leavitt path algebra $L_R(E)$ whose coefficients are in a commutative unital ring R. We prove versions of the Graded Uniqueness Theorem and Cuntz-Krieger Uniqueness Theorem…

A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…

The adjoint polynomial of $G$ is \[h(G,x)=\sum_{k=1}^n(-1)^{n-k}a_k(G)x^k,\] where $a_k(G)$ denotes the number of ways one can cover all vertices of the graph $G$ by exactly $k$ disjoint cliques of $G$. In this paper we show the the adjoint…

In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart…

In this paper an explicit formula is given for a sequence of numbers. The positivity of this sequence of numbers implies that zeros in the critical strip of the Euler product of Hecke polynomials, which are associated with the space of cusp…

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

Motivated by Stanley's conjecture about the $e$-positivity of claw-free incomparability graphs, Hamel and her collaborators studied the $e$-positivity of $(claw, H)$-free graphs, where $H$ is a four-vertex graph. In this paper we establish…

We investigate linear operators $A:\mathbb{R}[x_1,\dots,x_n]\to\mathbb{R}[x_1,\dots,x_n]$. We give explicit operators $A$ such that, for fixed $d\in\mathbb{N}_0$ and closed $K\subseteq\mathbb{R}^n$, $e^A\mathrm{Pos}(K)_{\leq…

Motivated by the study of Macdonald polynomials, J. Haglund and A. Wilson introduced a nonsymmetric polynomial analogue of the chromatic quasisymmetric function called the \emph{chromatic nonsymmetric polynomial} of a Dyck graph. We give a…

It is known that the Ehrhart polynomials of cross-polytopes, as well as of pyramids over them, have positive coefficients. We give a combinatorial proof of this fact by showing that a scaled version of the Ehrhart polynomials are generating…

We introduce a new family of symmetric polynomials $\mathfrak{G}^{(\mathbf{u},\mathbf{v})}_{\lambda}$ arising from exactly solvable lattice models associated with the quantised loop algebra $\mathcal{U}_{q}(\mathfrak{sl}_{2}[z^\pm])$. The…

Tatsuyuki Hikita recently proved the Stanley--Stembridge conjecture using probabilistic methods, showing that the chromatic symmetric functions of unit interval graphs are $e$-positive. Finding a combinatorial interpretation for these…

In 2010, Marshall settled the strip conjecture, according to which every polynomial in $\mathbb{R}[x,y]$, nonnegative on the strip $[-1,1]\times\mathbb{R}$, is a sum of squares and of squares times $1-x^2$. We consider affine nonsingular…

We prove some Schur positivity results for the chromatic symmetric function $X_G$ of a (hyper)graph $G$, using connections to the group algebra of the symmetric group. The first such connection works for (hyper)forests $F$: we describe the…

For a finite multigraph G, the reliability function of G is the probability R_G(q) that if each edge of G is deleted independantly with probability q then the remaining edges of G induce a connected spanning subgraph of G; this is a…

Dallard, Milani\v{c}, and \v{S}torgel conjectured that for a hereditary graph class $\mathcal{G}$, if there is some function $f:\mathbb{N}\to\mathbb{N}$ such that every graph $G\in \mathcal{G}$ with clique number $\omega(G)$ has treewidth…

A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…

Given an element in a finite-dimensional real vector space, $V$, that is a nonnegative linear combination of basis vectors for some basis $B$, we compute the probability that it is furthermore a nonnegative linear combination of basis…