Symmetry and unimodality in t-stack sortable permutations

Authors:
Miklós Bóna
Affiliations:
Department of Mathematics, University of Florida, Little Hall, Gainesville, Florida
Venue:
Journal of Combinatorial Theory Series A
Year:
2002

Citing 8
Cited 3

Enumerative combinatorics

Enumerative combinatorics
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)!)

Discrete Mathematics
Sorting twice through a stack

Selected papers of the conference on Formal power series and algebraic combinatorics
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
A combinatorial proof of J. West's conjecture

Discrete Mathematics
A bijective census of nonseparable planar maps

Journal of Combinatorial Theory Series A
Stack words, standard Young tableaux, permutations with forbidden subsequences and planar maps

Discrete Mathematics
A self-dual poset on objects counted by the Catalan numbers and a type-B analogue

Discrete Mathematics

132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers

Discrete Applied Mathematics
Actions on permutations and unimodality of descent polynomials

European Journal of Combinatorics
Sorting with networks of data structures

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first nontrivial results on t-stack sortable permutations by constructively proving that the sequence Wt(n, k) of the numbers of t-stack sortable permutations with k descents is symmetric and unimodal.