Recent Comments
Tag Archives: Greg Kuperberg
Greg Kuperberg: It is in NP to Tell if a Knot is Knotted! (under GRH!)
Wolfgang Haken found an algorithm to tell if a knot is trivial, and, more generally with Hemion, if two knots are equivalent. Joel Hass, Jeff Lagarias and Nick Pippinger proved in 1999 that telling that a knot is unknotted is … Continue reading
Fractional Sylvester-Gallai
Avi Wigderson was in town and gave a beautiful talk about an extension of Sylvester-Gallai theorem. Here is a link to the paper: Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes by Boaz Barak, Zeev … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Geometry
Tagged Avi Wigderson, Codes, Greg Kuperberg, Sylvester-Gallai
2 Comments
Greg’s Dinosaurs Riddle
The two-riddles post was a success, and while corresponding with Greg Kuperberg he had a riddle for me about dinosaurs, and he agreed I will share it with you. Right before the Chixculub asteroid hit the earth, there were a … Continue reading
Combinatorics, Mathematics, Academics, Polemics, …
1. About: My name is Gil Kalai and I am a mathematician working mainly in the field of Combinatorics. Within combinatorics, I work mainly on geometric combinatorics and the study of convex polytopes and related objects, and on the analysis of Boolean functions … Continue reading
Combinatorics and more 