Erdős problem writeups

Notes produced with my autonomous mathematical research agent (built on Rethlas): a generate-and-verify pipeline that attacks open problems, with an external-LLM verification service and multi-model campaign orchestration. Each note below was reviewed by me and cross-checked through the verification loop. They are also posted on erdosproblems.com.

• Erdős #153: mean-square gap divergence for asymptotically maximum Sidon sets (diameter ~ n²). [PDF]
• Erdős #301: an unconditional upper bound f(N) ≤ 0.8436 N + o(N) via a prefix fiber-LP with an exact rational dual certificate. [PDF]
• Erdős #327: improved upper bounds for the a + b ∤ k·a·b density problem, sharpening van Doorn’s 25/28 bound. [PDF] [certificate]
• Erdős #675(a): a super-polynomial lower bound on local periods of the sums-of-two-squares set. [PDF]
• Erdős #819: an improved lower bound (reflected two-copy Sidon construction). [PDF]