On combinatorial compexity of convex sequences
Abstract
We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.