arXiv (All)
open access
A counting proof for the smallest critical set in a Latin square
A critical set in a Latin square is a set of entries that determines the square uniquely and is minimal with this property. We prove that every partial Latin square of order $n$ with fewer than $\lfloor n^2/4\rfloor$ filled cells has an even number of completions. Consequently every critical set in
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Proofs of some OEIS conjectures on Wythoff sums, Fibonacci and Lucas words#1200493
- The Count's Millions#213
- C~24~H~22~N~2~O~4~S#941506
- The Multicolour Size--Ramsey Number of an Even Cycle#799680
- C~21~H~20~O~4~S~3~#941455
Record · ID 1343715
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive