Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers

DOI10.1002/MMA.4820MaRDI QIDQ4611086zbMATH OpenOpenAlexWikidataFDO

Authors Raúl M. Falcón, Óscar J. Falcón, Juan Núñez Valdés

Publication date 24 January 2019

Published in Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.10846

zbMATH Keywords

orthogonalitypolynomial ringidealpartial Latin squareconjugacy

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Exact enumeration problems, generating functions (05A15) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of finite geometries (05B25) Loops, quasigroups (20N05)

Abstract: This paper provides an in-depth analysis of how computational algebraic geometry can be used to deal with the problem of counting and classifying $rimess$ partial Latin rectangles based on $n$ symbols of a given size, shape, type or structure. The computation of Hilbert functions and triangular systems of radical ideals enables us to solve this problem for all $r,s,nleq6$. As a by-product, explicit formulas are determined for the number of partial Latin rectangles of size up to six. We focus then on the study of non-compressible regular partial Latin squares and their equivalent incidence structure called seminet, whose distribution into main classes is explicitly determined for point rank up to eight. We prove in particular the existence of two new configurations of point rank eight.

Recommendations

• On computing the number of Latin rectangles
• Enumerating partial Latin rectangles
• Asymptotic enumeration of generalized Latin rectangles
• Asymptotic enumeration of Latin rectangles
• Asymptotic enumeration of Latin rectangles
• scientific article; zbMATH DE number 5726967
• Automatic counting of generalized Latin rectangles and trapezoids
• Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method
• Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method
• Estimating the number of Latin rectangles by the fast simulation method

Cited in

(13)

• Computing Autotopism Groups of Partial Latin Rectangles
• Estimating the number of Latin rectangles by the fast simulation method
• A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
• A historical perspective of the theory of isotopisms
• Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method
• A census of critical sets based on non-trivial autotopisms of Latin squares of order up to five
• Refining invariants for computing autotopism groups of partial Latin rectangles
• Automatic counting of generalized Latin rectangles and trapezoids
• Enumerating partial Latin rectangles
• Classifying partial Latin rectangles
• A dynamic geometry system approach to analyse distance geometry problems based on partial Latin squares
• Using a CAS/DGS to analyze computationally the configuration of planar bar linkage mechanisms based on partial Latin squares
• Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method

This page was built for publication: Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611086)