Mathematical Sciences PhD Student Queen Mary, University of London 2010-01-25 G.3.33 All of the currently known methods of generating a random Steiner Triple System of order n(STS(n)), such as hill-climbing, do not do so uniformly across the whole space. We will discuss a Markov chain which finds (approximately) uniformly distributed random Latin squares and how it might transfer to STS(n)s and other designs. |