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
Category Archives: Updates
Call for nominations for the Ostrowski Prize 2017
Call for nominations for the Ostrowski Prize 2017 The aim of the Ostrowski Foundation is to promote the mathematical sciences. Every second year it provides a prize for recent outstanding achievements in pure mathematics and in the foundations of … Continue reading
Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science
May 4 2:30-3:30; May 7 11:00-13:00; May 10 10:30-12:00 See the event webpage for titles and abstracts (or click on the picture below).
Updates (belated) Between New Haven, Jerusalem, and Tel-Aviv
This is a (very much) belated update post from the beginning of March (2016). New Haven I spent six weeks in February (2016) in New Haven. It was very nice to get back to Yale after more than two years. Here … Continue reading
R(5,5) ≤ 48
The Ramsey numbers R(s,t) The Ramsey number R(s, t) is defined to be the smallest n such that every graph of order n contains either a clique of s vertices or an independent set of t vertices. Understanding the values … Continue reading
Posted in Combinatorics, Open problems, Updates
Tagged Brendan D. McKay, Vigleik Angeltveit
Leave a comment
Timothy Chow Launched Polymath12 on Rota Basis Conjecture and Other News
Polymath12 Timothy Chow launched polymath12 devoted to the Rota Basis conjecture on the polymathblog. A classic paper on the subject is the 1989 paper by Rosa Huang and Gian Carlo-Rota. Let me mention a strong version of Rota’s conjecture (Conjecture … Continue reading
Posted in Combinatorics, Mathematics over the Internet, Movies, Music, Sport, Updates
Tagged Polymath12
Leave a comment
Laci Babai Visits Israel!
I am sure that every one of the readers of this blog heard about Laci Babai’s quasi-polynomial algorithm for graph isomorphism and also the recent drama about it: A mistake pointed out by Harald Helfgott, a new sub-exponential but … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Updates
Tagged graph isomorphism, Laszlo Babai
2 Comments
International mathematics graduate studies at the Hebrew University of Jerusalem
I am very happy to announce that a Ph. D program in mathematics for international students at the Hebrew University of Jerusalem is now open. Here is the link to the home page. About the program The Einstein Institute of … Continue reading
Posted in Academics, Teaching, Updates
Tagged Einstein Institute of Mathematics, Graduate program, Updates
Leave a comment
Polynomial Method Workshop
The workshop on the “polynomial method” will take place at the Hebrew University of Jerusalem on Monday Dec 26 and Tuesday Dec 27. The event is organized by Jordan Ellenberg and Gil Kalai. Program: Monday 10-11:45 (Combinatorics seminar) Adam Shefer – … Continue reading
Amazing: Stefan Glock, Daniela Kühn, Allan Lo, and Deryk Osthus give a new proof for Keevash’s Theorem. And more news on designs.
Blogging was slow recently, and I have various half written posts on all sort of interesting things, and plenty of unfulfilled promises. I want to quickly share with you two and a half news items regarding combinatorial designs. As you … Continue reading
Avifest live streaming
Live streaming for Avifest is available here. The program is here. Following the first two lectures I can witness that the technical quality of the broadcast is very good and the scientific quality of the lectures is superb. As this is … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Conferences, Updates
Tagged Avi Wigderson
1 Comment