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

DOI10.1016/S0012-365X(99)00121-1MaRDI QIDQ1961247zbMATH OpenWikidataFDO

Authors Olivier Guibert

Publication date 30 July 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(99)00121-1

zbMATH Keywords

permutations with forbidden subsequencesplanar mapsstack wordsstandard Young tableaux

Mathematics Subject Classification ID

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

Recommendations

• Stack words, standard tableaux and Baxter permutations
• Permutations with forbidden subsequences and nonseparable planar maps
• A combinatorial proof of J. West's conjecture
• Enumeration of permutations with restricted subsequences
• Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations

Cited in

(8)

• A combinatorial bijection between standard Young tableaux and reduced words of Grassmannian permutations
• Symmetry and unimodality in \(t\)-stack sortable permutations
• A simplicial complex of 2-stack sortable permutations
• Permutations with forbidden subsequences and nonseparable planar maps
• Stack words, standard tableaux and Baxter permutations
• Catalan triangle, standard Young words and standard Young tableaux.
• Enumeration of permutations with restricted subsequences
• Sorting with networks of data structures

This page was built for publication: Stack words, standard Young tableaux, permutations with forbidden subsequences and planar maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961247)