PlasmaAI Announces Proof of Erdős #173, a Geometry Conjecture From 1973
kevrussell · x · 2026-10-30
PlasmaAI claims a proof of Erdős problem #173, a geometry conjecture dating to 1973. The puzzle: color every point of the plane red or blue while avoiding a monochromatic triangle of a chosen shape and size. You can avoid equilateral triangles of one size, but then equilateral triangles of every other size—and copies of every non-equilateral triangle—must appear monochromatically. A video demonstrates the result.
More from Research
- Self-Direction turns agent mistakes into LoRA lessons, lifting GAIA success from 38.8% to 55.8% — rohanpaul_ai · 2026-10-30
- Preprint: AlphaGenome pervasively underestimates causal variant effects, undermining fine-mapping — anshulkundaje · 2026-10-30
- One Researcher on 22 NeurIPS 2026 Papers: What Should Author Lists Mean? — qberthet · 2026-10-30
- Stanford's I3L boosts whole-body robot deployment success by 68.3 points — jiajunwu_cs · 2026-10-30
- Dev ditches unanimous-vote stopping rule for a judge in multi-AI debate project — lluisantoni · 2026-10-30
- Google's AI Search Uses Your Knowledge Graph Facts Without Linking, RESONEO Research Finds — dejanseo · 2026-10-30