Title

Pattern avoidance in the rook monoid

Document Type

Article

Publication Date

2014

Abstract

We consider two types of pattern avoidance in the rook monoid, i.e. the set of 0–1 square matrices with at most one nonzero entry in each row and each column. For one-dimensional rook patterns, we completely characterize monoid elements avoiding a single pattern of length at most three and develop an enumeration scheme algorithm to study rook placements avoiding sets of patterns.

Link to Full Text

Share

COinS