Pages that link to "Item:Q1584296"

The following pages link to A combinatorial proof of J. West's conjecture (Q1584296):

Displaying 25 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)
• Sorting with networks of data structures (Q602673) (← links)
• Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations (Q1012156) (← links)
• A bijective census of nonseparable planar maps (Q1268599) (← links)
• Symmetry and unimodality in \(t\)-stack sortable permutations (Q1601431) (← links)
• 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers (Q1887043) (← links)
• Permutations with forbidden subsequences and nonseparable planar maps (Q1917517) (← links)
• Stack words, standard tableaux and Baxter permutations (Q1924361) (← links)
• Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations (Q1953524) (← links)
• Troupes, cumulants, and stack-sorting (Q2118918) (← links)
• Polyurethane toggles (Q2188837) (← links)
• Stack-sorting preimages of permutation classes (Q2199801) (← 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)
• Finitely labeled generating trees and restricted permutations (Q2457348) (← links)
• A geometric form for the extended patience sorting algorithm (Q2490023) (← links)
• Fighting fish and two-stack sortable permutations (Q2632714) (← links)
• Enumeration of Stack-Sorting Preimages via a Decomposition Lemma (Q5074765) (← links)
• (Q5074767) (← links)
• Fertility, Strong Fertility, and Postorder Wilf Equivalence (Q5109059) (← links)
• On linear transformations preserving the Pólya frequency property (Q5469205) (← links)
• Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
• Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels (Q6074662) (← links)