Arithmetic oscillation disjointness conjecture for zero-entropy torus flows

Let c=(cn)nN{\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 0l<k0\leq l<k, suppose

limN1N1n=mk+lNcne2π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

1Nn=1NcnλC,N1.\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 d2d\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.

Sources & referencesView supporting material

Primary source

Yunping Jiang, “Orders of Oscillation Motivated by Sarnak's Conjecture–Part II”, arXiv:2201.08800 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.