Meeting Covered Elements in -Tamari Lattices
Abstract
For each complete meet-semilattice M, we define an operator PopM:M M by \[PopM(x)=(\y∈ M:y x\\x\).\] When M is the right weak order on a symmetric group, PopM 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(), where Tam() is the -Tamari lattice. We determine the maximum size of a forward orbit of PopTam(). When Tam() is the nth m-Tamari lattice, this maximum forward orbit size is m+n-1; in this case, we prove that the number of forward orbits of size m+n-1 is \[1n-1(m+1)(n-2)+m-1n-2.\] Motivated by the recent investigation of the pop-stack-sorting map, we define a lattice path μ∈Tam() to be t-Pop-sortable if PopTam()t(μ)=. We enumerate 1-Pop-sortable lattice paths in Tam() for arbitrary . We also give a recursive method to generate 2-Pop-sortable lattice paths in Tam() for arbitrary ; this allows us to enumerate 2-Pop-sortable lattice paths in a large variety of -Tamari lattices that includes the m-Tamari lattices.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.