Wreath Products of Permutation Classes

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.

14 pages

References in corpus (2)

• Simple permutations: decidability and unavoidable substructures
• Simple permutations and algebraic generating functions