Signed p-adic Residual Encodings of Finite-Domain All-Different Systems with a Sudoku Case Study

This story is from 2026-09-16. It is preserved in the archive; the latest stories are on the live feed.

arXiv:2609.16063v1 Announce Type: new Abstract: We study signed, weighted affine $p$-adic residual objectives as native encodings of finite-domain constraints. For primes that separate the finite alphabet, sufficiently weighted positive unary rows pin each coefficient to its allowed set, while nega…

Read the full story at arXiv cs.LG ↗

Timeline · 1 report

1. 2026-09-16 04:00 · arXiv cs.LG
   Signed p-adic Residual Encodings of Finite-Domain All-Different Systems with a Sudoku Case Study