Gil Kalai

Gil Kalai (Hebrew גיל קלעי; born 1955 in Tel Aviv) is an Israeli mathematician and computer scientist who deals with algorithms such as linear programming and combinatorics.

Kalai received his doctorate in 1983 at the Hebrew University in Micha Perles and was then as a post- doctoral fellow at the Massachusetts Institute of Technology. From 1985 he was at the Hebrew University, where he received a full professorship in 1993. He is also an adjunct professor of computer science and mathematics at Yale University. In 1994 he was Milliman Lecturer at the University of Washington. He has been a visiting scientist and visiting professor at the Institute for Advanced Study (1995) and at IBM in San Jose (1991 /92).

He is the editor of the Israel Journal of Mathematics. In 1992 he was awarded the Pólya Prize of the SIAM, 1993 Erdös Award of the Israeli Mathematical Society, 1994 Fulkerson Prize. In 1994 he was invited speaker at the International Congress of Mathematicians in Zurich ( Combinatorics and convexity ).

Kalai is known that he found variants of the simplex algorithm that run in sub-exponential time .. With Ehud Friedgut he proved in 1996 that every monotone property of graphs a sharp phase transition has ( when varying the size of the graph, the number of nodes ) .. in 1993, he refuted with Jeff Kahn a conjecture of Karol Borsuk on the number of parts f (d) (as a function of the dimension d), which are necessary to decompose the convex sets into subsets of smaller diameter .. Borsuk conjectured, Kalai and Kahn proved for large.

The conjecture of Kalai says that any d-dimensional centrally symmetric polytope least sides (where corners edges, sides ... and the whole polytope is counted as a page ). For example, applies in d = 2 for the parallelogram and the cube in d = third The general case is open ( in 4 and less Dimnensionen is proved for simplicial polytopes and there ).