Combinatorics · Oct 6, 2026
Power savings for intersective polynomial differences and prime arguments
For every fixed intersective integer polynomial h of degree k ≥ 2 with positive leading coefficient, proves that a subset of avoiding nonzero values as differences has size , with depending only on degree. Here intersective means having a root modulo every modulus. For prime arguments, a power saving also holds when h has a unit root modulo every modulus, with exponent allowed to depend on h.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model