Pages that link to "Item:Q6042966"
From MaRDI portal
The following pages link to Counting Pop-Stacked Permutations in Polynomial Time (Q6042966):
Displaying 14 items.
- Pop-stacks in parallel (Q1606930) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Meeting covered elements in \(\nu\)-Tamari lattices (Q2070083) (← links)
- Counting 3-stack-sortable permutations (Q2299650) (← links)
- Efficient methods of calculating the number of heapable permutations (Q2691575) (← links)
- Pop-stack-sorting for Coxeter groups (Q5051465) (← links)
- Stack-sorting for Coxeter groups (Q5052175) (← links)
- Enumerating permutations sortable by \(k\) passes through a pop-stack (Q5925190) (← links)
- The image of the pop operator on various lattices (Q6138047) (← links)
- Semidistrim Lattices (Q6159801) (← links)
- The Ungar games (Q6548025) (← links)
- Foot-sorting for socks (Q6614158) (← links)
- A new lower bound for deterministic pop-stack-sorting (Q6655684) (← links)
- Dynamics of pop-tsack torsing (Q6665415) (← links)