A Single Set Improvement to the $3k-4$ Theorem
David J. Grynkiewicz

TL;DR
This paper weakens the conditions of the classical $3k-4$ Theorem, showing that under broader circumstances, one can still find an arithmetic progression containing one of the sets with controlled size, advancing additive combinatorics.
Contribution
It introduces a significantly weaker hypothesis under which the containment of a set in an arithmetic progression can be guaranteed, extending the classical $3k-4$ Theorem.
Findings
Established a new bound for the size of the progression containing $B$.
Demonstrated the optimality of the hypothesis without additional assumptions.
Extended the applicability of the $3k-4$ Theorem to broader cases.
Abstract
The Theorem is a classical result which asserts that if are finite, nonempty subsets with \begin{equation}\label{hyp}|A+B|=|A|+|B|+r\leq |A|+|B|+\min\{|A|,\,|B|\}-3-\delta,\end{equation} where if and are translates of each other, and otherwise , then there are arithmetic progressions and of common difference such that , , and . It is one of the few cases in Freiman's Theorem for which exact bounds on the sizes of the progressions are known. The hypothesis above is best possible in the sense that there are examples of sumsets having cardinality just one more, yet and cannot both be contained in short length arithmetic progressions. In this paper, we show that the hypothesis above can be significantly weakened and still yield the…
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.
