Nathan Karst
  • Home
  • Teaching
  • Research

Major progress on Steiner systems

1/17/2014

0 Comments

 
As reported by Gil Kalai, some major progress has been made on Steiner systems. The question is: can you find a collection of subsets , each with size $k$, drawn from an ambient set of size $n$, such that each each subset of size $r \leq k$ appears in exactly $\lambda$ subsets in the collection? These designs have a special place in my heart; my thesis work centered on applying them to dynamic rekeying in smart grid systems.

This is problem has been more or less completely open for over 150 years. There have been some good results for $r =2$ and sporadic constructions for $r \geq 3$. Evidently Peter Keevash has cracked the problem wide open by solving the case of general $q$ and $r$. I'm not sure that anyone saw this sort of generalized construction coming. What's more, it seems that there is a new probabilistic construction technique at the heart of the proof. Incredible!
0 Comments



Leave a Reply.

    Archives

    June 2015
    May 2015
    February 2015
    December 2014
    October 2014
    September 2014
    August 2014
    July 2014
    May 2014
    March 2014
    February 2014
    January 2014
    December 2013
    October 2013
    July 2013
    June 2013
    May 2013
    April 2013
    March 2013
    February 2013
    January 2013

    Nathan Karst

    Doing and teaching mathematics. 

    Categories

    All

    RSS Feed

Powered by Create your own unique website with customizable templates.
Photo from ByoLogyc