Tag Archives: switching

ACCMCC, Days 4 and 5

Posted on 12/12/2015 by Peter Cameron

Penny Haxell opened proceedings on Thursday with her astonishing work with Ron Aharoni. They give a sufficient condition for a tripartite 3-uniform hypergraph (one whose vertex set is partitioned into three parts so that each hyperedge contains one vertex from … Continue reading →

Posted in events | Tagged , , , , , , | 1 Comment

Carries, shuffling, and cocycles

Posted on 20/09/2013 by Peter Cameron

Last week we were treated to a lovely lecture by Persi Diaconis. As he so often does, he started with an elementary question: how many carries do you expect if you add n numbers in base b? From there he … Continue reading →

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

The Graph Extension Theorem

Posted on 03/02/2013 by Peter Cameron

I made some notes on the Graph Extension Theorem for a new research project. They may be of wider interest, so here is a summary. Shult’s Graph Extension Theorem is a simple device for showing that certain permutation groups have … Continue reading →

Posted in exposition | Tagged , , , , , | 4 Comments