Skip to content

Author

Andrew Lott

We have 4 of 12 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

The Furstenberg-S\'ark\"ozy theorem for sums of an even number of odd powers

We obtain a Furstenberg-S\'ark\"ozy-type result for sets $A\subset [N]$ whose difference set $A-A$ does not contain the sum of $s$-many $k$-th powers of positive integers, with $k>1$ odd and $s>0$ even. Namely, we prove that such sets must satisfy a power-saving bound $|A| \, \ll \, N^{1-\frac1k\min\{s \, \sigma_k, \,...

Alexandros Kalogirou, Andrew Lott, Á. Magyar et al. · 1 citation
Preprint Sep 2026

Quasipolynomial density bounds for $K$-point configurations in $\mathbb{Z}^d$

Let $d,K,N\in \mathbb{N}$ with $K\geq 3$ and $d\geq 4K+4$. Let $\Delta\subset \mathbb{Z}^d$ be the vertex set of a nondegenerate $(K-1)$-simplex, and let $A\subseteq[N]^d$ contain no nontrivial similar copy of $\Delta$. We prove that \[ |A|\ll_{\Delta,d} N^d\exp\!\left(-c_{\Delta,d}\sqrt{\log N}\right) \] improving upo...

Andrew Lott, Á. Magyar, N. R. Ponagandla · 0 citations
Preprint Aug 2026

Refined upper bounds on Schur-like numbers

For positive integers $r, m$ and $N$, every $r$-coloring of $\{1, \dots, N\}$ contains a monochromatic solution to $x_1+\dots+x_{m+1}=y_1+\dots+y_m$ provided that $N \ge 3^r (r!)^{1/m}$, which is qualitatively optimal when $m$ is logarithmic in $r$.

Swaroop G. Hegde, Andrew Lott, G. Petridis et al. · 0 citations
Preprint Sep 2026

Quasipolynomial density bounds for $K$-point configurations in $\mathbb{Z}^d$

Let $d,K,N\in \mathbb{N}$ with $K\geq 3$ and $d\geq 4K+4$. Let $\Delta\subset \mathbb{Z}^d$ be the vertex set of a nondegenerate $(K-1)$-simplex, and let $A\subseteq[N]^d$ contain no nontrivial similar copy of $\Delta$. We prove that \[ |A|\ll_{\Delta,d} N^d\exp\!\left(-c_{\Delta,d}\sqrt{\log N}\right) \] improving upo...

Andrew Lott, Á. Magyar, N. R. Ponagandla · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.