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: March 2017
My Answer to TYI- 28
The fifteen remarkable individuals in the previous post are all the recipients of the SIGACT Distinguished Service Prize since it was established in 1997. The most striking common feature to all of them is, in my view, that they are all … Continue reading
Posted in Computer Science and Optimization, Women in science
Tagged SIGACT, Women in science
2 Comments
Test your intuition 28: What is the most striking common feature to all these remarkable individuals
Test your intuition: What is the most striking common feature to all these fifteen remarkable individuals László Babai; Avi Wigderson; Lance Fortnow; Lane Hemaspaandra; Sampath Kannan; Hal Gabow; Richard Karp; Tom Leighton; Rockford J. Ross; Alan Selman; Michael Langston; S. … 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
Test Your Intuition (27) about the Alon-Tarsi Conjecture
On the occasion of Polymath 12 devoted to the Rota basis conjecture let me remind you about the Alon-Tarsi conjecture and test your intuition concerning a strong form of the conjecture. The sign of a Latin square is the product … Continue reading
Posted in Combinatorics, Open problems, Test your intuition
Tagged Alon-Tarsi conjecture, Polymath12
Leave a comment