ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let c<∞c<\infty and δ>0\delta>0 be constants, and for each nn and nonzero m∈Z/2nm\in\mathbb Z/2^n consider the average of the exponential sequence e(3km/2n)e(3^k m/2^n) for 0≤k<cn0\leq k<cn, where e(x)=exp⁡(2πix)e(x)=\exp(2\pi i x) and R{\mathfrak R} denotes real part.

Main exponential-sum conjecture. There are constants c<∞c<\infty and δ>0\delta>0 such that for all nn and all nonzero m∈Z/2nm\in\mathbb Z/2^n,

Re⁡(1cn∑0≤k<cne(3km2n))≤1−δ.\operatorname{Re}\left(\frac{1}{cn}\sum_{0\leq k<cn}e\left(3^k\frac{m}{2^n}\right)\right)\leq 1-\delta.

This conjecture would give a linear lower bound on the Hamming distance of the proposed deterministic tree-code construction, and hence would establish that construction as an effectively computable asymptotically good tree code. It is presented as the main conjecture of the paper; no resolution is given.

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.