Consecutive patterns: from permutations to column-convex polyominoes and back
From MaRDI portal
Publication:976712
Summary: We expose the ties between the consecutive pattern enumeration problems associated with permutations, compositions, column-convex polyominoes, and words. Our perspective allows powerful methods from the contexts of compositions, column-convex polyominoes, and of words to be applied directly to the enumeration of permutations by consecutive patterns. We deduce a host of new consecutive pattern results, including a solution to the \((2m+1)\)-alternating pattern problem on permutations posed by Kitaev.
Recommendations
- A survey of consecutive patterns in permutations
- Consecutive patterns in restricted permutations and involutions
- On the enumeration of column-convex permutominoes
- A perimeter enumeration of column-convex polyominoes
- Directed column-convex polyominoes by recurrence relations
- scientific article; zbMATH DE number 7058688
- Consecutive patterns in permutations
- The combinatorics of convex permutominoes
- A combinatorial method for the enumeration of column-convex polyominoes
Cited in
(6)- \((a, b)\)-rectangle patterns in permutations and words
- A survey of consecutive patterns in permutations
- Consecutive up-down patterns in up-down permutations
- The feasible region for consecutive patterns of permutations is a cycle polytope
- Consecutive patterns in Coxeter groups
- Refined consecutive pattern enumeration via a generalized cluster method
This page was built for publication: Consecutive patterns: from permutations to column-convex polyominoes and back
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976712)
