Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

Pattern avoidance in matrices

Kitaev, Sergey and Mansour, Toufik and Vella, Antoine (2005) Pattern avoidance in matrices. Journal of Integer Sequences, 8.

Full text not available in this repository. Request a copy from the Strathclyde author

Abstract

We generalize the concept of pattern avoidance from words to matrices, and consider specifically binary matrices avoiding the smallest non-trivial patterns. For all binary right angled patterns (0/1 subconfigurations with 3 entries, 2 in the same row and 2 in the same column) and all 2 x 2 binary patterns, we enumerate the m x n binary matrices avoiding the given pattern. For right angled patterns, and the all zeroes 2 x 2 pattern, we employ direct combinatorial considerations to obtain either explicit closed form formulas or generating functions; in the other cases, we use the transfer matrix method to derive an algorithm which gives, for any fixed m, a closed form formula in n. Some of these cases lead naturally to extremal problems of Ramsey type.