Tag Archives: Greg Kuperberg

Quantum computing: achievable reality or unrealistic dream

Posted on January 10, 2015 by

  Michel Dyakonov’s View on QC                                     My view (based on Michel’s drawing*) Update: Alexander Vlasov’s view (based on Michel and Konstantin’s drawing) … Continue reading →

Posted in Quantum | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 7 Comments

Greg Kuperberg: It is in NP to Tell if a Knot is Knotted! (under GRH!)

Posted on April 10, 2012 by

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 →

Posted in Computer Science and Optimization, Geometry | Tagged | 8 Comments

Fractional Sylvester-Gallai

Posted on January 20, 2012 by

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 , , , | 4 Comments

Combinatorics, Mathematics, Academics, Polemics, …

Posted on April 29, 2008 by

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 →

Posted in Blogging, Combinatorics, Controversies and debates, Open problems | Tagged , , , , , , , , , , , | 13 Comments