Erdős #357 follow-up: stronger Coppersmith–Phillips bound read as increasing-only
kevrussell · x · 2026-11-03
Kevin Russell adds a clarification to his AI-assisted Erdős #357 proof: erdosproblems.com lists a stronger Coppersmith–Phillips bound, which the authors read as covering increasing sequences only, so it does not conflict with their new lower bound for sequences in any order. Corrections are welcome, and an audit receipt is linked.
Related event: GPT Astra Helps Advance Lower Bound on Erdős Problem #357(3 posts)→
More from Research
- New "private subquadratic" effort draws skepticism: just add weights to a Transformer — teortaxesTex · 2026-11-03
- GPT-6 Astra editing Qwen3.5 weights for 6x math gains? Skeptics call it cherry-picked demos — teortaxesTex · 2026-11-03
- OSVerify catches proof-killing errors that GPT-6-Pro and Codex both missed — james_y_zou · 2026-11-03
- Stanford and NUS hearables amplify hidden sound textures in real time at UIST 2026 — HanGuo97 · 2026-11-03
- Three LLM agents share one Godot escape room: logging what agents say vs. what they do — ViceGodIm · 2026-11-03
- Steering Qwen-Image-2.1 with Qwen3-VL's internal states, no training needed — zacharynado · 2026-11-03