Journal article
Sums of linear transformations
- Abstract:
- We show that if L1 and L2 are linear transformations from Zd to Zd satisfying certain mild conditions, then, for any finite subset(Equation Presented) 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 L1 and L2. As an application, we prove a lower bound for |A + λ · A| when A is a finite set of real numbers and λ is an algebraic number. In particular, when λ is of the form (p/q)1/d for some (Equation Presented) each taken as small as possible for such a representation, we show that (Equation Presented) This is again best possible up to the lower-order term and extends a recent result of Krachun and Petrov which treated the case λ = √ 2.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 427.8KB, Terms of use)
-
- Publisher copy:
- 10.1090/tran/9433
Authors
+ National University of Singapore
More from this funder
- Funder identifier:
- https://ror.org/01tgyzw49
- Grant:
- DMS-2054452
- Publisher:
- American Mathematical Society
- Journal:
- Transactions of the American Mathematical Society More from this journal
- Volume:
- 378
- Issue:
- 10
- Pages:
- 7009-7032
- Publication date:
- 2025-07-31
- Acceptance date:
- 2024-11-18
- DOI:
- EISSN:
-
1088-6850
- ISSN:
-
0002-9947
- Language:
-
English
- Pubs id:
-
2330104
- UUID:
-
uuid_22ab308e-31e8-4c48-a8a5-46fc30e2b520
- Local pid:
-
pubs:2330104
- Deposit date:
-
2025-12-26
- ARK identifier:
Terms of use
- Copyright holder:
- American Mathematical Society
- Copyright date:
- 2025
- Rights statement:
- © Copyright 2025 American Mathematical Society
- Notes:
- The author accepted manuscript (AAM) of this paper has been made available under the University of Oxford's Open Access Publications Policy, and a CC BY public copyright licence has been applied.
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record