Partially well-ordered closed sets of permutations

DOI10.1023/A:1016500300436zbMath1007.06002OpenAlexW1496524398MaRDI QIDQ698442

M. D. Atkinson, Maximillian M. Murphy, Nikola Ruškuc

Publication date: 18 September 2002

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1016500300436

zbMATH Keywords

infinite antichainspartially well-ordered setsposets of permutationspwo sets

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07)

Related Items (21)

On the least exponential growth admitting uncountably many closed permutation classes ⋮ Unsplittable classes of separable permutations ⋮ Labelled well-quasi-order for permutation classes ⋮ WQO is decidable for factorial languages ⋮ Boundary properties of well-quasi-ordered sets of graphs ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ Grid classes and partial well order ⋮ Embedding dualities for set partitions and for relational structures ⋮ Regular closed sets of permutations. ⋮ Splittings and Ramsey properties of permutation classes ⋮ Finitely labeled generating trees and restricted permutations ⋮ Pattern classes of permutations via bijections between linearly ordered sets ⋮ Schur-positive sets of permutations via products and grid classes ⋮ Simple permutations: Decidability and unavoidable substructures ⋮ Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Unnamed Item ⋮ Enumeration Schemes for Restricted Permutations ⋮ Finding regular insertion encodings for permutation classes ⋮ Geometric grid classes of permutations ⋮ Simple permutations and pattern restricted permutations

This page was built for publication: Partially well-ordered closed sets of permutations