no. 12 · Tuesday 10 November 2026
Monk and Pieri rules for forest polynomials
Abstract
This article gives Pieri rules for forest polynomials and Monk rule for double forest polynomials. We construct binary relations $\lessdot_i$ and $\prec_i$ based on the local Tamari moves on indexed forests. These relations are explicit and constructive. For ordinary forest polynomials, the $h$- and $e$-Pieri rules are given by all chains of a fixed length along the cover relations, with certain restriction on the left or right endpoints. For double forest polynomials, our Monk rule shows every off-diagonal degree-one structure coefficient is always a single positive root, whose weight is also controlled by Tamari moves. Additionally, we introduce an insertion algorithm on positive injective words that yields a Monk rule for the corresponding slide polynomials. Regrouping this rule along Sylvester classes gives an independent Monk rule for ordinary forest polynomials.
- comments
- 33 pages
- fields
- Combinatorics