Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Sparse sequences with the same congruence and major-arc data


Status and scope

The results below are proved. They concern synthetic integer sequences, not representation functions of a diagonal form. In particular, they do not prove either density conclusion for Erdős 940.

The construction preserves the exact cubic box congruence distribution modulo a modulus exceeding the square of the root scale, all fixed congruences, the joint profinite limit, and all the estimates in the major-arc note. Nevertheless its support has density zero at the output scale and its logarithmic multiplicity diverges. Thus the missing integer-fiber estimate cannot follow from these data alone. The construction does not preserve the factorization into three cubic Weyl sums; exploiting that factorization on the minor arcs remains possible.

Congruence-preserving sampling

Lemma. Let RR be a nonnegative integer sequence supported in {0,…,B}\{0,\ldots,B\}, where B≥1B\ge1, and put T=∑nR(n)>0T=\sum_nR(n)>0. For arbitrary positive integers D,KD,K, there is a nonnegative integer sequence R~\widetilde R, supported inside supp⁡R\operatorname{supp}R, such that

∑n≡a(modD)R~(n)=∑n≡a(modD)R(n)(a mod D),(1)\sum_{n\equiv a\pmod D}\widetilde R(n) =\sum_{n\equiv a\pmod D}R(n)\qquad(a\bmod D), \tag{1} ∣supp⁡R~∣≤T/K+D,∑R~(n)≥KR~(n)≥T−KD,(2)|\operatorname{supp}\widetilde R|\le T/K+D, \qquad \sum_{\widetilde R(n)\ge K}\widetilde R(n)\ge T-KD, \tag{2}

and, writing e(t)=exp⁡(2πit)e(t)=\exp(2\pi it),

sup⁡α∈R/Z∣∑n(R~(n)−R(n))e(nα)∣≪KTlog⁡(2BT).(3)\sup_{\alpha\in\mathbb R/\mathbb Z} \left|\sum_n(\widetilde R(n)-R(n))e(n\alpha)\right| \ll\sqrt{KT\log(2BT)}. \tag{3}

Every such sequence also satisfies

1T∑nR~(n)log⁡R~(n)≥log⁡K−log⁡(1+KD/T),(4)\frac1T\sum_n\widetilde R(n)\log\widetilde R(n) \ge\log K-\log(1+KD/T), \tag{4} ∑nR~(n)2≥KT1+KD/T.(5)\sum_n\widetilde R(n)^2\ge\frac{KT}{1+KD/T}. \tag{5}

As usual 0log⁡0=00\log0=0.

Proof. Write the mass of class aa as Ma=maK+raM_a=m_aK+r_a, with 0≤ra<K0\le r_a<K. When Ma>0M_a>0, sample independently mam_a outputs from the conditional law R(n)/MaR(n)/M_a in that class, assigning weight KK to each draw. If ra>0r_a>0, make one further independent draw with weight rar_a. Add weights when several draws choose the same output.

Each class has exactly its prescribed mass, and the number of draws is at most T/K+DT/K+D. The total weight of the remainder draws is less than KDKD; every weight-KK draw contributes to a fiber of size at least KK. This proves (1) and (2) for every realization. Also ER~(n)=R(n)\mathbb E\widetilde R(n)=R(n).

Let Z(α)Z(\alpha) denote the sum in (3). The independent draws have weights wℓ≤Kw_\ell\le K, and ∑ℓwℓ2≤KT\sum_\ell w_\ell^2\le KT. The elementary Hoeffding bound for the real and imaginary parts gives

Pr⁡(∣Z(α)∣≥u)≤4exp⁡(−u2/(4KT)).(6)\Pr(|Z(\alpha)|\ge u)\le4\exp(-u^2/(4KT)). \tag{6}

For completeness, the real part contributed by a weight-ww draw lies in an interval of length 2w2w; applying the exponential-moment bound for a centered variable in an interval, followed by Markov's inequality, gives the real tail. Use threshold u/2u/\sqrt2 for each part and a union bound to obtain (6).

Deterministically ∥Z′∥∞≤4πBT\|Z'\|_\infty\le4\pi BT, since both sequences have mass TT and support in [0,B][0,B]. On a uniform grid of L=⌈8πBT⌉L=\lceil8\pi BT\rceil frequencies, take u=2KTlog⁡(8L)u=2\sqrt{KT\log(8L)}. Equation (6) and a union bound give probability at most 1/21/2 of a grid violation. The nearest grid point changes ZZ by at most 1/41/4. Some realization therefore satisfies (3).

Finally, the probability law ν(n)=R~(n)/T\nu(n)=\widetilde R(n)/T has entropy at most log⁡(T/K+D)\log(T/K+D). The identity T−1∑R~log⁡R~=log⁡T−H(ν)T^{-1}\sum\widetilde R\log\widetilde R=\log T-H(\nu) proves (4), and Cauchy--Schwarz proves (5). □\square

Application to the cubic box distribution

Put F=x3+2y3+4z3F=x^3+2y^3+4z^3, take N=2k→∞N=2^k\to\infty, and let RNR_N count representations with 1≤x,y,z≤N1\le x,y,z\le N. Thus T=N3T=N^3 and B=7N3B=7N^3. Choose integers mN→∞m_N\to\infty so slowly that

LN=lcm⁡(1,…,mN)≤log⁡(2N).L_N=\operatorname{lcm}(1,\ldots,m_N)\le\sqrt{\log(2N)}.

For example, take the largest m≤⌊log⁡N⌋m\le\lfloor\log N\rfloor satisfying this inequality. Set

DN=N2LN,KN=⌊N/log⁡(2N)⌋.D_N=N^2L_N, \qquad K_N=\left\lfloor N/\log(2N)\right\rfloor.

For sufficiently large NN, KN≥1K_N\ge1 and KNDN/N3≤1/log⁡(2N)→0K_ND_N/N^3\le1/\sqrt{\log(2N)}\to0. The lemma gives

∣supp⁡R~N∣≪N2log⁡N=o(N3),(7)|\operatorname{supp}\widetilde R_N|\ll N^2\log N=o(N^3), \tag{7} N−3∑nR~N(n)log⁡R~N(n)≥log⁡N−log⁡log⁡N−O(1),(8)N^{-3}\sum_n\widetilde R_N(n)\log\widetilde R_N(n) \ge\log N-\log\log N-O(1), \tag{8} ∑nR~N(n)2≫N4/log⁡N.(9)\sum_n\widetilde R_N(n)^2\gg N^4/\log N. \tag{9}

The congruence marginals agree exactly modulo N2N^2, and eventually modulo N2qN^2q for every fixed qq. In particular, every residue modulo NN has mass exactly N2N^2, by the special cubic's dyadic uniformity. No uniformity or bounded second moment modulo N2N^2 is asserted.

With WN=∑nRN(n)e(nα)W_N=\sum_nR_N(n)e(n\alpha) and W~N=∑nR~N(n)e(nα)\widetilde W_N=\sum_n\widetilde R_N(n)e(n\alpha), (3) gives

∥W~N−WN∥∞≪N2.(10)\|\widetilde W_N-W_N\|_\infty\ll N^2. \tag{10}

Thus the normalized Fourier transforms differ by only O(N−1)O(N^{-1}) uniformly, and agree exactly at every rational frequency whose denominator divides DND_N.

The joint profinite limit also agrees

Let

ρN;q(a)=qN3∑n≡a(modq)RN(n).\rho_{N;q}(a)=\frac q{N^3}\sum_{n\equiv a\pmod q}R_N(n).

If q≤N/2q\le N/2, each root residue occurs between N/q−1N/q-1 and N/q+1N/q+1 times. Comparing each residue triple with the complete residue box gives

(1−q/N)3ρq(a)≤ρN;q(a)≤(1+q/N)3ρq(a),(11)(1-q/N)^3\rho_q(a)\le\rho_{N;q}(a) \le(1+q/N)^3\rho_q(a), \tag{11}

where ρq\rho_q is the complete density from the profinite note. Hence

∥ρN;q−ρq∥2≤5(q/N)∥ρq∥2≤5S q/N.(12)\|\rho_{N;q}-\rho_q\|_2\le5(q/N)\|\rho_q\|_2 \le5\sqrt{\mathfrak S}\,q/N. \tag{12}

The norm here uses normalized counting measure modulo qq.

Exact marginal preservation at q=LNq=L_N and the proved profinite convergence show

∥ρ~N;LN−ρ∥L2(Z^)≪LN/N+mN−1/3⟶0.(13)\|\widetilde\rho_{N;L_N}-\rho\|_{L^2(\widehat{\mathbb Z})} \ll L_N/N+m_N^{-1/3}\longrightarrow0. \tag{13}

In particular, the joint congruence second moments tend to S\mathfrak S, and their entropy deficits are at most log⁡S+o(1)\log\mathfrak S+o(1). This bounded coarse entropy coexists with (8).

Every established major-arc estimate survives

For the arcs M(N,Q)\mathfrak M(N,Q) in the major-arc theorem, 1≤Q≤N1/21\le Q\le N^{1/2},

∣M(N,Q)∣≤2Q2/N3,∫M∣WN∣2≪N3.|\mathfrak M(N,Q)|\le2Q^2/N^3, \qquad \int_{\mathfrak M}|W_N|^2\ll N^3.

Equation (10) implies ∫M∣W~N−WN∣2≪NQ2\int_{\mathfrak M}|\widetilde W_N-W_N|^2\ll NQ^2. Cauchy--Schwarz therefore gives

∣∫M∣W~N∣2−∫M∣WN∣2∣≪N2Q+NQ2≪N2Q2.(14)\left|\int_{\mathfrak M}|\widetilde W_N|^2 -\int_{\mathfrak M}|W_N|^2\right| \ll N^2Q+NQ^2\ll N^2Q^2. \tag{14}

Consequently exactly the same asymptotic holds:

∫M(N,Q)∣W~N∣2=N3JS+O(N3Q−2/3+N2Q2).(15)\int_{\mathfrak M(N,Q)}|\widetilde W_N|^2 =N^3\mathfrak J\mathfrak S+ O(N^3Q^{-2/3}+N^2Q^2). \tag{15}

The pointwise approximation survives too: (10) and WN=MN+O(QN2)W_N=M_N+O(QN^2) imply W~N=MN+O(QN2)\widetilde W_N=M_N+O(QN^2), with the same main function MNM_N. Thus its integrated squared approximation error remains O(NQ4)O(NQ^4).

In contrast, put EN={n:R~N(n)≥KN}E_N=\{n:\widetilde R_N(n)\ge K_N\} and PEN(α)=∑n∈ENe(−nα)P_{E_N}(\alpha)=\sum_{n\in E_N}e(-n\alpha). Then

∣EN∣≪N2log⁡N,∑n∈ENR~N(n)=N3+O(KNDN).|E_N|\ll N^2\log N, \qquad \sum_{n\in E_N}\widetilde R_N(n)=N^3+O(K_ND_N).

The major-arc correlation is O(N5/2log⁡N)O(N^{5/2}\sqrt{\log N}) by Cauchy--Schwarz and (15). Subtracting it from the full Fourier integral gives

∫M(N,Q)cW~NPEN=N3+O(KNDN+N5/2log⁡N)=(1+o(1))N3.(16)\int_{\mathfrak M(N,Q)^c}\widetilde W_N P_{E_N} =N^3+O(K_ND_N+N^{5/2}\sqrt{\log N})=(1+o(1))N^3. \tag{16}

So essentially all the mass of the heavy fibers can lie in the missing minor-arc correlation, while the preceding congruence and major-arc estimates remain valid. An argument for the actual polynomial must use additional information that excludes this construction; none is supplied by this lemma.