English

The Pop-Stack Operator on Ornamentation Lattices

Combinatorics 2025-01-20 v1

Abstract

Each rooted plane tree T\mathsf{T} has an associated ornamentation lattice O(T)\mathcal{O}(\mathsf{T}). The ornamentation lattice of an nn-element chain is the nn-th Tamari lattice. We study the pop-stack operator Pop ⁣:O(T)O(T)\mathsf{Pop}\colon\mathcal{O}(\mathsf{T})\to\mathcal{O}(\mathsf{T}), which sends each element δ\delta to the meet of the elements covered by or equal to δ\delta. We compute the maximum size of a forward orbit of Pop\mathsf{Pop} on O(T)\mathcal{O}(\mathsf{T}), generalizing a result of Defant for Tamari lattices. We also characterize the image of Pop\mathsf{Pop} on O(T)\mathcal{O}(\mathsf{T}), generalizing a result of Hong for Tamari lattices. For each integer k0k\geq 0, we provide necessary conditions for an element of O(T)\mathcal{O}(\mathsf{T}) to be in the image of Popk\mathsf{Pop}^k. This allows us to completely characterize the image of Popk\mathsf{Pop}^k 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

R2 v1 2026-06-28T21:09:31.247Z