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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2610.00366
curl -X POST /api/v1/records/hexagon/2610.00366/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00366/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'