József Beck

From Wikipedia, the free encyclopedia

József Beck is a professor of mathematics at Rutgers University.

His contributions to combinatorics include the partial colouring lemma and the Beck-Fiala theorem in discrepancy theory, the algorithmic version of the Lovász local lemma, the two extremities theorem in combinatorial geometry and the second moment method in the theory of positional games, among others.

Beck was awarded the Fulkerson Prize in 1985 for a paper titled "Roth's estimate of the discrepancy of integer sequences is nearly sharp", which introduced the notion of discrepancy on hypergraphs and established an upper bound on the discrepancy of the family of arithmetic progressions contained in {1,2,...,n}, matching the classical lower bound up to a polylogarithmic factor. Jiří Matoušek and Joel Spencer later succeeded in getting rid of this factor, showing that the bound was really sharp.

His new book Tic-Tac-Toe Theory will be published later this year (2007) by Cambridge University Press.