The Pop-Stack Operator on Ornamentation Lattices
Khalid Ajran, Colin Defant

TL;DR
This paper explores the properties of the pop-stack operator on ornamentation lattices associated with rooted plane trees, generalizing known results from Tamari lattices to broader lattice structures.
Contribution
It generalizes the analysis of the pop-stack operator from Tamari lattices to ornamentation lattices of rooted plane trees, including orbit size bounds and image characterizations.
Findings
Maximum size of forward orbits on ornamentation lattices computed
Characterization of the image of the pop-stack operator generalized
Necessary conditions for elements to be in the image of powers of the operator provided
Abstract
Each rooted plane tree has an associated ornamentation lattice . The ornamentation lattice of an -element chain is the -th Tamari lattice. We study the pop-stack operator , which sends each element to the meet of the elements covered by or equal to . We compute the maximum size of a forward orbit of on , generalizing a result of Defant for Tamari lattices. We also characterize the image of on , generalizing a result of Hong for Tamari lattices. For each integer , we provide necessary conditions for an element of to be in the image of . This allows us to completely characterize the image of on a Tamari lattice.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic
