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): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Picture-Writing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On context-free languages and push-down automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sorting twice through a stack / rank | |||
Normal rank | |||
Latest revision as of 13:16, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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)\)!) |
scientific article |
Statements
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)\)!) (English)
0 references
27 September 1992
0 references
Julian West's conjecture
0 references
two-stack-sortable permutations
0 references
weight enumeration
0 references
