Subclasses of the separable permutations

DOI10.1112/blms/bdr022zbMath1229.05012arXiv1007.1014OpenAlexW2130694132MaRDI QIDQ3094058

M. D. Atkinson, Vincent R. Vatter, Michael Henry Albert

Publication date: 21 October 2011

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.1014

zbMATH Keywords

generating functionspattern avoidanceseparable permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (10)

The micro-world of cographs ⋮ Block decomposition of permutations and Schur-positivity ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ A general theory of Wilf-equivalence for Catalan structures ⋮ Linear Clique‐Width for Hereditary Classes of Cographs ⋮ Block numbers of permutations and Schur-positivity ⋮ Critical properties and complexity measures of read-once Boolean functions ⋮ Geometric grid classes of permutations ⋮ Inflations of geometric grid classes of permutations ⋮ Well-quasi-order for permutation graphs omitting a path and a clique

This page was built for publication: Subclasses of the separable permutations