math.CO — Combinatorics
Finite Multiset Codes and Affine Lattice Restrictions
We study constant-weight nonnegative integer vectors under half-L1 distance and compare arbitrary codes with full intersections of affine additive-subgroup cosets with the discrete simplex. A heavy-coordinate decomposition gives the exact reduction A_q(n,n-s) = q + B_q(n,s) to codes whose coordinates are bounded by s. It determines the unrestricted optimum throughout 2n > (q+1)s. For every q ≥ 3 and s ≥ 2, at n = qs−1 and D = (q−1)s−1 the unrestricted and full-coset optima are respectively q+1 and q; we classify all q² unrestricted extremizers. We retain a complete classification of both optima for three coordinates and n < 2D. In the next ternary band, 2D ≤ n < 3D, eight words are attainable precisely when 3n ≥ 8D; equality yields an infinite eight-versus-seven full-coset separation. Exact finite certificates also give a six-versus-five gap at (q,n,D) = (4,5,3) and the quinary single-deletion values A_5(9,2) = 143 and A_5(10,2) = 201. The proofs use intersection bounds and explicit integer affine combinations. The unrestricted decomposition extends known methods, and bibliographic novelty remains unresolved, particularly against a closely related 2024 paper not compared in full.