Meeting Covered Elements in $\nu$-Tamari Lattices
Colin Defant

TL;DR
This paper introduces a general operator on complete meet-semilattices, studies its properties in the context of $ u$-Tamari lattices, and explores the dynamics and enumeration of certain sortable lattice paths related to pop-stack-sorting.
Contribution
It defines a new operator on meet-semilattices, analyzes its interaction with lattice congruences, and applies it to $ u$-Tamari lattices to study orbit sizes and sortable paths.
Findings
Maximum forward orbit size in $m$-Tamari lattices is $m+n-1$
Number of maximum size orbits is given by a binomial coefficient formula
Enumeration and recursive generation of $t$-$ ext{Pop}$-sortable lattice paths
Abstract
For each complete meet-semilattice , we define an operator by \[\mathsf{Pop}_M(x)=\bigwedge(\{y\in M:y\lessdot x\}\cup\{x\}).\] When is the right weak order on a symmetric group, 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 , where is the -Tamari lattice. We determine the maximum size of a forward orbit of . When is the -Tamari lattice, this maximum forward orbit size is ; in this case, we prove that the number of forward orbits of size is \[\frac{1}{n-1}\binom{(m+1)(n-2)+m-1}{n-2}.\] Motivated by the recent investigation of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Combinatorial Mathematics · Mathematical Dynamics and Fractals
