The Pop-Stack Operator on Ornamentation Lattices
Combinatorics
2025-01-20 v1
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.
Cite
@article{arxiv.2501.10311,
title = {The Pop-Stack Operator on Ornamentation Lattices},
author = {Khalid Ajran and Colin Defant},
journal= {arXiv preprint arXiv:2501.10311},
year = {2025}
}
Comments
16 pages, 8 figures