Recent Comments
-
Recent Posts
- Peter Cameron: Doing research
- To cheer you up in difficult times 18: Beautiful drawings by Neta Kalai for my book: “Gina Says”
- Amazing: Simpler and more general proofs for the g-theorem by Stavros Argyrios Papadakis and Vasiliki Petrotou, and by Karim Adiprasito, Stavros Argyrios Papadakis, and Vasiliki Petrotou.
- Igor Pak: What if they are all wrong?
- To cheer you up in difficult times 17: Amazing! The Erdős-Faber-Lovász conjecture (for large n) was proved by Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus!
- Open problem session of HUJI-COMBSEM: Problem #5, Gil Kalai – the 3ᵈ problem
- To cheer you up in difficult times 16: Optimism, two quotes
- The Argument Against Quantum Computers – A Very Short Introduction
- Open problem session of HUJI-COMBSEM: Problem #4, Eitan Bachmat: Weighted Statistics for Permutations
Top Posts & Pages
- Peter Cameron: Doing research
- TYI 30: Expected number of Dice throws
- Amazing: Simpler and more general proofs for the g-theorem by Stavros Argyrios Papadakis and Vasiliki Petrotou, and by Karim Adiprasito, Stavros Argyrios Papadakis, and Vasiliki Petrotou.
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Igor Pak: What if they are all wrong?
- Chomskian Linguistics
- The Argument Against Quantum Computers - A Very Short Introduction
- To cheer you up in difficult times 18: Beautiful drawings by Neta Kalai for my book: "Gina Says"
- Dan Romik on the Riemann zeta function
RSS
Category Archives: Computer Science and Optimization
Igor Pak: What if they are all wrong?
Originally posted on Igor Pak's blog:
Conjectures are a staple of mathematics. They are everywhere, permeating every area, subarea and subsubarea. They are diverse enough to avoid a single general adjective. They come in al shapes and sizes. Some…
Posted in Combinatorics, Computer Science and Optimization, Geometry, What is Mathematics
Tagged Igor Pak
5 Comments
Open problem session of HUJI-COMBSEM: Problem #5, Gil Kalai – the 3ᵈ problem
This post continues to describe problems presented at our open problems session back in November 2020. Here is the first post in the series. Today’s problem was presented by me, and it was an old 1989 conjecture of mine. A … Continue reading
The Argument Against Quantum Computers – A Very Short Introduction
Left: Gowers’s book Mathematics a very short introduction. Right C. elegans; Boson Sampling can be seen as the C. elegans of quantum computing. (See, this paper.) Update (January 6, 2021): Tomorrow January, 7, 8:30 AM Israel time, I give a … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Physics, Probability, Quantum
Tagged Guy Kindler, quantum supremacy
7 Comments
To Cheer You Up in Difficult Times 15: Yuansi Chen Achieved a Major Breakthrough on Bourgain’s Slicing Problem and the Kannan, Lovász and Simonovits Conjecture
This post gives some background to a recent amazing breakthrough paper: An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture by Yuansi Chen. Congratulations Yuansi! The news Yuansi Chen gave an almost constant bounds for Bourgain’s … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Convexity, Geometry
Tagged Yuansi Chen
2 Comments
Open problem session of HUJI-COMBSEM: Problem #3, Ehud Friedgut – Independent sets and Lionel Levine’s infamous hat problem.
Here are the two problems presented by Ehud Friedgut. The first arose by Friedgut, Kindler, and me in the context of studying Lionel Levine’s infamous hat problem. The second is Lionel Levine’s infamous hat problem. Ehud Friedgut with a few … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Probability
Tagged Ehud Friedgut, Guy Kindler, Lionel Levine
6 Comments
To cheer you up in difficult times 4: Women In Theory present — I will survive
An amazing video (Update, May18 2020). I failed to explain what WIT is and this may have caused some misunderstanding. Here is a description from the Simons Institute site. “The Women in Theory (WIT) Workshop is intended for graduate and … Continue reading
To cheer you up in difficult times II: Mysterious matching news by Gal Beniamini, Naom Nisan, Vijay Vazirani and Thorben Tröbst!
Matching is one of the richest gold mines for ideas and results in mathematics, computer science and other areas. Today I want to briefly tell you about a curious, surprising, mysterious, and cheerful recent result by Gal Beniamini and Noam … Continue reading
Posted in Combinatorics, Computer Science and Optimization
Tagged Gal Beniamini, Naom Nisan, Thorben Tröbst, Vijay Vazirani
10 Comments
Game Theory – on-line Course at IDC, Herzliya
Game theory, a graduate course at IDC, Herzliya; Lecturer: Gil Kalai; TA: Einat Wigderson, ZOOM mentor: Ethan. Starting Tuesday March 31, I am giving an on-line course (in Hebrew) on Game theory at IDC, Herzliya (IDC English site; IDC Chinese … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Economics, Games, Rationality, Teaching
Tagged Game theory, Games
2 Comments
Kelman, Kindler, Lifshitz, Minzer, and Safra: Towards the Entropy-Influence Conjecture
Let me briefly report on a remarkable new paper by Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, and Muli Safra, Revisiting Bourgain-Kalai and Fourier Entropies. The paper describes substantial progress towards the Entropy-Influence conjecture, posed by Ehud Friedgut and … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Open problems
Tagged Dor Minzer, Esty Kelman, Guy Kindler, Muli Safra, Noam Lifshitz
1 Comment