Recent Comments

Recent Posts
 Problems for Imre Bárány’s Birthday!
 Twelves short videos about members of the Department of Mathematics and Statistics at the University of Victoria
 Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science
 Updates (belated) Between New Haven, Jerusalem, and TelAviv
 Oded Goldreich Fest
 The Race to Quantum Technologies and Quantum Computers (Useful Links)
 Around the GarsiaStanley’s Partitioning Conjecture
 My Answer to TYI 28
 Test your intuition 28: What is the most striking common feature to all these remarkable individuals
Top Posts & Pages
 The Race to Quantum Technologies and Quantum Computers (Useful Links)
 Can Category Theory Serve as the Foundation of Mathematics?
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Polynomial Method Workshop
 R(5,5) ≤ 48
 Problems for Imre Bárány's Birthday!
 Emmanuel Abbe: Erdal Arıkan's Polar Codes
 A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
 'Gina Says'
RSS
Category Archives: Convexity
Raigorodskii’s Theorem: Follow Up on Subsets of the Sphere without a Pair of Orthogonal Vectors
Andrei Raigorodskii (This post follows an email by Aicke Hinrichs.) In a previous post we discussed the following problem: Problem: Let be a measurable subset of the dimensional sphere . Suppose that does not contain two orthogonal vectors. How large … Continue reading
Test Your Intuition (5)
(Not such a set) consider a planar set A with the following property. In every direction, the distance between the two parallel lines that touch A from both sides is the same! Must A be a circle?
Colorful Caratheodory Revisited
Janos Pach wrote me: “I saw that you several times returned to the colored Caratheodory and Helly theorems and related stuff, so I thought that you may be interested in the enclosed paper by Holmsen, Tverberg and me, in … Continue reading
Lovasz’s Two Families Theorem
Laci and Kati This is the first of a few posts which are spinoffs of the extremal combinatorics series, especially of part III. Here we talk about Lovasz’s geometric two families theorem. 1. Lovasz’s two families theorem Here … Continue reading
Posted in Combinatorics, Convexity, Open problems
Tagged exterior algebras, Extremal combinatorics, shellability
5 Comments
Seven Problems Around Tverberg’s Theorem
Imre Barany, Rade Zivaljevic, Helge Tverberg, and Sinisa Vrecica Recall the beautiful theorem of Tverberg: (We devoted two posts (I, II) to its background and proof.) Tverberg Theorem (1965): Let be points in , . Then there is a partition of … Continue reading
Test Your Intuition (2)
Question: Let be the cube in centered at the origin and having dimensional volume equal to one. What is the maximum dimensional volume of when is a hyperplane? Can you guess the behavior of when ? Can you guess the plane which … Continue reading
Sarkaria’s Proof of Tverberg’s Theorem 2
Karanbir Sarkaria 4. Sarkaria’s proof: Tverberg’s theorem (1965): Let be points in , . Then there is a partition of such that . Proof: We can assume that . First suppose that the points belong to the dimensional affine space … Continue reading
Sarkaria’s Proof of Tverberg’s Theorem 1
Helge Tverberg Ladies and gentlemen, this is an excellent time to tell you about the beautiful theorem of Tverberg and the startling proof of Sarkaria to Tverberg’s theorem (two parts). A good place to start is Radon’s theorem. 1. The theorems of Radon, … 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
6 Comments
Helly’s Theorem, “Hypertrees”, and Strange Enumeration II: The Formula
In the first part of this post we discussed an appealing conjecture regaring an extension of Cayley’s counting trees formula. The number of ddimensional “hypertrees” should somehow add up to . But it was not clear to us which complexes we want … Continue reading
Posted in Combinatorics, Convexity
Tagged Cayley theorem, Helly type theorems, Topological combinatorics
5 Comments