The Pop-Stack Operator on Ornamentation Lattices
Abstract
Each rooted plane tree T has an associated ornamentation lattice O(T). The ornamentation lattice of an n-element chain is the n-th Tamari lattice. We study the pop-stack operator Pop(T)(T), 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 Pop on O(T), generalizing a result of Defant for Tamari lattices. We also characterize the image of Pop on O(T), generalizing a result of Hong for Tamari lattices. For each integer k≥ 0, we provide necessary conditions for an element of O(T) to be in the image of Popk. This allows us to completely characterize the image of Popk on a Tamari lattice.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.