
TL;DR
This paper completes the classification of when a Latin square of order n can contain five disjoint subsquares of specified sizes, extending previous results for up to four subsquares.
Contribution
It provides a complete solution for the existence of Latin squares with five disjoint subsquares of given sizes, filling a gap in the existing literature.
Findings
Solved the case for five disjoint subsquares in Latin squares
Extended previous results from k≤4 to k=5
Proved additional results for specific partitions with five subsquares
Abstract
Given an integer partition of , is it possible to find an order latin square with disjoint subsquares of orders ? This question was posed by L.Fuchs and is only partially solved. Existence has been determined in general when , and in this paper we will complete the case when . We also prove some less general results for partitions with .
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
TopicsConstraint Satisfaction and Optimization
