Sorting twice through a stack (Q688711): Difference between revisions

@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4074820
@@ Property / cites work: Q4074820 / rank @@
+Normal rank
@@ Property / cites work @@
+Restricted permutations
@@ Property / cites work: Restricted permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4774085
@@ Property / cites work: Q4774085 / rank @@
+Normal rank
@@ Property / cites work @@
+A Census of Slicings
@@ Property / cites work: A Census of Slicings / rank @@
+Normal rank
@@ Property / cites work @@
+A Census of Planar Maps
@@ Property / cites work: A Census of Planar Maps / rank @@
+Normal rank
@@ Property / cites work @@
+Q3844537
@@ Property / cites work: Q3844537 / rank @@
+Normal rank
@@ Property / cites work @@
+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)\)!)
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(93)90321-j
+Normal rank
@@ Property / OpenAlex ID @@
+W2006800405
@@ Property / OpenAlex ID: W2006800405 / rank @@
+Normal rank