Wreath products of permutation classes

MaRDI QIDQ2372890zbMATH OpenFDO

Authors Robert Brignall

Publication date 16 July 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0609788, https://eudml.org/doc/127945, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r46.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

pattern avoidancepin sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)

Abstract: A permutation class which is closed under pattern involvement may be described in terms of its basis. The wreath product construction X wr Y of two permutation classes X and Y is also closed, and we investigate classes Y with the property that, for any finitely based class X, the wreath product X wr Y is also finitely based.

Review text

Summary: A permutation class which is closed under pattern involvement may be described in terms of its basis. The wreath product construction \(X\wr Y\) of two permutation classes \(X\) and \(Y\) is also closed, and we exhibit a family of classes \(Y\) with the property that, for any finitely based class \(X\), the wreath product \(X\wr Y\) is also finitely based. Additionally, we indicate a general construction for basis elements in the case where \(X\wr Y\) is not finitely based.

Recommendations

• Restricted permutations and the wreath product
• Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
• scientific article; zbMATH DE number 3953071
• Wreath products of the groups of monotone permutations
• Compositions of pattern restricted sets of permutations

Cited in

(10)

• Restricted permutations and the wreath product
• Generating numbers for wreath products
• Inflations of geometric grid classes of permutations
• Wreath products of ordered permutation groups
• Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
• scientific article; zbMATH DE number 4158945 (Why is no real title available?)
• Wreath decompositions of finite permutation groups
• Splittings and Ramsey properties of permutation classes
• Labelled well-quasi-order for permutation classes
• Substitution-closed pattern classes

This page was built for publication: Wreath products of permutation classes

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