Minimal overlapping patterns in colored permutations
From MaRDI portal
Recommendations
- Permutations and words counted by consecutive patterns
- Colored patterns and their packing densities
- Note on packing patterns in colored permutations
- Minimal overlapping embeddings and exact matches in words
- Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays
Cited in
(13)- Counting patterns in colored orthogonal arrays
- Consecutive up-down patterns in up-down permutations
- A Hamilton cycle in the \(k\)-sided pancake network
- A necessary condition for c-Wilf equivalence
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics
- Wilf equivalence relations for consecutive patterns
- Generalized pattern-matching conditions for C_k S_n
- Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays
- Generalized pattern avoidance condition for the wreath product of cyclic groups with symmetric groups
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
- Consecutive pattern containment and c-Wilf equivalence
- Minimal overlapping embeddings and exact matches in words
This page was built for publication: Minimal overlapping patterns in colored permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648419)
