The following pages link to (Q3911404):
Displaying 31 items.
- Product decompositions of the symmetric group induced by separable permutations (Q412251) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- The enumeration of permutations sortable by pop stacks in parallel (Q987841) (← links)
- The Brownian limit of separable permutations (Q1660630) (← links)
- A counterexample regarding labelled well-quasi-ordering (Q1756107) (← links)
- Separable elements and splittings of Weyl groups (Q2006095) (← links)
- Meeting covered elements in \(\nu\)-Tamari lattices (Q2070083) (← links)
- Crystal pop-stack sorting and type \(A\) crystal lattices (Q2136195) (← links)
- Sorting by shuffling methods and a queue (Q2161211) (← links)
- Separable elements: linear extensions, graph associahedra, and splittings of Weyl groups (Q2199869) (← links)
- Fertility monotonicity and average complexity of the stack-sorting map (Q2225458) (← links)
- Separable elements in Weyl groups (Q2280364) (← links)
- Simple permutations and algebraic generating functions (Q2426423) (← links)
- A bijection between permutations and floorplans, and its applications (Q2499588) (← links)
- On the number of rectangulations of a planar point set (Q2500619) (← links)
- \(k\)-pop stack sortable permutations and \(2\)-avoidance (Q2662333) (← links)
- The pop-stack-sorting operator on Tamari lattices (Q2672957) (← links)
- Asymptotics of principal evaluations of Schubert polynomials for layered permutations (Q4621348) (← links)
- On the Brownian separable permuton (Q4993091) (← links)
- Sorting Cayley permutations with pattern-avoiding machines (Q5000313) (← links)
- Pop-stack-sorting for Coxeter groups (Q5051465) (← links)
- Labelled well-quasi-order for permutation classes (Q5051473) (← links)
- Stack-sorting for Coxeter groups (Q5052175) (← links)
- (Q5074767) (← links)
- Two-stack-sorting with pop stacks (Q5197592) (← links)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- Enumerating permutations sortable by \(k\) passes through a pop-stack (Q5918174) (← links)
- Enumerating permutations sortable by \(k\) passes through a pop-stack (Q5925190) (← links)
- The infinite limit of separable permutations (Q6074670) (← links)
- The skew Brownian permuton: A new universality class for random constrained permutations (Q6075083) (← links)
- Ungarian Markov chains (Q6136831) (← links)
