Stack words, standard Young tableaux, permutations with forbidden subsequences and planar maps

DOI10.1016/S0012-365X(99)00121-1zbMath0941.05065WikidataQ126340246 ScholiaQ126340246MaRDI QIDQ1961247

Olivier Guibert

Publication date: 30 July 2000

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

zbMATH Keywords

planar mapsstandard Young tableauxstack wordspermutations with forbidden subsequences

Mathematics Subject Classification ID

Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)

Related Items

Sorting with networks of data structures ⋮ Symmetry and unimodality in \(t\)-stack sortable permutations ⋮ A simplicial complex of 2-stack sortable permutations