English

Convexity, Squeezing, and the Elekes-Szab\'{o} Theorem

Combinatorics 2024-01-17 v2 Number Theory

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\'{o} Theorem in order to give new information. Namely, if we let ARA \subset \mathbb R, we prove that there exist a,aAa,a' \in A such that (aA+1)(2)(aA+1)(2)(aA+1)(2)(aA+1)A31/12.\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+AA,A2+A2A2,A3+A3A3}A19/12. \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

Cite

@article{arxiv.2205.14059,
  title  = {Convexity, Squeezing, and the Elekes-Szab\'{o} Theorem},
  author = {Oliver Roche-Newton and Elaine Wong},
  journal= {arXiv preprint arXiv:2205.14059},
  year   = {2024}
}

Comments

20 pages, 2 figures