Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematician

Gil Kalai

Modern

Gil Kalai, born in Tel Aviv in 1955, is an Israeli mathematician and computer scientist who is Henry and Manya Noskwith Professor Emeritus of Mathematics at the Hebrew University of Jerusalem, with positions at Reichman University in Herzliya and at Yale. He took his doctorate at the Hebrew University in 1983 under Micha Perles. He is known for variants of the simplex algorithm that provably run in subexponential time, for showing that monotone graph properties have sharp phase transitions, for his work on Borsuk's problem and the Hirsch conjecture, and more broadly for polyhedral combinatorics. He is also a prominent skeptic of large-scale quantum computing and has set out his arguments as a series of conjectures. His honors include the Polya Prize, the Erdos Prize, the Fulkerson Prize, the Rothschild Prize and election as a Fellow of the American Mathematical Society.

Facts
Biography
Gender
Male 1
Birth Year
1955 1
Connections

Conjectures Posed

Source Kahn-Kalai Conjecture (Wikipedia)
Source Kalai's 3^d Conjecture, Wikipedia

In Branch

Source Gil Kalai (Wikipedia)

Mentored By

Source Gil Kalai (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Gil Kalai (Wikipedia)Lead, nationality / culture
Quote, Lead, nationality / culture
is an Israeli mathematician
Sources
1. Gil Kalai (Wikipedia)
  • Lead
    born 1955
  • Lead, gender
    He is the Henry and Manya Noskwith Professor Emeritus
  • Lead, nationality / culture
    is an Israeli mathematician
  • In Branch: Combinatorics, Recognition
    for contributions to combinatorics, convexity, and their applications
  • Mentored By: Micha Perles, Biography
    advised by Micha Perles
View the Source
Kahn-Kalai Conjecture (Wikipedia)
Conjectures Posed: Kahn-Kalai Conjecture, Lead sentence
Quote, Conjectures Posed: Kahn-Kalai Conjecture, Lead sentence
The Kahn-Kalai conjecture, also known as the expectation threshold conjecture or more recently the Park-Pham Theorem, was a conjecture in the field of graph theory and statistical mechanics, proposed by Jeff Kahn and Gil Kalai in 2006.
View the Source
Kalai's 3^d Conjecture, Wikipedia
Conjectures Posed: Kalai's 3^d Conjecture, Lead sentence
Quote, Conjectures Posed: Kalai's 3^d Conjecture, Lead sentence
In geometry, more specifically in polytope theory, Kalai's 3d conjecture is a conjecture on the polyhedral combinatorics of centrally symmetric polytopes, made by Gil Kalai in 1989.
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.