10 papers
The Furstenberg-Sárközy theorem for sums of an even number of odd powers
Alexandros Kalogirou, Andrew Lott, Ákos Magyar +1
We obtain a Furstenberg-Sárközy-type result for sets whose difference set does not contain the sum of -many -th powers of positive integers, with o…
Quasipolynomial density bounds for -point configurations in
Andrew Lott, Ákos Magyar, Nagendar Reddy Ponagandla
Let with and . Let be the vertex set of a nondegenerate -simplex, and let contain no no…
Refined upper bounds on Schur-like numbers
Swaroop Hegde, Andrew Lott, Giorgis Petridis +1
For positive integers and , every -coloring of contains a monochromatic solution to provided that $N \ge 3^r (r!)^{…
Bourgain's pointwise ergodic theorem over function fields
Thái Hoàng Lê, Andrew Lott
We prove a function-field analogue of Bourgain's pointwise ergodic theorem. Let be a power of a prime , let be the ring of polynomials over the finit…
Extensions of the Furstenberg-Sárközy theorem via the arithmetic level- inequality
Carlo Francisco E. Adajar, Rishika Agrawal, Mukul Rai Choudhuri +6
Green and Sawhney recently obtained a quasipolynomial bound in the Furstenberg--Sárközy theorem for square differences by proving an ``arithmetic level-d'' inequality, thereby yiel…
Notes and computations on forbidden differences
Christian Dean, Haley Havard, Elizabeth Hawkins +3
We explore from several perspectives the following question: given and , what is the maximum size of …
The sum-product problem for small sets
Ginny Ray Clevenger, Haley Havard, Patch Heard +3
For , let and . For , let denote the minimum value of over all $A…
Computations and observations on congruence covering systems
Raj Agrawal, Prarthana Bhatia, Kratik Gupta +4
A is a collection of integer congruences such that every integer satisfies at least one congruence in the collection. A covering system is called $\texti…
Schur's theorem in integer lattices
Vishal Balaji, Andrew Lott, Alex Rice
A standard proof of Schur's Theorem yields that any -coloring of yields a monochromatic solution to , where is the classical -color Ramsey…
The pigenhole principle and multicolor Ramsey numbers
Vishal Balaji, Powers Lamb, Andrew Lott +4
For integers , the diagonal Ramsey number is the minimum such that every -coloring of the edges of a complete graph on vertices yields o…