Characterizes the range of c where linear equations with s variables are partition regular over floor(n^c), gives density bounds, and updates a Fourier-analytic transference principle.
Ko´ sciuszko, Counting solutions to invariant equations in dense sets
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.NT 2verdicts
UNVERDICTED 2representative citing papers
Arithmetic regularity decomposes arithmetic problems into real, p-adic, and combinatorial factors to obtain correct lower bounds on solution counts in dense sets, illustrated on a linear-plus-higher-degree equation system.
citing papers explorer
-
Additive Ramsey theory over Piatetski-Shapiro numbers
Characterizes the range of c where linear equations with s variables are partition regular over floor(n^c), gives density bounds, and updates a Fourier-analytic transference principle.
-
Arithmetic regularity as an alternative to transference
Arithmetic regularity decomposes arithmetic problems into real, p-adic, and combinatorial factors to obtain correct lower bounds on solution counts in dense sets, illustrated on a linear-plus-higher-degree equation system.