Pattern avoidance in coloured permutations

zbMath0986.05004MaRDI QIDQ5948366

Toufik Mansour

Publication date: 7 January 2002

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121817

zbMATH Keywords

colored permutationshyperoctohedral grouppattern avoidance in the symmetric groupWilf class

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (8)

Labelled well-quasi-order for permutation classes ⋮ Patterns in colored circular permutations ⋮ Restricted colored permutations and Chebyshev polynomials ⋮ Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality ⋮ Generalized pattern-matching conditions for \(C_k \wr S_n\) ⋮ Generalized pattern avoidance condition for the wreath product of cyclic groups with symmetric groups ⋮ Inversion generating functions for signed pattern avoiding permutations ⋮ A Hamilton cycle in the \(k\)-sided pancake network

This page was built for publication: Pattern avoidance in coloured permutations