Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Pop-Stack Operator on Ornamentation Lattices

Published 17 Jan 2025 in math.CO | (2501.10311v1)

Abstract: Each rooted plane tree $\mathsf{T}$ has an associated ornamentation lattice $\mathcal{O}(\mathsf{T})$. The ornamentation lattice of an $n$-element chain is the $n$-th Tamari lattice. We study the pop-stack operator $\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 $\mathsf{Pop}$ on $\mathcal{O}(\mathsf{T})$, generalizing a result of Defant for Tamari lattices. We also characterize the image of $\mathsf{Pop}$ on $\mathcal{O}(\mathsf{T})$, generalizing a result of Hong for Tamari lattices. For each integer $k\geq 0$, we provide necessary conditions for an element of $\mathcal{O}(\mathsf{T})$ to be in the image of $\mathsf{Pop}k$. This allows us to completely characterize the image of $\mathsf{Pop}k$ on a Tamari lattice.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.