Cyclic n × n Latin Squares Representing Solutions of (n, c)-Coins Problems
Source: github.com/LucDuponcheelAtGitHub/incremental-nc-coins/tree/…
Formalization of incremental n × n Latin squares and cyclic incremental n × n Latin squares representing n + 1 solutions of (n, c)-coins problems simultaneously for all 0 ≤ c ≤ n. We prove that (1) for every n ≥ 4, any incremental n × n Latin square represents valid (n, c)-coins solutions for all 0 ≤ c ≤ n simultaneously via value thresholding, and (2) for every n ≥ 4 with n ∉ {4, 6}, there exists a column permutation p such that the cyclic Latin square L(i, j) = (i + p(j)) mod n is incremental, using an injective-majorization principle across four infinite modular families modulo 6 and the…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-14-000018
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-14-000018/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-14-000018/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'