论文信息 - Wreath Products of Permutation Classes

Wreath Products of Permutation Classes

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.

Robert Brignall

[1] Robert Brignall,et al. Simple permutations and algebraic generating functions , 2006, J. Comb. Theory A.

[2] Miklós Bóna,et al. Combinatorics of permutations , 2022, SIGA.

[3] Julian West,et al. Generating trees and forbidden subsequences , 1996, Discret. Math..

[4] Miklós Bóna,et al. A Survey of Stack-Sorting Disciplines , 2003, Electron. J. Comb..

[5] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[6] Donald E. Knuth. The art of computer programming: fundamental algorithms , 1969 .

[7] Robert Brignall,et al. Decomposing simple permutations, with enumerative consequences , 2008, Comb..

[8] Vincent Vatter,et al. Profile Classes and Partial Well-Order for Permutations , 2002, Electron. J. Comb..

[9] Mike D. Atkinson,et al. Restricted permutations and the wreath product , 2002, Discret. Math..

[10] Mike D. Atkinson,et al. Restricted permutations , 1999, Discret. Math..

[11] Nikola Ruskuc,et al. Simple permutations: Decidability and unavoidable substructures , 2008, Theor. Comput. Sci..

[12] Maximilian M. Murphy,et al. Restricted permutations, antichains, atomic classes and stack sorting , 2003 .

[13] Nikola Ruskuc,et al. Partially Well-Ordered Closed Sets of Permutations , 2002, Order.

[14] Mike D. Atkinson,et al. Simple permutations and pattern restricted permutations , 2005, Discret. Math..