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

DOI10.1002/mma.4820zbMath1409.05039arXiv1703.10846OpenAlexW3105633767WikidataQ130074752 ScholiaQ130074752MaRDI QIDQ4611086

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

conjugacypolynomial ringidealorthogonalitypartial Latin square

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)

Related Items (5)

A census of critical sets based on non-trivial autotopisms of Latin squares of order up to five ⋮ Computing Autotopism Groups of Partial Latin Rectangles ⋮ Enumerating partial Latin rectangles ⋮ A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares ⋮ A historical perspective of the theory of isotopisms

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