Gil Kalai presents 'the most outrageous conjecture' on proving primes in sparse sets
_onionesque · x · 2026-10-15
Mathematician Gil Kalai proposes a serious contender for "the most outrageous conjecture in mathematics": there is an inherent difficulty in proving infinitude of primes and related results like Möbius randomness for explicit, sparse sets. It grew out of his 2013 MathOverflow question and connects to polymath4 (2009).
More from Research
- Agentic biology is shaped like software: code leads bio by about a year — kenbwork · 2026-10-15
- Schmidhuber publishes paper challenging who invented deep residual learning — SchmidhuberAI · 2026-10-15
- Thinky's Dimuon FAQ: no RL gains over AdamW, tune learning rate only — eliebakouch · 2026-10-15
- SYNC lets heterogeneous LLMs share facts via word indices, no training needed — NanyangTechnologicalUniversity · 2026-10-15
- Berkeley scales online OT minibatch couplings to stabilize flow matching training — UCBerkeley · 2026-10-15
- Apertus 1.5 extends open models to multimodal reasoning with 262K context — swiss-ai · 2026-10-15