Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.14059 v2 pith:M22PRYY6 submitted 2022-05-27 math.CO math.NT

classification math.CO math.NT
keywords convexityelekes-szabgtrsimprovesqueezingtheoremableadvantage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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 $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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths

    cs.DS 2026-07 conditional novelty 8.0 of 10

    For any t, directed shortest paths can be computed with near-linear work plus n^{1+o(1)}t^2 work and roughly n/t parallel depth, matching the undirected tradeoff.

Pith tools