Nonexistence of spanning thin codes for prime modulus

From papers

Let NN be a prime with N3N\geq 3. A spanning simplex is a lattice simplex whose lattice points at height one generate the ambient lattice, and a non-degenerate thin code is a thin code that is not degenerate. Prime-modulus spanning-code conjecture. For prime N3N\geq 3 there are no non-degenerate thin codes corresponding to spanning simplices.

Computations in dimensions d8d\leq 8 suggest the conjecture, particularly for spanning simplices with prime NΔN_\Delta. Its validity in general remains open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Vadym Kurylenko, “Thin Simplices via Modular Arithmetic”, arXiv:2404.03975 (2025).

Solutions 0

No solutions have been posted yet.