Enumerating partial Latin rectangles
Ra\'ul M. Falc\'on, Rebecca J. Stones

TL;DR
This paper introduces computational methods to enumerate partial Latin rectangles, deriving formulas and exact counts for various parameters, and classifying them up to isomorphism using algebraic geometry and combinatorial techniques.
Contribution
It provides new formulas and enumeration techniques for partial Latin rectangles, extending previous methods to larger sizes and classifying them via algebraic and combinatorial approaches.
Findings
Exact formulas for partial Latin rectangles with up to 13 non-empty cells.
Enumeration of partial Latin rectangles for sizes up to 8x8.
Classification of rectangles into isomorphism and isotopism classes.
Abstract
This paper deals with distinct computational methods to enumerate the set of partial Latin rectangles on symbols with non-empty cells. For fixed , , and , we prove that the size of this set is a symmetric polynomial of degree , and we determine the leading terms (the monomials of degree through ) using inclusion-exclusion. For , exact formulas for these symmetric polynomials are determined using a chromatic polynomial method. Adapting Sade's method for enumerating Latin squares, we compute the exact size of , for all , and all when . Using an algebraic geometry method together with Burnside's Lemma, we enumerate isomorphism, isotopism, and main classes when . Numerical results have been cross-checked where possible.
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.
