Partially Well-Ordered Closed Sets of Permutations

No abstract is available for this paper.

• Publication year

  2002

• Venue

  Order

• Publication date

  2002-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1023/A:1016500300436
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Restricted permutations and the wreath product

  2002cited by this paper
• Restricted permutations

  1999cited by this paper
• Permutations which are the Union of an Increasing and a Decreasing Subsequence

  1998cited by this paper
• Generalized Stack Permutations

  1998cited by this paper
• An Infinite Antichain of Permutations

  1998cited by this paper
• Classification of Forbidden Subsequences of Length 4

  1996cited by this paper
• Generating trees and forbidden subsequences

  1996cited by this paper
• Forbidden subsequences

  1994cited by this paper
• Pattern Matching for Permutations

  1993cited by this paper
• Bootstrap Percolation, the Schröder Numbers, and the N-Kings Problem

  1991cited by this paper
• Criterion for smoothness of Schubert varieties in Sl(n)/B

  1990cited by this paper
• Basic Techniques of Combinatorial Theory

  1980cited by this paper
• Computing permutations with double-ended queues, parallel stacks and parallel queues

  1973cited by this paper
• Sorting Using Networks of Queues and Stacks

  1972cited by this paper
• Ordering by Divisibility in Abstract Algebras

  1952cited by this paper

• Labelled Well-Quasi-Order in Juxtapositions of Permutation Classes

  2023cites this paper
• Understanding lettericity I: a structural hierarchy

  2021cites this paper
• Labelled well-quasi-order for permutation classes

  2021influential citation
• A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes

  2020cites this paper
• C O ] 1 J an 2 01 9 Rationality For Subclasses of 321-Avoiding Permutations

  2019cites this paper
• Orderings on words and permutations

  2019cites this paper
• Growth rates for subclasses of Av ( 321 ) Journal Item

  2018cites this paper
• C O ] 4 D ec 2 01 7 Rationality For Subclasses of 321-Avoiding Permutations

  2018cites this paper
• WQO is decidable for factorial languages

  2017cites this paper
• Unsplittable Classes of Separable Permutations

  2016cites this paper
• Rationality for subclasses of 321-avoiding permutations

  2016cites this paper
• Growth rates of permutation classes: from countable to uncountable

  2016influential citation
• Enumeration of cyclic permutations in vector grid classes

  2016cites this paper
• Schur-positive sets of permutations via products and grid classes

  2016cites this paper
• Well-quasi-ordering of combinatorial structures

  2015cites this paper
• Schur-positive sets of permutations via products and grid classes

  2015cites this paper
• Well quasi-order in combinatorics: embeddings and homomorphisms

  2015cites this paper
• On the growth of permutation classes

  2015cites this paper
• Permutation classes

  2014influential citation
• Boundary Properties of Well-Quasi-Ordered Sets of Graphs

  2013cites this paper
• Cyclic permutations realized by signed shifts

  2013cites this paper
• A stack and pop stack in series

  2013cites this paper
• Splittings and Ramsey Properties of Permutation Classes

  2013cites this paper
• Deciding WQO for Factorial Languages

  2013cites this paper
• Bruhat graphs and pattern avoidance

  2011cites this paper
• Forbidden substructures and combinatorial dichotomies: WQO and universality

  2011cites this paper
• UBCLASSES OF THE S EPARABLE P ERMUTATIONS

  2011cites this paper
• Enumeration of Pin-Permutations

  2011cites this paper
• Simple permutations of the classes Av(321, 13524) and Av(321, 13452) have polynomial growth

  2011cites this paper
• Geometric grid classes of permutations

  2011influential citation
• Simple permutations of the classes Av(321, 3412) and Av(321, 4123) have polynomial growth

  2011cites this paper
• Embedding dualities for set partitions and for relational structures

  2011cites this paper
• Anti hains of Combinatorial Stru turesCase for Support Robert Brignall Previous

  2011cites this paper
• Subclasses of the separable permutations

  2010cites this paper
• Quelques problèmes combinatoires et algorithmiques sur les classes de permutations

  2009cites this paper
• Finding regular insertion encodings for permutation classes

  2009influential citation
• Growth Rates for Subclasses of Av(321)

  2009cites this paper
• Grid classes and partial well order

  2009cites this paper
• C O ] 1 4 M ar 2 00 6 Permutation Classes of Polynomial Growth

  2008cites this paper
• Posets and permutations in the duplication-loss model: Minimal permutations with d descents

  2008cites this paper
• Pattern classes of permutations via bijections between linearly ordered sets

  2008cites this paper
• On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects

  2007influential citation
• SIMPLICITY IN RELATIONAL STRUCTURES AND ITS APPLICATION TO PERMUTATION CLASSES

  2007influential citation
• Compositions of pattern restricted sets of permutations

  2007cites this paper
• On Permutation Classes Defined by Token Passing Networks, Gridding Matrices and Pictures: Three Flavours of Involvement

  2007cites this paper
• Small permutation classes

  2007influential citation
• Wreath Products of Permutation Classes

  2006cites this paper
• Permutation Classes of Polynomial Growth

  2006cites this paper
• Simple permutations: Decidability and unavoidable substructures

  2006cites this paper
• Grid Classes and the Fibonacci Dichotomy for Restricted Permutations

  2006cites this paper
• Simple permutations and pattern restricted permutations

  2005cites this paper
• Enumeration Schemes for Restricted Permutations

  2005cites this paper
• Enumerative and structural applications of profile classes

  2004cites this paper
• Pattern Avoidance Classes and Subpermutations

  2004cites this paper
• Permutations Avoiding Two Patterns of Length Three

  2003cites this paper
• On Growth Rates of Closed Permutation Classes

  2003cites this paper
• Finitely labeled generating trees and restricted permutations

  2003cites this paper
• Irreducible and connected permutations

  2003influential citation
• Profile Classes and Partial Well-Order for Permutations

  2003influential citation
• On the least exponential growth admitting uncountably many closed permutation classes

  2003influential citation
• Regular closed sets of permutations

  2003influential citation
• Combinatorial Laplacian of the Matching Complex

  2002influential citation
• Regular closed classes of permutations

  2002cites this paper
• Australasian Journal of Combinatorics

  2001cites this paper
• List of Participants

  1999cites this paper