Analysis of subsystems with rooks on a chess-board representing a partial Latin square (Part 2.)
B\'ela J\'on\'as

TL;DR
This paper explores the representation of partial Latin squares using a 3D chess-board with non-attacking rooks, establishing capacity and balance conditions that determine the completion possibilities of these squares.
Contribution
It introduces a novel chess-board model for partial Latin squares and derives new capacity and balance conditions for their completion, extending previous theoretical results.
Findings
Capacity condition aligns with Cruse's necessary condition.
Partial Latin squares with at most n+1 symbols can be completed if they meet the capacity condition.
Balance condition is necessary for completing a layer in the Latin square.
Abstract
A partial Latin square of order can be represented by a -dimensional chess-board of size with at most non-attacking rooks. In Latin squares, a subsystem and its most distant mate together have as many rooks as their capacity. That implies a simple capacity condition for the completion of partial Latin squares which is in fact the Cruse's necessary condition for characteristic matrices. Andersen-Hilton proved that, except for certain listed cases, a PLS of order can be completed if it contains only symbols. Andersen proved it for symbols, listing the cases to be excluded. Identifying the structures of the chess-board that can be overloaded with or rooks, it follows that a PLS derived from a chess-board with at most non-attacking rooks can be completed exactly if it satisfies the capacity condition. In a layer of a Latin…
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
