3 papers
math.CO2026
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!)^{…
math.NT2026
More on the sum-product problem for integers with few prime factors
Rishika Agrawal, Thomas F. Bloom, Giorgis Petridis
We show that if is a finite set of integers in which every integer is divisible by many primes then \[\max(\lvert A+A\rvert,\lvert AA\rvert) \geq \lver…
math.NT2025
Polynomial configurations in dense subsets of the prime lattice
Andrew Lott, Ãkos Magyar, Giorgis Petridis +1
We provide a multidimensional extension of previous results on the existence of polynomial progressions in dense subsets of the primes. Let be a subset of the prime lattice - t…