Sums of linear transformations
David Conlon, Jeck Lim

TL;DR
This paper establishes a lower bound on the size of sumsets formed by linear transformations of finite sets in integer lattices, confirming a conjecture and extending results to algebraic numbers.
Contribution
It proves a sharp lower bound for sums of linear transformations of finite sets, confirming a conjecture and extending to algebraic numbers with optimal bounds.
Findings
Established a lower bound for $| ext{L}_1 A + ext{L}_2 A|$ in $ ext{Z}^d$
Confirmed the two-summand case of Bukh's conjecture
Extended bounds to sumsets involving algebraic numbers like $(p/q)^{1/d}$
Abstract
We show that if and are linear transformations from to satisfying certain mild conditions, then, for any finite subset of , This result corrects and confirms the two-summand case of a conjecture of Bukh and is best possible up to the lower-order term for certain choices of and . As an application, we prove a lower bound for when is a finite set of real numbers and is an algebraic number. In particular, when is of the form for some , each taken as small as possible for such a representation, we show that …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · semigroups and automata theory · Analytic Number Theory Research
