Recent Comments
-
Recent Posts
- Call for nominations for the Ostrowski Prize 2017
- 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 Tel-Aviv
- Oded Goldreich Fest
- The Race to Quantum Technologies and Quantum Computers (Useful Links)
- Around the Garsia-Stanley’s Partitioning Conjecture
- My Answer to TYI- 28
Top Posts & Pages
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- Updates and plans III.
- Can Category Theory Serve as the Foundation of Mathematics?
- Polymath 10 Emergency Post 5: The Erdos-Szemeredi Sunflower Conjecture is Now Proven.
- 'Gina Says'
- Five Open Problems Regarding Convex Polytopes
- Sarkaria's Proof of Tverberg's Theorem 2
- Sarkaria's Proof of Tverberg's Theorem 1
RSS
Monthly Archives: January 2012
Fractional Sylvester-Gallai
Avi Wigderson was in town and gave a beautiful talk about an extension of Sylvester-Gallai theorem. Here is a link to the paper: Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes by Boaz Barak, Zeev … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Geometry
Tagged Avi Wigderson, Codes, Greg Kuperberg, Sylvester-Gallai
4 Comments
A Theorem About Infinite Cardinals Everybody Should Know
Cantor proved and we all know that for every cardinal we have This is a very basic fact about cardinal arithmetic and it is nice that the proof works for finite and infinite cardinals equally well. (For the finite case it … Continue reading