Subclasses of the separable permutations

DOI10.1112/BLMS/BDR022MaRDI QIDQ3094058zbMATH OpenOpenAlexFDO

Authors Mike Atkinson, Michael Albert, Vincent Vatter

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

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

Abstract: We prove that all subclasses of the separable permutations not containing Av(231) or a symmetry of this class have rational generating functions. Our principal tools are partial well-order, atomicity, and the theory of strongly rational permutation classes introduced here for the first time.

Recommendations

• Unsplittable classes of separable permutations
• Rationality for subclasses of 321-avoiding permutations
• Enumeration of permutations with restricted subsequences
• Simple permutations and pattern restricted permutations
• Permutations with forbidden subsequences and nonseparable planar maps

Cited in

(26)

• Block decomposition of permutations and Schur-positivity
• Distributions of statistics on separable permutations
• Geometric grid classes of permutations
• The micro-world of cographs
• Separable \(d\)-permutations and guillotine partitions
• Composability of permutation classes
• Enumeration of pin-permutations
• Inflations of geometric grid classes of permutations
• Permutation classes
• Block numbers of permutations and Schur-positivity
• Combinatorics of rectangulations: old and new bijections
• Unsplittable classes of separable permutations
• Small permutation classes
• Minimal prime ages, words and permutation graphs
• Well-quasi-order for permutation graphs omitting a path and a clique
• Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
• Critical properties and complexity measures of read-once Boolean functions
• Most principal permutation classes, and \(t\)-stack sortable permutations, have nonrational generating functions
• A general theory of Wilf-equivalence for Catalan structures
• Shape and pattern containment of separable permutations.
• Equipopularity classes in the separable permutations
• Distribution of statistics on separable permutations restricted by a flat POP
• Avoiding maximal parabolic subgroups of S_k
• Linear clique-width for hereditary classes of cographs
• Combinatorial specification of permutation classes
• Rationality for subclasses of 321-avoiding permutations

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

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