The pop-stack-sorting operator on Tamari lattices
From MaRDI portal
Publication:2672957
DOI10.1016/j.aam.2022.102362OpenAlexW4226099416WikidataQ114214509 ScholiaQ114214509MaRDI QIDQ2672957
Publication date: 13 June 2022
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.10030
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Lattice ideals, congruence relations (06B10) Semilattices (06A12)
Related Items (4)
Ungarian Markov chains ⋮ The image of the pop operator on various lattices ⋮ Semidistrim Lattices ⋮ Semidistrim lattices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture
- Associahedra, Tamari lattices and related structures. Tamari memorial Festschrift
- The algebra of binary search trees
- Meeting covered elements in \(\nu\)-Tamari lattices
- The \(\nu \)-Tamari lattice via \(\nu \)-trees, \( \nu \)-bracket vectors, and subword complexes
- Higher trivariate diagonal harmonics via generalized Tamari posets
- Cambrian lattices.
- \(k\)-pop stack sortable permutations and \(2\)-avoidance
- Shellable nonpure complexes and posets. II
- Symmetry of Narayana Numbers and Rowvacuation of Root Posets
- Pop-stack-sorting for Coxeter groups
- Two-stack-sorting with pop stacks
- Eulerian Numbers
- The enumeration of generalized Tamari intervals
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Semidistrim lattices
This page was built for publication: The pop-stack-sorting operator on Tamari lattices