Even-dimensional monomial distance conjecture over finite p-adic rings

Let pp be a sufficiently large prime, let rr be a positive integer, and let E1,E2E_1,E_2 be subsets of (Z/prZ)n(\mathbb{Z}/p^r\mathbb{Z})^n. For a polynomial

F(x)=i=1naixikF(\mathbf{x})=\sum_{i=1}^n a_i x_i^k

with even n2n\geq 2, k2k\geq 2, and ai0a_i\neq 0 for all 1in1\leq i\leq n, define

Δn,r(E1,E2)={F(xy):xE1, yE2}\Delta_{n,r}(E_1,E_2)=\{F(\mathbf{x}-\mathbf{y}):\mathbf{x}\in E_1,\ \mathbf{y}\in E_2\}

and

δE1,E2=E1E2prn.\delta_{E_1,E_2}=\frac{\sqrt{|E_1||E_2|}}{p^{rn}}.

Even-dimensional monomial distance conjecture. If δE1,E2pn/2\delta_{E_1,E_2}\gg p^{-n/2}, then

Δn,r(E1,E2)pr.|\Delta_{n,r}(E_1,E_2)|\gg p^r.

The conjecture proposes an rr-uniform density threshold for even-dimensional diagonal monomial distance problems over finite pp-adic rings. The preceding theorem establishes a related bound for general diagonal polynomials, but its density threshold is independent of rr only when the minimum exponent is 22; the proposed statement remains unproved in the source.

Sources & referencesView supporting material

Primary source

Thang Pham and Boqing Xue, “On the distance problem over finite p-adic rings”, arXiv:2405.07325 (2026).

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.