ﻻ يوجد ملخص باللغة العربية
In a 2016 ArXiv posting F. Bergeron listed a variety of symmetric functions $G[X;q]$ with the property that $G[X;1+q]$ is $e$-positive. A large subvariety of his examples could be explained by the conjecture that the Dyck path LLT polynomials exhibit the same phenomenon. In this paper we list the results of computer explorations which suggest that other examples exhibit the same phenomenon. We prove two of the resulting conjectures and propose algorithms that would prove several of our conjectures. In writing this paper we have learned that similar findings have been independently discovered by Per Alexandersson.
We prove that for any tree with a vertex of degree at least six, its chromatic symmetric function is not $e$-positive, that is, it cannot be written as a nonnegative linear combination of elementary symmetric functions. This makes significant progres
Inspired by the recent work of Chen and Fu on the e-positivity of trivariate second-order Eulerian polynomials, we show the e-positivity of a family of multivariate k-th order Eulerian polynomials. A relationship between the coefficients of this e-po
Motivated by Stanleys $mathbf{(3+1)}$-free conjecture on chromatic symmetric functions, Foley, Ho`{a}ng and Merkel introduced the concept of strong $e$-positivity and conjectured that a graph is strongly $e$-positive if and only if it is (claw, net)-
Ma-Ma-Yeh made a beautiful observation that a change of the grammar of Dumont instantly leads to the $gamma$-positivity of the Eulearian polynomials. We notice that the transformed grammar bears a striking resemblance to the grammar for 0-1-2 increas
We extend the big and $p$-typical Witt vector functors from commutative rings to commutative semirings. In the case of the big Witt vectors, this is a repackaging of some standard facts about monomial and Schur positivity in the combinatorics of symm