Enumerating polynomial colored permutation classes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- A Hamilton cycle in the \(k\)-sided pancake network
- A group-theoretic model for symmetric interconnection networks
- An Algorithm to Enumerate Grid Signed Permutation Classes
- Coloured permutations containing and avoiding certain patterns
- Combinatorics of genome rearrangements.
- Cycles in the burnt pancake graph
- Enumeration of Wilf classes in S_n o C_r for two patterns of length 3
- Geometric grid classes of permutations
- Grid classes and the Fibonacci dichotomy for restricted permutations
- Lengths of cycles in generalized pancake graphs
- On growth rates of closed permutation classes
- On the effective and automatic enumeration of polynomial permutation classes
- On the embedding of cycles in pancake graphs
- On the number of pancake stacks requiring four flips to be sorted
- Pattern avoidance in coloured permutations
- Permutation classes
- Permutation statistics of indexed permutations
- Restricted colored permutations and Chebyshev polynomials
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
This page was built for publication: Enumerating polynomial colored permutation classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033534)
