Distribution of rooks on a chess-board representing a Latin square partitioned by a subsystem
B\'ela J\'on\'as

TL;DR
This paper generalizes Latin squares to higher dimensions, analyzing rook distributions on a multi-dimensional chessboard and exploring partitions induced by set complements, with specific results for 2D and 3D cases.
Contribution
It introduces a new framework for partitioning high-dimensional Latin square representations and derives formulas for rook density and distribution in these partitions.
Findings
In 3D, the chess-board represents exactly one main class.
Formulas relate rook counts in partitions to set complements and Hamming distance.
A new binomial coefficient identity is established.
Abstract
A -dimensional generalization of a Latin square of order can be considered as a chess-board of size ( times), containing cells with non-attacking rooks. Each cell is identified by a -tuple where . For we prove that such a chess-board represents precisely one main class. A subsystem induced by a family of sets over is real if for each . The density of is the ratio of contained rooks to the number of cells in . The distance between two subsystems is the minimum Hamming distance between cell pairs. Replacing sets of by their complements, a subsystem is obtained with distance between and . All these subsystems,…
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 · Cellular Automata and Applications · Advanced Combinatorial Mathematics
