Work

Affine Copies of Three-Point Patterns in Sets of Integers

Year: 2026
Type: preprint
Abstract: Let $P=\{0,a,b\}$, where $00$, and let $M_P(A)$ count the copies with any $d\ne0$. We prove that every such three-point pattern other than the arithmetic progression $\{0,1,2\}$ satisfies \[ M_P^+(A)\le \frac{99}{400}|A|^2+O(|A|), \qquad M_P(A)\le \frac{13}{28}|A|^2+O_P(|A|). \] For the particular pattern $P=\{0,1,3\}$ -- the subject of a question raised by Ganguly and recorded as Problem 24 in Green's list of open problems -- we sharpen the bound allowing both signs of the dilation to \[ M_{\{0,1,3\}}(A)\le \frac{47}{122}|A|^2+O(|A|). \]
Language: English
Open Access status: green
OpenAlex ID: W7207693726
Cites: 3
Cited by:
Related to: 10