Search Results for: wigderson

Avi Wigderson’s: “Integrating computational modeling, algorithms, and complexity into theories of nature, marks a new scientific revolution!” (An invitation for a discussion.)

  The cover of Avi Wigderson’s book “Mathematics and computation” as was first exposed to the public in Avi’s Knuth Prize videotaped lecture. (I had trouble with 3 of the words: What is EGDE L WONK 0?  what is GCAAG?GTAACTC … Continue reading

Posted in Academics, Combinatorics, Computer Science and Optimization, Open discussion, Philosophy, What is Mathematics | Tagged | 15 Comments

Must-read book by Avi Wigderson

Originally posted on Windows On Theory:
Avi Wigderson is one of the most prolific and creative theoretical computer scientists (in fact, he is one of the most prolific and creative scientists, period). Over the last several years, Avi had worked…

Posted in Combinatorics, Computer Science and Optimization, Updates | Tagged | 3 Comments

Computer Science and its Impact on our Future

A couple weeks ago I told you about Avi Wigderson’s vision on the connections between the theory of computing and other areas of mathematics on the one hand and between computer science and other areas of science, technology and society … Continue reading

Posted in Academics, Computer Science and Optimization, Quantum, Updates | Tagged | 1 Comment

Itai Benjamini and Jeremie Brieussel: Noise Sensitivity Meets Group Theory

The final  version of my ICM 2018 paper Three puzzles on mathematics computation and games has been available for some time. (This proceedings’ version, unlike the arXived version has a full list of references.)  In this post I would like to … Continue reading

Posted in Algebra, Combinatorics, Probability | Tagged , , | 1 Comment

Amazing: Hao Huang Proved the Sensitivity Conjecture!

Today’s arXived amazing paper by Hao Huang Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture Contains an amazingly short and beautiful proof of a famous open problem from the theory of computing – the sensitivity conjecture posed … Continue reading

Posted in Combinatorics, Computer Science and Optimization | Tagged , | 21 Comments

An Invitation to a Conference: Visions in Mathematics towards 2000

Let me invite you to a conference. The conference took place in 1999 but only recently the 57 videos of the lectures and the discussion sessions are publicly available. (I thank Vitali Milman for telling me about it.) One novel … Continue reading

Posted in Conferences, What is Mathematics | Tagged | 1 Comment

PCP fest, Tel Aviv University, 18-20 December 2018

Conference web site The study of Probabilistically Checkable Proofs, starting with the discovery of the PCP Theorem, is a cornerstone of modern computer science, with impact on complexity theory, algorithms, and cryptography. Born as a purely theoretical notion, mostly used … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Conferences, Updates | Tagged | 1 Comment

Cohen, Haeupler, and Schulman: Explicit Binary Tree-Codes & Cancellations

The high-dimensional conference in Jerusalem is running with many exciting talks (and they are videotaped), and today in Tel Aviv there is a conference on Optimization and Discrete Geometry : Theory and Practice. Today in Jerusalem, Leonard Schulman talked (video available!) … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Open problems | Tagged , , , | 1 Comment

Conference on High Dimensional Combinatorics, April 22-26 2018

Conference on High Dimensional Combinatorics Conference home-page Dates: April 22-26, 2018 Place: Israel Institute for Advanced Studies, The Hebrew University of Jerusalem Organizers: Alex Lubotzky, Tali Kaufman and Oren Becker Registration form: click here Registration deadline: April 13, 2018 Combinatorics in general and the theory … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Conferences | Tagged , | 2 Comments

Serge Vlăduţ : Lattices with exponentially large kissing numbers

   (I thank Avi Wigderson for telling me about it.) Serge Vlăduţ just arxived a paper with examples of lattices in such that the kissing number is exponential in . The existence of such a lattice is a very old open … Continue reading

Posted in Combinatorics, Geometry | Tagged | 4 Comments