Recent Comments
David Román on Amazing: Erdős’ Unit Dis… David Román on Amazing: Erdős’ Unit Dis… David Román on The Ramanujan Challenge for… AI vyvrátila slavnou… on Amazing: Erdős’ Unit Dis… تحدي رامانوجان للذكا… on The Ramanujan Challenge for… mathematicalsilence on The Ramanujan Challenge for… Gil Kalai on Polymath Plus AI Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Gil Kalai on Matching in NC and Local … rohitgurjar0 on Matching in NC and Local … Vijay Vazirani on Matching in NC and Local … -
Recent Posts
- The Ramanujan Challenge for AI
- Matching in NC and Local Events
- A sensational Ramsey breakthrough by Domagoj Bradač (reblogged from Sam Mattheus’ blog)
- Three Interviews
- Amazing: Erdős’ Unit Distance Problem was Disproved! It was achieved by AI!
- Polymath Plus AI
- Starting Today: Kazhdan Sunday seminar: “Boolean Functions, Hypercontractivity, and Applications”
- Scott Aaronson’s View of my View About Quantum Computing
- The Fully Depolarizing Noise Conjecture for Physical Cat States is Twenty Years Old!
Top Posts & Pages
- The Ramanujan Challenge for AI
- Amazing: Erdős' Unit Distance Problem was Disproved! It was achieved by AI!
- About
- A sensational Ramsey breakthrough by Domagoj Bradač (reblogged from Sam Mattheus' blog)
- Attila Por's Universality Result for Tverberg Partitions
- Optimal Monotone Families for the Discrete Isoperimetric Inequality
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- Moshe Vardi: What is Theoretical Computer Science?
- Polynomial Bounds for Chowla's Cosine Problem
RSS
Monthly Archives: July 2008
A Diamater Problem for Families of Sets.
Let me draw your attention to the following problem: Consider a family of subsets of size d of the set N={1,2,…,n}. Associate to a graph as follows: The vertices of are simply the sets in . Two vertices and are adjacent … Continue reading
Posted in Combinatorics, Convex polytopes, Open problems
10 Comments
Extremal Combinatorics II: Some Geometry and Number Theory
Extremal problems in additive number theory Our first lecture dealt with extremal problems for families of sets. In this lecture we will consider extremal problems for sets of real numbers, and for geometric configurations in planar Euclidean geometry. Problem I: Given a set A of … Continue reading
Arrow’s Economics 1
The annual Summer School in Economics at HU was directed until last year by Kenneth Arrow, along with Eyal Winter. Arrow decided this year to step down as a director and Eric Maskin is replacing him. The 2008 Summer School was … Continue reading
Pushing Behrend Around
Erdos and Turan asked in 1936: What is the largest subset of {1,2,…,n} without a 3-term arithmetic progression? In 1946 Behrend found an example with Now, sixty years later, Michael Elkin pushed the the factor from the denominator to the enumerator, … Continue reading
Posted in Combinatorics, Updates
Tagged Arithmetic progressions, Roth's theorem, Szemeredi's theorem
17 Comments
From Helly to Cayley IV: Probability
I decided to split long part III into two parts. This (truly) last part of this series deals with probabilistic problems and with combinatorial questions regarding higher Laplacians. 21. Higher Laplacians and their meanings Our high dimensional extension to Cayley’s … Continue reading
Posted in Combinatorics, Probability
9 Comments
A New Rector-Elect at the Hebrew University of Jerusalem
Professor Sarah Stroumsa On Wednesday, the Senate of the Hebrew University of Jerusalem elected Professor Sarah Stroumsa (homepage) as the next Rector (provost) of the Hebrew University. For the first time since its establishment, the Hebrew University has elected a woman to its highest post … Continue reading
Helly, Cayley, Hypertrees, and Weighted Enumeration III
This is the third and last part of the journey from a Helly type conjecture of Katchalski and Perles to a Cayley’s type formula for “hypertrees”. (On second thought I decided to divide it into two devoting the second to probabilistic questions.) … Continue reading
Posted in Combinatorics, Convexity, Open problems, Probability
8 Comments