Stack words, standard tableaux and Baxter permutations

DOI10.1016/S0012-365X(96)83009-3zbMath0870.05077OpenAlexW2069405390MaRDI QIDQ1924361

Olivier Guibert, Dulucq, Serge

Publication date: 14 October 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)83009-3

zbMATH Keywords

enumerationYoung tableauxBaxter permutationsstack sortable permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)

Related Items (12)

Watermelon uniform random generation with applications ⋮ On some combinatorial sequences associated to invariant theory ⋮ On the enumeration of tanglegrams and tangled chains ⋮ Cambrian Hopf algebras ⋮ Generic rectangulations ⋮ Bijections for Baxter families and related objects ⋮ Unnamed Item ⋮ The Hopf algebra of diagonal rectangulations. ⋮ Coxeter-bicatalan combinatorics ⋮ Baxter permutations and plane bipolar orientations ⋮ Baxter posets ⋮ Noncrossing Arc Diagrams and Canonical Join Representations

Cites Work

• Unnamed Item
• Sorting twice through a stack
• Binomial determinants, paths, and hook length formulae
• Shuffle of parenthesis systems and Baxter permutations
• Standard Young tableaux of height 4 and 5
• Baxter permutations rise again
• 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)\)!)
• The number of Baxter permutations
• A combinatorial proof of J. West's conjecture
• On Fixed Points of the Composite of Commuting Functions
• A Census of Planar Maps
• The Hook Graphs of the Symmetric Group
• Restricted permutations
• Baxter permutations

This page was built for publication: Stack words, standard tableaux and Baxter permutations