Additive relations in irrational powers
Abstract
We investigate the additive theory of the set S = \1c, 2c, …, Nc\ when c is a real number. In the language of additive combinatorics, we determine the asymptotic behaviour of the additive energy of S. When c is rational, this is either known, or follows from existing results, and our contribution is a resolution of the irrational case. We deduce that for all c ∈ \0, 1, 2\, the cardinality of the sumset S + S asymptotically attains its natural upper bound N(N + 1)/2, as N ∞. We show that there are infinitely many, effectively computable numbers c such that the set \pc : p prime\ is additively dissociated (actually linearly independent over Q), and we provide an effective procedure to compute the digits of such c.
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.