A quick construction of mutually orthogonal sudoku squares
John Lorch

TL;DR
This paper presents a rapid method for constructing large sets of mutually orthogonal sudoku squares of order q^2 for any odd prime power q, enhancing the efficiency of generating such combinatorial designs.
Contribution
It introduces a novel quick construction technique for complete families of mutually orthogonal sudoku squares applicable to any odd prime power q.
Findings
Constructed families of q(q-1) mutually orthogonal sudoku squares for various q.
The method simplifies the generation process compared to previous approaches.
Applicable to all odd prime power orders, broadening the scope of orthogonal sudoku designs.
Abstract
For any odd prime power q we provide a quick construction of a complete family of q(q-1) mutually orthogonal sudoku squares of order q^2.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems
