Convexity, Squeezing, and the Elekes-Szabó Theorem
Open Access
- 12 January 2024
- journal article
- research article
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (1) , P1.3
Abstract
This paper explores the relationship between convexity and sum sets. In particular, we show that elementary number theoretical methods, principally the application of a squeezing principle, can be augmented with the Elekes-Szabó Theorem in order to give new information. Namely, if we let $A \subset \mathbb R$, we prove that there exist $a,a' \in A$ such that\[\left | \frac{(aA+1)^{(2)}(a'A+1)^{(2)}}{(aA+1)^{(2)}(a'A+1)} \right | \gtrsim |A|^{31/12}.\]We are also able to prove that\[\max \{|A+ A-A|, |A^2+A^2-A^2|, |A^3 + A^3 - A^3|\} \gtrsim |A|^{19/12}.\]Both of these bounds are improvements of recent results and takes advantage of computer algebra to tackle some of the computations.
Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- A better than $3/2$ exponent for iterated sums and products over $\mathbb R$Mathematical Proceedings of the Cambridge Philosophical Society, 2024
- Improved Elekes-Szabó type estimates using proximityJournal of Combinatorial Theory, Series A, 2023
- Growth in Sumsets of Higher Convex FunctionsCombinatorica, 2023
- The Elekes—Szabó problem and the Uniformity ConjectureIsrael Journal of Mathematics, 2022
- Higher Convexity and Iterated Sum SetsCombinatorica, 2021
- On Distinct Consecutive Differences2021
- A Survey of Elekes-Rónyai-Type Problems2018
- How to find groups? (and how to use them in Erdős geometry?)Combinatorica, 2012
- Convexity and SumsetsJournal of Number Theory, 2000
- A Combinatorial Problem on Polynomials and Rational FunctionsJournal of Combinatorial Theory, Series A, 2000