Richard Anstee

PDMW is an annual regional meeting of researchers in pure and applied combinatorics and discrete mathematics. Topics include enumeration, coding theory, graph theory, design theory, computational discrete mathematics, and associated applications...

Let F be a kxl (0,1)-matrix. We say that a (0,1)-matrix A has F as a `configuration' if some row and column permutation of F is a submatrix of A. We are interested in `simple' matrices, namely (0,1)-matrices with no repeated columns. If A is a simple...

Abstract: Problems in extremal set theory take the form of determining the maximum number of subsets of {1,2, ..., m } you can choose so that the resulting family of subsets has some property. The property I will consider is a trace being forbidden...

I would like to report some advances made while on sabbatical in South Carolina working with Lincoln Lu. These are problems of extremal combinatorics in the area of Forbidden Configurations. We first crack an `old chestnut' that had been around since...

We say that a matrix F is a configuration in a matrix A if there is a submatrix of A which is a row and column permutation of F. We consider the following extremal function. Let G be a finite set of (0,1)-matrices. Let forb(m,G) denote the maximum...

A collection of ten talks on topics in discrete mathematics and theoretical computer science by speakers from universities in BC and the surrounding regions.

This is joint work with Jeffrey Dawson, Linyuan Lu and Attila Sali. We define simple matrices as those whose entries are chosen from {0,1,2} and for which no columns are repeated. We consider the extremal problem of how many columns can an m-rowed...