http://cameroncounts.wordpress.com/2011/04/18/team-games-3/ always busy counting, doubting every figured guess . . . Fri, 24 May 2013 07:17:33 +0000 hourly 1 http://wordpress.com/ http://cameroncounts.wordpress.com/2011/04/18/team-games-3/#comment-2386 Thu, 21 Apr 2011 08:47:07 +0000 http://cameroncounts.wordpress.com/?p=1258#comment-2386 Perhaps I should make the Paley construction more explicit, since it is buried in the middle of a lot of other stuff. If the number of players is an odd prime p=2k+1, we number the players (and matches) from 0 to p−1; in game 0, the squares play the non-squares and player 0 sits out; and for game i, we just shift everything along by i (mod p).

]]> http://cameroncounts.wordpress.com/2011/04/18/team-games-3/#comment-2364 Mon, 18 Apr 2011 16:50:13 +0000 http://cameroncounts.wordpress.com/?p=1258#comment-2364 This time I really got more than I bargained for. It might take me the rest of my days to apply that knowledge.
This being said, thank you very much for sharing your knowledge. It’s fascinating and I will spend some time getting more familiar with this.

]]>