Skip to content

Research at St Andrews

Pattern classes of permutations via bijections between linearly ordered sets

Research output: Contribution to journalArticlepeer-review

Abstract

A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e. indecomposable as a union of proper subclasses, has a representation as the set of subpermutations of a bijection between two countable (or finite) linearly ordered sets A and B. Concentrating on the situation where A is arbitrary and B = N, we demonstrate how the order-theoretic properties of A determine the structure of X and we establish results about independence, contiguousness and subrepresentations for classes admitting multiple representations of this form.

Close

Details

Original languageEnglish
Pages (from-to)118-139
Number of pages22
JournalEuropean Journal of Combinatorics
Volume29
Issue number1
Early online date20 Jan 2007
DOIs
Publication statusPublished - Jan 2008

    Research areas

  • Restricted permutations

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. On well quasi-order of graph classes under homomorphic image orderings

    Huczynska, S. & Ruškuc, N., Jun 2017, In: European Journal of Combinatorics. 63, p. 164-175 12 p.

    Research output: Contribution to journalArticlepeer-review

  2. Homomorphic image orders on combinatorial structures

    Huczynska, S. & Ruskuc, N., Jul 2015, In: Order. 32, 2, p. 205-226 22 p.

    Research output: Contribution to journalArticlepeer-review

  3. Well quasi-order in combinatorics: embeddings and homomorphisms

    Huczynska, S. & Ruskuc, N., Jul 2015, Surveys in Combinatorics 2015. Czumaj et al., A. (ed.). Cambridge: Cambridge University Press, p. 261-293 (London Mathematical Society Lecture Note Series; no. 424).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  4. On separability properties in direct products of semigroups

    O'Reilly, G. A., Quick, M. & Ruskuc, N., 27 May 2021, In: Monatshefte für Mathematik. First Online, 21 p.

    Research output: Contribution to journalArticlepeer-review

  5. Congruences on infinite partition and partial Brauer monoids

    East, J. & Ruskuc, N., 9 May 2021, (Accepted/In press) In: Moscow Mathematical Journal.

    Research output: Contribution to journalArticlepeer-review

Related by journal

  1. Smallest cyclically covering subspaces of Fqn, and lower bounds in Isbell's conjecture

    Cameron, P. J., Ellis, D. & Raynaud, W., Oct 2019, In: European Journal of Combinatorics. 81, p. 242-255

    Research output: Contribution to journalArticlepeer-review

  2. Permutation monoids and MB-homogeneity for graphs and relational structures

    Coleman, T. D. H., Gray, R. & Evans, D., May 2019, In: European Journal of Combinatorics. 78, p. 163-189

    Research output: Contribution to journalArticlepeer-review

  3. Rationality for subclasses of 321-avoiding permutations

    Albert, M. H., Brignall, R., Ruskuc, N. & Vatter, V., May 2019, In: European Journal of Combinatorics. 78, p. 44-72

    Research output: Contribution to journalArticlepeer-review

  4. On well quasi-order of graph classes under homomorphic image orderings

    Huczynska, S. & Ruškuc, N., Jun 2017, In: European Journal of Combinatorics. 63, p. 164-175 12 p.

    Research output: Contribution to journalArticlepeer-review

  5. Countable locally 2-arc-transitive bipartite graphs

    Gray, R. D. & Truss, J. K., Jul 2014, In: European Journal of Combinatorics. 39, p. 122-147 26 p.

    Research output: Contribution to journalArticlepeer-review

ID: 253771

Top