A Survey of Simple Permutations

zbMath1217.05008arXiv0801.0963MaRDI QIDQ3084737

Robert Brignall

Publication date: 25 March 2011

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

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05)

Related Items (16)

Decomposing inversion sets of permutations and applications to faces of the Littlewood-Richardson cone ⋮ Unsplittable classes of separable permutations ⋮ On scattered convex geometries ⋮ Pairs of orthogonal countable ordinals ⋮ Symmetric maximal Condorcet domains ⋮ Enumerating indices of Schubert varieties defined by inclusions ⋮ Grid classes and partial well order ⋮ Universal limits of substitution-closed permutation classes ⋮ Countable linear orders with disjoint infinite intervals are mutually orthogonal ⋮ An algorithm computing combinatorial specifications of permutation classes ⋮ Small configurations in simple permutations ⋮ Generating asymptotics for factorially divergent sequences ⋮ Orthogonal countable linear orders ⋮ Geometric grid classes of permutations ⋮ Interval posets of permutations ⋮ Homomorphic image orders on combinatorial structures.

This page was built for publication: A Survey of Simple Permutations