Consecutive Patterns: From Permutations to Column-Convex Polyominoes and Back

Don Rawlings, California Polytechnic State University - San Luis Obispo
Mark Tiefenbruck, University of California - San Diego

Article comments

33 pages.

Copyright © 2010 Don Rawlings and Mark Tiefenbruck. Published by Electronic Journal of Combinatorics.

Abstract

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.