English

Meeting Covered Elements in $\nu$-Tamari Lattices

Combinatorics 2022-01-03 v2

Abstract

For each complete meet-semilattice MM, we define an operator PopM:MM\mathsf{Pop}_M:M\to M by PopM(x)=({yM:yx}{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}(\nu)}, where Tam(ν)\text{Tam}(\nu) is the ν\nu-Tamari lattice. We determine the maximum size of a forward orbit of PopTam(ν)\mathsf{Pop}_{\text{Tam}(\nu)}. When Tam(ν)\text{Tam}(\nu) is the nthn^\text{th} mm-Tamari lattice, this maximum forward orbit size is m+n1m+n-1; in this case, we prove that the number of forward orbits of size m+n1m+n-1 is 1n1((m+1)(n2)+m1n2).\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(ν)\mu\in\text{Tam}(\nu) to be tt-Pop\mathsf{Pop}-sortable if PopTam(ν)t(μ)=ν\mathsf{Pop}_{\text{Tam}(\nu)}^t(\mu)=\nu. We enumerate 11-Pop\mathsf{Pop}-sortable lattice paths in Tam(ν)\text{Tam}(\nu) for arbitrary ν\nu. We also give a recursive method to generate 22-Pop\mathsf{Pop}-sortable lattice paths in Tam(ν)\text{Tam}(\nu) for arbitrary ν\nu; this allows us to enumerate 22-Pop\mathsf{Pop}-sortable lattice paths in a large variety of ν\nu-Tamari lattices that includes the mm-Tamari lattices.

Keywords

Cite

@article{arxiv.2104.03890,
  title  = {Meeting Covered Elements in $\nu$-Tamari Lattices},
  author = {Colin Defant},
  journal= {arXiv preprint arXiv:2104.03890},
  year   = {2022}
}

Comments

25 pages, 4 figures

R2 v1 2026-06-24T00:58:21.835Z