Generating and enumerating 321-avoiding and skew-merged simple permutations

zbMath1267.05003arXiv1301.3122MaRDI QIDQ1953536

Vincent R. Vatter, Michael Henry Albert

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

permutation patternsimple permutationenumeration of the simple skew-merged permutations

Mathematics Subject Classification ID

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

Related Items (6)

Labelled well-quasi-order for permutation classes ⋮ Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs ⋮ Longest increasing subsequences and log concavity ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ Universal limits of substitution-closed permutation classes ⋮ Well-quasi-order for permutation graphs omitting a path and a clique

Uses Software

• OEIS

This page was built for publication: Generating and enumerating 321-avoiding and skew-merged simple permutations