Repositorio de producción científica de la Universidad de Sevilla

Gröbner bases and the number of Latin squares related to autotopisms of order ≤7

Opened Access Gröbner bases and the number of Latin squares related to autotopisms of order ≤7

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Falcón Ganfornina, Raúl Manuel
Martín Morales, Jorge
Departamento: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Fecha: 2007
Publicado en: Journal of symbolic computation, 42 (11), 1142-1154.
Tipo de documento: Artículo
Resumen: Latin squares can be seen as multiplication tables of quasigroups, which are, in general, noncommutativeand non-associative algebraic structures. The number of Latin squares having a fixed isotopismin their autotopism group is at the moment an open problem. In this paper, we use Gröbner bases todescribe an algorithm that allows one to obtain the previous number. Specifically, this algorithm is implemented in SINGULAR to obtain the number of Latin squares related to any autotopism of Latin squares oforder up to 7.
Cita: Falcón Ganfornina, R.M. y Martín Morales, J. (2007). Gröbner bases and the number of Latin squares related to autotopisms of order ≤7. Journal of symbolic computation, 42 (11), 1142-1154.
Tamaño: 149.5Kb
Formato: PDF

Este registro aparece en las siguientes colecciones