Meeting Covered Elements in νν-Tamari Lattices

preprint2021arXivOpen access

Abstract

For each complete meet-semilattice MM, we define an operator PopM:M→M\mathsf{Pop}_M:M\to M by PopM(x)=⋀({y∈M:y⋖x}∪{x}).\mathsf{Pop}_M(x)=\bigwedge(\{y\in M:y\lessdot x\}\cup\{x\}). When MM is the right weak order on a symmetric group, PopM\mathsf{Pop}_M is the pop-stack-sorting map. We prove some general properties of these operators, including a theorem that describes how they interact with certain lattice congruences. We then specialize our attention to the dynamics of PopTam(ν)\mathsf{Pop}_{\text{Tam}(ν)}, where Tam(ν)\text{Tam}(ν) is the νν-Tamari lattice. We determine the maximum size of a forward orbit of PopTam(ν)\mathsf{Pop}_{\text{Tam}(ν)}. When Tam(ν)\text{Tam}(ν) is the nthn^\text{th} mm-Tamari lattice, this maximum forward orbit size is m+n−1m+n-1; in this case, we prove that the number of forward orbits of size m+n−1m+n-1 is 1n−1((m+1)(n−2)+m−1n−2).\frac{1}{n-1}\binom{(m+1)(n-2)+m-1}{n-2}. Motivated by the recent investigation of the pop-stack-sorting map, we define a lattice path μ∈Tam(ν)μ\in\text{Tam}(ν) to be tt-Pop\mathsf{Pop}-sortable if PopTam(ν)t(μ)=ν\mathsf{Pop}_{\text{Tam}(ν)}^t(μ)=ν. We enumerate 11-Pop\mathsf{Pop}-sortable lattice paths in Tam(ν)\text{Tam}(ν) for arbitrary νν. We also give a recursive method to generate 22-Pop\mathsf{Pop}-sortable lattice paths in Tam(ν)\text{Tam}(ν) for arbitrary νν; this allows us to enumerate 22-Pop\mathsf{Pop}-sortable lattice paths in a large variety of νν-Tamari lattices that includes the mm-Tamari lattices.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.