Pattern avoidance classes and subpermutations

M D  Atkinson; M M  Murphy; N  Ruskuc

Pattern avoidance classes and subpermutations

M D Atkinson, M M Murphy, N Ruskuc

Research output: Contribution to journal › Article › peer-review

Abstract

Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows that the class is almost closed under direct sums or has a rational generating function.

Original language	English
Pages (from-to)	R60
Number of pages	18
Journal	Electronic Journal of Combinatorics
Volume	12
Issue number	1
Publication status	Published - 15 Nov 2005

Keywords

stricted permutations
pattern avoidance
subpermutations
RESTRICTED PERMUTATIONS
CLOSED-SETS

Cite this

@article{1dd1185eb14f4f80a211394b65e53ad9,

title = "Pattern avoidance classes and subpermutations",

abstract = "Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows that the class is almost closed under direct sums or has a rational generating function.",

keywords = "stricted permutations, pattern avoidance, subpermutations, RESTRICTED PERMUTATIONS, CLOSED-SETS",

author = "Atkinson, {M D} and Murphy, {M M} and N Ruskuc",

year = "2005",

month = nov,

day = "15",

language = "English",

volume = "12",

pages = "R60",

journal = "Electronic Journal of Combinatorics",

issn = "1097-1440",

publisher = "Electronic Journal of Combinatorics",

number = "1",

}

TY - JOUR

T1 - Pattern avoidance classes and subpermutations

AU - Atkinson, M D

AU - Murphy, M M

AU - Ruskuc, N

PY - 2005/11/15

Y1 - 2005/11/15

N2 - Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows that the class is almost closed under direct sums or has a rational generating function.

AB - Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows that the class is almost closed under direct sums or has a rational generating function.

KW - stricted permutations

KW - pattern avoidance

KW - subpermutations

KW - RESTRICTED PERMUTATIONS

KW - CLOSED-SETS

UR - http://www.scopus.com/inward/record.url?scp=27844438623&partnerID=8YFLogxK

UR - http://www.combinatorics.org/Volume_12/PDF/v12i1r60.pdf

M3 - Article

SN - 1097-1440

VL - 12

SP - R60

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1

ER -

Pattern avoidance classes and subpermutations

Abstract

Keywords

Other files and links

Fingerprint

EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications

Cite this

Pattern avoidance classes and subpermutations

Abstract

Keywords

Other files and links

Fingerprint

Projects

EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications

Cite this