A computational approach to analyze the Hadamard quasigroup product
From MaRDI portal
Publication:6153084
DOI10.3934/era.2023164OpenAlexW4361862153MaRDI QIDQ6153084
M. B. Güemes, José Andrés Armario, Raúl M. Falcón, Félix Gudiel, Victor Alvarez, María Dolores Frau
Publication date: 13 February 2024
Published in: Electronic Research Archive (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/era.2023164
Symbolic computation and algebraic computation (68W30) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Orthogonal arrays, Latin squares, Room squares (05B15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of 8\(\times 8\) Latin squares
- Isomorphism invariants for linear quasigroups
- Enumerating partial Latin rectangles
- A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
- Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\)
- SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING
- The number of Latin squares of order 11
- Small latin squares, quasigroups, and loops
- Sudokus and Gröbner Bases: Not Only a Divertimento
- Sylow Theory for Quasigroups II: Sectional Action
- Enumeration of Latin squares with conjugate symmetry
This page was built for publication: A computational approach to analyze the Hadamard quasigroup product