← All problems

The prime-modulus conjecture for progression-free digit sets

4 years old · traced to

Let p≥13p\geq 13 be a prime with p≡1 mod 4p\equiv 1\bmod 4, and let nn be an integer divisible by (p+3)/2(p+3)/2. For a digit set D⊆ZpD\subseteq\mathbb{Z}_p, write S(D,n)S(D,n) for the set of vectors in Zpn\mathbb{Z}_p^n in which every digit of DD occurs the same number of times. Define

D={0,1,…,p−12,p+32}.D=\left\{0,1,\ldots,\frac{p-1}{2},\frac{p+3}{2}\right\}.

Prime-modulus progression-free-set conjecture. The set S(D,n)S(D,n) does not contain any arithmetic progression of length 44.

This conjecture extends the progression-free constructions for odd progression lengths to a case not covered by the stated theorem, motivated by computations with small primes. Its status is unresolved in the source.

References
  1. Christian Elsholtz, Benjamin Klahn and Gabriel F. Lipnik, “Large Subsets of Z_m^n without Arithmetic Progressions”, arXiv:2211.02588 (2022).

Progress summary

Refreshed
Open · progress reported

An unverified submitted argument claims to prove the conjecture in all stated cases, but no independent assessment supports it.

Elsholtz, Klahn, and Lipnik posed this conjecture in 2022: for every prime p≥13p\geq 13 with p≡1 mod 4p\equiv 1\bmod 4 and admissible nn, the specified digit set should produce no four-term arithmetic progression.

Known results

Elsholtz, Klahn, and Lipnik (2022) reported computational evidence for small primes and presented the assertion as Conjecture 2.4, without a general proof or disproof.

Community submission (unverified), November 7, 2026

A submitted proof argues that a parity-corrected potential forces every possible progression gap to vanish, allegedly proving the conjecture uniformly, even without primality. This claim has not received independent mathematical verification.

Current status (as of November 2026): The conjecture remains open in the public record; a November 7, 2026 submission claims a complete proof, but that submission is unverified.

Sources

Solutions 1

A parity-corrected potential proves the Elsholtz–Klahn–Lipnik four-term progression-free digit-set conjectureSee full solutionHide full solution

Result and scope. Elsholtz-Klahn-Lipnik (Des. Codes Cryptogr. 91 (2023) 1443-1452, arXiv:2211.02588) Conjecture 2.4, repeated as Conjecture 4.6 in Lipnik's 2023 thesis: for every prime p >= 13, p = 1 mod 4, and every n divisible by (p+3)/2, S(D,n) with D = {0..(p-1)/2,(p+3)/2} has no nonconstant 4-term AP. Proved uniformly (primality unnecessary) via E(t) = 4t^2 - (3p-5)(-1)^t: the only wrapped coordinate progressions are (h-3,0,h,3) and (3,h,0,h-3), with gap 16; ordinary progressions have gap 16 s^2; equal digit frequencies force every gap to vanish.

Complete proof: A parity-corrected potential proves the Elsholtz–Klahn–Lipnik four-term progression-free digit-set conjecture · PDF.

The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.

This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.