Gil Kalai

Gil Kalai is the Henry and Manya Noskwith Professor of Mathematics at the Hebrew University of Jerusalem, an adjunct professor of mathematics and of computer science at Yale University, and the editor of the "Israel Journal of Mathematics". He received his Ph.D. from Hebrew University in 1983, under the supervision of Micha Perles, [MathGenealogy|name=Gil Kalai|id=62336.] and joined the Hebrew University faculty in 1985 after a postdoctoral fellowship at the Massachusetts Institute of Technology. [http://www.win.tue.nl/math/eidma/courses/minicourses/kalai/MC-DAG-7.html Profile at the Technical University of Eindhoven] as an instructor of a minicourse on polyhedral combinatorics.] He was the recipient of the Pólya Prize in 1992, the Erdős Prize of the Israel Mathematical Society in 1993, and the Fulkerson Prize in 1994. [http://www.cs.yale.edu/people/kalai.html Profile at Yale CS department] .] He is known for finding variants of the simplex algorithm in linear programming that can be proven to run in subexponential time, [citation|first=Gil|last=Kalai|contribution=A subexponential randomized simplex algorithm|title=Proc. 24th ACM Symp. Theory of Computing (STOC 1992)|year=1992|pages=475–482.] for showing that every monotone property of graphs has a sharp phase transition, [citation|first1=Ehud|last1=Friedgut|first2=Gil|last2=Kalai|title=Every monotone graph property has a sharp threshold|journal=Proceedings of the American Mathematical Society|volume=124|year=1996|pages=2993–3002|url=http://www.ams.org/proc/1996-124-10/S0002-9939-96-03732-X/.] for disproving Borsuk's conjecture on the number of pieces needed to partition convex sets into subsets of smaller diameter, [citation|first1=Jeff|last1=Kahn|first2=Gil|last2=Kalai|id=arxiv|math.MG|9307229|title=A counterexample to Borsuk's conjecture|journal=Bulletin of the American Mathematical Society|volume=29|year=1993|pages=60–62.] and for his work on the Hirsch conjecture on the diameter of convex polytopes and in polyhedral combinatorics more generally.citation|first1=Gil|last1=Kalai|first2=Daniel J.|last2=Kleitman|authorlink2=Daniel Kleitman|title=A quasi-polynomial bound for the diameter of graphs of polyhedra|journal=Bulletin of the American Mathematical Society|volume=26|year=1992|pages=315–316|url=http://www.ams.org/bull/1992-26-02/S0273-0979-1992-00285-9/.]

References

External links

* [http://www.ma.huji.ac.il/~kalai/ Kalai's home page] at Hebrew University
* [http://gilkalai.wordpress.com/ Combinatorics and more] , Kalai's blog