ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let c=(cn)n∈N{\bf c}=(c_n)_{n\in\mathbb N} be a sequence of complex numbers. For every real-coefficient polynomial PP of degree at most dd and every pair of integers 0≤l<k0\leq l<k, suppose

lim⁡N→∞1N∑1≤n=mk+l≤Ncne2πiP(n)=0,\lim_{N\to\infty}\frac{1}{N}\sum_{1\leq n=mk+l\leq N}c_n e^{2\pi iP(n)}=0,

with the control condition that there is a constant CC such that

1N∑n=1N∣cn∣λ≤C,∀N≥1.\frac{1}{N}\sum_{n=1}^N|c_n|^\lambda\leq C,\qquad \forall N\geq1.

Such a sequence is oscillating of order dd in the arithmetic sense. Arithmetic oscillation disjointness conjecture. An oscillating sequence c{\bf c} of order dd for all d≥2d\geq2 in the arithmetic sense is linearly disjoint from every flow on a torus with zero topological entropy. The conjecture proposes that arithmetic cancellation against polynomial phases suffices for linear disjointness from zero-entropy torus dynamics. The source gives no evidence of a general resolution.

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.