ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Open Problem. Real Analysis, Harmonic Analysis and Applications 1767 holds for all 2 \leq p \leq 4. Alternative methods can be used to prove (5) for 2 \leq p \leq 4, but these arguments come with logarithmic losses in the \delta parameter. It would be interesting to establish (5) for some value of 2 < p < 4 with Cp truly uniform in \delta. By a well-known 2n-orthogonality argument due to Córdoba and Fefferman, the proof of Theorem 1 reduces to establishing the following number-theoretic proposition. Proposition 2 ([2]). For all n \in N there exists a constant Cn \geq 1 such that the following holds. Let 0 < \delta < 1 and suppose (x1 , . . . , xn ), (y1 , . . . , yn ) \in [0, 1]n satisfy |xj1 + \cdot \cdot \cdot + xjn − y1j − \cdot \cdot \cdot − ynj | \leq \delta n for 1 \leq j \leq n. Then there exists a permutation \sigma on {1, \cdot \cdot \cdot , n} such that |xj − y\sigma(j) | \leq Cn \delta for all 1 \leq j \leq n. Proposition 2 examines the structure of ‘almost solutions’ to a Vinogradov-type system of equations. In particular, it can be roughly interpreted as saying that every ‘almost solution’ to the system xj1 + \cdot \cdot \cdot + xjn = y1j + \cdot \cdot \cdot + ynj for 1 \leq j \leq n is ‘almost trivial’, in the sense that the yj are close to some permutation of the xj . The passage from Proposition 2 to Theorem 1 is elementary. By translation invariance, we may assume B\delta

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.