arXiv (All)
open access
Sudoku Analogues of Baranyai's Theorem
Motivated by higher-dimensional generalizations of Sudoku, we study exact block-structured decompositions, algebraic characterizations, and orthogonality for Sudoku hypercubes. Let $n=\prod_{i=1}^d a_i$, let $b_i=n/a_i$, and consider the $λ$-fold complete $d$-uniform $d$-partite hypergraph with $d$
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
- Monitoring Hierarchies in Knowledge Production#997371
- Polyhedral groups and pencils of K3-surfaces with maximal Picard number#231553
- Ternary Perfect Forms Over Imaginary Quadratic Field#1106178
- Symmetric polyhedral scenes and parallel redrawings#1064149
- Semidefinite Programming for Quantum Channel Learning#998084
Record · ID 1050164
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