Pages that link to "Item:Q1193435"

The following pages link to 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):

Displaying 48 items.

• Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry (Q404464) (← links)
• Operators of equivalent sorting power and related Wilf-equivalences (Q463051) (← links)
• Sorting with networks of data structures (Q602673) (← links)
• Sorting twice through a stack (Q688711) (← links)
• Stack words and a bound for 3-stack sortable permutations (Q777444) (← links)
• Stack-sorting, set partitions, and Lassalle's sequence (Q778710) (← links)
• Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations (Q1012156) (← links)
• A bijective census of nonseparable planar maps (Q1268599) (← links)
• A combinatorial proof of J. West's conjecture (Q1584296) (← links)
• Symmetry and unimodality in \(t\)-stack sortable permutations (Q1601431) (← links)
• Staircases, dominoes, and the growth rate of 1324-avoiders (Q1689896) (← links)
• Fighting fish: enumerative properties (Q1745138) (← links)
• Sorting with two ordered stacks in series. (Q1853525) (← links)
• A simplicial complex of 2-stack sortable permutations (Q1867009) (← links)
• 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers (Q1887043) (← links)
• Permutations with forbidden subsequences and nonseparable planar maps (Q1917517) (← links)
• Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations (Q1924222) (← links)
• Stack words, standard tableaux and Baxter permutations (Q1924361) (← links)
• Further bijections to pattern-avoiding valid hook configurations (Q2020016) (← links)
• Asymptotics of 3-stack-sortable permutations (Q2034079) (← links)
• Stack-sorting with consecutive-pattern-avoiding stacks (Q2035992) (← links)
• Meeting covered elements in \(\nu\)-Tamari lattices (Q2070083) (← links)
• Troupes, cumulants, and stack-sorting (Q2118918) (← links)
• Sorting by shuffling methods and a queue (Q2161211) (← links)
• A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate (Q2189832) (← links)
• Fertility monotonicity and average complexity of the stack-sorting map (Q2225458) (← links)
• Counting 3-stack-sortable permutations (Q2299650) (← links)
• Preimages under the stack-sorting algorithm (Q2361080) (← links)
• Restricted non-separable planar maps and some pattern avoiding permutations (Q2444543) (← links)
• Polynomial equations with one catalytic variable, algebraic series and map enumeration (Q2498737) (← links)
• Fighting fish and two-stack sortable permutations (Q2632714) (← links)
• Lattice paths and \((n - 2)\)-stack sortable permutations (Q2672927) (← links)
• Stack-sortable permutations and beyond (Q2680951) (← links)
• A bijection between Tamari intervals and extended fighting fish (Q2701000) (← links)
• Fighting fish (Q2958580) (← links)
• Stack-sorting for Coxeter groups (Q5052175) (← links)
• Enumeration of Stack-Sorting Preimages via a Decomposition Lemma (Q5074765) (← links)
• Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations (Q5074770) (← links)
• Highly sorted permutations and Bell numbers (Q5093421) (← links)
• Asymptotic normality in <i>t</i>-stack sortable permutations (Q5145117) (← links)
• Two-stack-sorting with pop stacks (Q5197592) (← links)
• Baxter permutations and plane bipolar orientations (Q5300984) (← 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)
• Highly sorted permutations with respect to a 312-avoiding stack (Q6097074) (← links)
• Vincular pattern avoidance on cyclic permutations (Q6156004) (← links)
• A lift of West's stack-sorting map to partition diagrams (Q6165151) (← links)