/explore
|
You are here 
|
lucatrevisan.wordpress.com | ||
| | | | |
terrytao.wordpress.com
Let $latex {G = (G,+)}&fg=000000$ be a finite additive group. A tiling pair is a pair of non-empty subsets $latex {A, B}&fg=000000$ such that every element of $latex {G}&fg=000000$ can |
|
| | | | | ||
| | | | |
gilkalai.wordpress.com
A major progress on an old standing beautiful problem.Aubrey de Grey proved that the chromatic number of the plane is at least 5. (I first heard about it from Alon Amit.) TheHadwigerNelson problem asks for the minimum number of colors required to color theplanesuch that no twopointsat distance one from each other have the |
|
| | | | | ||
| | | | |
in-theory.blogspot.com
[AI summary] The post discusses advanced mathematical approaches to Szemeredi's Theorem, focusing on the general case of arithmetic progressions of length 4 or more, including Gowers' proof techniques, generalized Von Neumann theorems, and related open problems in additive combinatorics. |
|
| | | | | ||
| | | | |
mathscholar.org
[AI summary] An article discusses the evolution of mathematics from a discipline that resisted computational tools to one that increasingly relies on computer-assisted proofs, data mining, and artificial intelligence, featuring perspectives from mathematician Terence Tao on the future of the field. |
|
| | | |||
