Erdős Problem #1026: Monotonic Subsequence Sums
For a sequence of $n$ distinct reals, determine the largest constant $c$ such that some monotonic subsequence always has sum exceeding $(c-o(1))\cdot(1/\sqrt{n})$ times the total sum. Resolved as $c = 1$.
Exact FrontierDelta
Scope and record
Occurred: Dec 8, 2025
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: lean-verified. Publication: announcement. AI contribution: ai-co-developed. Imported under CC BY 4.0.
Canonical aliases: Erdős Problem #1026: Monotonic Subsequence Sums · Erdős #1026 (Mono. Sums) · Problem 1026
Confidence: Not scored
Registry verification: lean verified · announcement · resolved
Attribution
VibeMathed
registry · event recorded by
Terence Tao
human · human collaborator
Aristotle
model · ai model contributor · Harmonic / OpenAI / Google DeepMind
Boris Alexeev
human · human collaborator
Gemini
model · ai model contributor · Harmonic / OpenAI / Google DeepMind
Stijn Cambie
human · human collaborator
Lawrence Wu
human · human collaborator
with GPT
model · ai model contributor · Harmonic / OpenAI / Google DeepMind
AlphaEvolve also contributing
model · ai model contributor · Harmonic / OpenAI / Google DeepMind
Lineage and corrections
This event attributed to Terence Tao
This event attributed to Boris Alexeev
This event attributed to Stijn Cambie
This event attributed to Lawrence Wu
This event attributed to with GPT
This event attributed to Aristotle
This event attributed to AlphaEvolve also contributing
This event attributed to Gemini