Wreath products of permutation classes
From MaRDI portal
Publication:2372890
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.
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)- Inflations of geometric grid classes of permutations
- Wreath decompositions of finite permutation groups
- Restricted permutations and the wreath product
- Labelled well-quasi-order for permutation classes
- Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
- Substitution-closed pattern classes
- Splittings and Ramsey properties of permutation classes
- Generating numbers for wreath products
- Wreath products of ordered permutation groups
- scientific article; zbMATH DE number 4158945 (Why is no real title available?)
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)