Pages that link to "Item:Q2680951"
From MaRDI portal
The following pages link to Stack-sortable permutations and beyond (Q2680951):
Displaying 30 items.
- Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry (Q404464) (← links)
- Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture (Q405184) (← links)
- Describing West-3-stack-sortable permutations with permutation patterns (Q715231) (← links)
- Stack words and a bound for 3-stack sortable permutations (Q777444) (← links)
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!) (Q1193435) (← links)
- Multi-static enumeration of two-stack sortable permutations (Q1383515) (← links)
- A survey of stack-sorting disciplines (Q1408520) (← links)
- A simplicial complex of 2-stack sortable permutations (Q1867009) (← links)
- Restricted stacks as functions (Q1981702) (← links)
- Asymptotics of 3-stack-sortable permutations (Q2034079) (← links)
- Troupes, cumulants, and stack-sorting (Q2118918) (← links)
- Stack-sorting preimages of permutation classes (Q2199801) (← links)
- Fertility monotonicity and average complexity of the stack-sorting map (Q2225458) (← links)
- Stack sorting with increasing and decreasing stacks (Q2288161) (← links)
- Counting 3-stack-sortable permutations (Q2299650) (← links)
- Preimages under the stack-sorting algorithm (Q2361080) (← links)
- 2-stack sorting is polynomial (Q2363966) (← links)
- Fighting fish and two-stack sortable permutations (Q2632714) (← links)
- Lattice paths and \((n - 2)\)-stack sortable permutations (Q2672927) (← links)
- Efficient methods of calculating the number of heapable permutations (Q2691575) (← links)
- Stacking Blocks and Counting Permutations (Q3103389) (← links)
- (Q4543426) (← links)
- Permutations sortable by two stacks in parallel and quarter plane walks (Q4584133) (← links)
- Passing through a stack k times (Q4621300) (← links)
- Toppleable permutations, excedances and acyclic orientations (Q5052168) (← links)
- Enumeration of Stack-Sorting Preimages via a Decomposition Lemma (Q5074765) (← links)
- Enumerating permutations sortable by \(k\) passes through a pop-stack (Q5925190) (← links)
- Counting Pop-Stacked Permutations in Polynomial Time (Q6042966) (← links)
- Highly sorted permutations with respect to a 312-avoiding stack (Q6097074) (← links)
- Troupes, cumulants, and stack-sorting (Q6161642) (← links)
