Tag Archives: Erdos-Ko-Rado theorem

EKR, Steiner systems, association schemes, and all that

A great number of mathematical problems amount to looking in a large but highly structured graph, and finding a complete or null subgraph of largest possible size there. For a simple example, consider Latin squares of order n. One of … Continue reading

Posted in exposition | Tagged , , , , , , | Leave a comment

The synchronizing monster

Today, a long paper on synchronizing groups (108 pages), by João Araújo, Ben Steinberg, and me, appears on the arXiv. It has been a long time coming. To quote from a post of mine in 2010, I became involved in … Continue reading

Posted in exposition, history, Neill Cameron artwork | Tagged , , , , , , , , , , | 2 Comments