Forest Polynomials and Pattern Avoidance
Combinatorics
2026-02-05 v1
Abstract
Forest polynomials, recently introduced by Nadeau and Tewari, can be thought of as a quasisymmetric analogue for Schubert polynomials. They have already been shown to exhibit interesting interactions with Schubert polynomials; for example, Schubert polynomials decompose positively into forest polynomials. We further describe this relationship by showing that a Schubert polynomial is a forest polynomial exactly when avoids a set of patterns. This result adds to the long list of properties of Schubert polynomials that are controlled by pattern avoidance.
Cite
@article{arxiv.2602.04036,
title = {Forest Polynomials and Pattern Avoidance},
author = {Annie Guo and Dora Woodruff},
journal= {arXiv preprint arXiv:2602.04036},
year = {2026}
}