{"id":"palomar/PALOMAR-2026-11-14-000018","url":"https://github.com/LucDuponcheelAtGitHub/incremental-nc-coins/tree/f115fd40818af99fe0052777620885faf3cf07d6","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-14-000018-v1.json","repo":"https://github.com/LucDuponcheelAtGitHub/incremental-nc-coins","tags":["math.CO","msc:05B15","msc:00A08"],"score":0,"title":"Cyclic n × n Latin Squares Representing Solutions of (n, c)-Coins Problems","trust":"high","domain":"math.CO","source":"palomar","authors":["Marc Duponcheel","Luc Duponcheel"],"reviews":0,"subject":"math.CO","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-14","reactions":{},"formalized":true,"formalizes":[{"title":"Cyclic n × n Latin squares representing solutions of (n, c)-coins problems for 0 ≤ c ≤ n","identifier":"https://github.com/NofanTasi/incremental-nc-coins-problem/blob/main/doc/pdf/paper.pdf","relationship":"formalizes"}]}