Partially well-ordered closed sets of permutations

DOI10.1023/A:1016500300436MaRDI QIDQ698442zbMATH OpenOpenAlexFDO

Authors Mike Atkinson, Maximillian M. Murphy, N. 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)

Recommendations

• Profile classes and partial well-order for permutations
• An infinite antichain of permutations
• On permutations avoiding partially ordered patterns defined by bipartite graphs
• Grid classes and partial well order
• Tableaux and chains in a new partial order of \(S_ n\)

Cited in

(25)

• Regular closed sets of permutations.
• An infinite antichain of permutations
• Geometric grid classes of permutations
• scientific article; zbMATH DE number 7559423 (Why is no real title available?)
• Profile classes and partial well-order for permutations
• Pattern classes of permutations via bijections between linearly ordered sets
• Some Results on the Sarkovskii Partial Ordering of Permutations
• Forbidden substructures and combinatorial dichotomies: WQO and universality
• Unsplittable classes of separable permutations
• Simple permutations: Decidability and unavoidable substructures
• Labelled well-quasi-order for permutation classes
• scientific article; zbMATH DE number 218835 (Why is no real title available?)
• Simple permutations and pattern restricted permutations
• On the least exponential growth admitting uncountably many closed permutation classes
• Splittings and Ramsey properties of permutation classes
• Embedding dualities for set partitions and for relational structures
• Finding regular insertion encodings for permutation classes
• Finitely labeled generating trees and restricted permutations
• Enumeration Schemes for Restricted Permutations
• WQO is decidable for factorial languages
• Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
• Boundary properties of well-quasi-ordered sets of graphs
• Schur-positive sets of permutations via products and grid classes
• Rationality for subclasses of 321-avoiding permutations
• Grid classes and partial well order

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

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