A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Algorithms for Pattern Containment in 0-1 Matrices
[article]

2017
*
arXiv
*
pre-print

We say a zero-one matrix A avoids another zero-one matrix P if no submatrix of A can be transformed to P by changing some ones to zeros. A fundamental problem is to study the extremal function ex(n,P), the maximum number of nonzero entries in an n × n zero-one matrix A which avoids P. To calculate exact values of ex(n,P) for specific values of n, we need containment algorithms which tell us whether a given n × n matrix A contains a given pattern matrix P. In this paper, we present optimal

arXiv:1704.05207v1
fatcat:mszdewacprf3hateghzpnwpnyu