Abstract
Abstract
For an indifference graph G, we define a symmetric function of increasing spanning forests of G. We prove that this symmetric function satisfies certain linear relations, which are also satisfied by the chromatic quasisymmetric function and unicellular
$\textrm {LLT}$
polynomials. As a consequence, we give a combinatorial interpretation of the coefficients of the
$\textrm {LLT}$
polynomial in the elementary basis (up to a factor of a power of
$(q-1)$
), strengthening the description given in [4].
Publisher
Cambridge University Press (CUP)
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Mathematical Physics,Statistics and Probability,Algebra and Number Theory,Theoretical Computer Science,Analysis
Reference23 articles.
1. [10] Garsia, A.M. , Haglund, J. , Qiu, D. , and Romero, M. . $e$ -positivity results and conjectures, Preprint, 2019, arXiv:1904.07912.
2. Chromatic symmetric functions from the modular law
3. A proof of the shuffle conjecture
4. Q-counting rook configurations and a formula of frobenius
5. Ribbon tableaux, Hall–Littlewood functions, quantum affine algebras, and unipotent varieties
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献