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

DOI10.1155/2013/806583zbMath1266.68103arXiv0910.3135OpenAlexW2072515363WikidataQ58999454 ScholiaQ58999454MaRDI QIDQ1952733

Sergey Kitaev, Manda Riehl, Jeffery B. Remmel

Publication date: 3 June 2013

Published in: ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.3135

zbMATH Keywords

pattern-matching conditions

Mathematics Subject Classification ID

Searching and sorting (68P10) Symmetric functions and generalizations (05E05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Symmetric groups (20B30)

Cites Work

• Minimal overlapping patterns in colored permutations
• Permutations and words counted by consecutive patterns
• Restricted colored permutations and Chebyshev polynomials
• Brick tabloids and the connection matrices between bases of symmetric functions
• Avoiding 2-letter signed patterns
• Coloured permutations containing and avoiding certain patterns
• Generalized pattern-matching conditions for \(C_k \wr S_n\)
• Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
• Pattern avoidance in coloured permutations
• Unnamed Item