Generalized pattern avoidance condition for the wreath product of cyclic groups with symmetric groups

Sergey Kitaev, Jeffrey Remmel, Manda Riehl

Research output: Contribution to journalArticlepeer-review

23 Downloads (Pure)


We continue the study of the generalized pattern avoidance condition for Ck ≀ Sn, the wreath product of the cyclic group Ck with the symmetric group Sn, initiated in the work by Kitaev et al., In press. Among our results, there are a number of (multivariable) generating functions both for consecutive and nonconsecutive patterns, as well as a bijective proof for a new sequence counted by the Catalan numbers.
Original languageEnglish
Article number806583
Number of pages17
JournalISRN Combinatorics
Publication statusPublished - 2013


  • generalised pattern avoidance
  • cyclic groups
  • Catalan numbers
  • bijection

Cite this