The convex Nivat conjecture: a complexity lower bound for star configurations, and a reduction conditional on the Colle-Garibaldi structure theorem. Paper, LaTeX source and verification scripts.
-
Updated
Sep 12, 2026 - TeX
The convex Nivat conjecture: a complexity lower bound for star configurations, and a reduction conditional on the Colle-Garibaldi structure theorem. Paper, LaTeX source and verification scripts.
To associate your repository with the pattern-complexity topic, visit your repo's landing page and select "manage topics."