Category Archives: Computer Science and Optimization

Two Important Quantum Announcements!

I am very happy to announce two quantum events. First, I would like to announce a course “Computation, quantization, symplectic geometry, and information” in the first 2019/2020 semester  at the Hebrew University of Jerusalem (HUJI). The course will by on … Continue reading

Posted in Computer Science and Optimization, Conferences, Quantum, Teaching | Tagged , , , , | 7 Comments

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 | 12 Comments

An interview with Noga Alon

Update: and here is a great interview of Noga in English and the interviewer is Narkis Alon, Noga’s youngest daughter and Amalya Duek. I was very happy to interview my academic doctoral  twin and long-time friend Noga Alon.  The interview … Continue reading

Posted in Combinatorics, Computer Science and Optimization, People | Tagged | 6 Comments

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

Danny Nguyen and Igor Pak: Presburger Arithmetic Problem Solved!

Short Presburger arithmetic is hard! This is a belated report on a remarkable breakthrough from 2017. The paper is Short Presburger arithmetic is hard, by Nguyen and Pak. Danny Nguyen Integer programming in bounded dimension: Lenstra’s Theorem Algorithmic tasks are … Continue reading

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

Bob Sedgewick’s Free Online Courses on Analysis of Algorithms and Analytic Combinatorics.

Philippe Flajolet 1948-2011   I am  happy to forward the announcement on two free online courses (Mooks) by Bob Sedgewick  Analysis of Algorithms and Analytic Combinatorics. Analysis of Algorithms  page provides access to online lectures, lecture slides, and assignments for … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Teaching, Updates | Tagged , | Leave a comment

Jean

Jean Bourgain and Joram Lindenstrauss. I was very sad to hear that Jean Bourgain, among the greatest mathematicians of our time, and a dear friend, passed away.  I first met Jean about forty years ago and later we  became friends … Continue reading

Posted in Analysis, Combinatorics, Computer Science and Optimization, Convexity, Number theory, Obituary | Tagged | 4 Comments

Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant Solved the Mihail-Vazirani Conjecture for Matroids!

  Milena Mihail and Umesh Vazirani I thank Nati Linial, Dan Spielman and Karim Adiprasito for sharing the news with me. The Mihail-Vazirani conjecture for matroids and Feder-Mihail’s theorem Consider a collection of vectors. A basis is a subset of … Continue reading

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

Igor Pak will give the 2018 Erdős Lectures

  Next week Igor Pak will give the 2018 Erdős Lectures (delayed from June) Here is the poster   Combinatorics — Erdos lecture: Igor Pak (UCLA) “Counting linear extensions” Monday December 10  11:00-13:00 Location:  IIAS Hall 130, Feldman building,  Givat Ram     … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Updates | Tagged , , | Leave a 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