Computing the autotopy group of a Latin square by cycle structure
From MaRDI portal
Publication:397148
DOI10.1016/J.DISC.2014.05.004zbMATH Open1297.05039arXiv1305.1406OpenAlexW2963265631MaRDI QIDQ397148FDOQ397148
Publication date: 8 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: An algorithm that uses the cycle structure of the rows, or the columns, of a Latin square to compute its autotopy group is introduced. As a result, a bound for the size of the autotopy group is obtained. This bound is used to show that the computation time for the autotopy group of Latin squares that have two rows or two columns that map from one to the other by a permutation which decomposes into a bounded number of disjoint cycles, is polynomial in the order .
Full work available at URL: https://arxiv.org/abs/1305.1406
Cites Work
- On the number of Latin squares
- Title not available (Why is that?)
- Bounds on the number of autotopisms and subsquares of a Latin square
- How not to prove the Alon-Tarsi conjecture
- Cycle structure of autotopisms of quasigroups and Latin squares
- Small latin squares, quasigroups, and loops
- Generating uniformly distributed random latin squares
- Cycle structures of autotopisms of the Latin squares of order up to 11
- Quasigroups. I
- Diagonally cyclic Latin squares.
- Title not available (Why is that?)
- On even and odd latin squares
- Atomic Latin squares based on cyclotomic orthomorphisms
- The cycle structure of two rows in a random Latin square
- Title not available (Why is that?)
- Parity types, cycle structures and autotopisms of Latin squares
- Principal Loop-Isotopes of Quasigroups
- Groupoids with quasigroup and Latin square properties.
Cited In (10)
- Computing Autotopism Groups of Partial Latin Rectangles
- A historical perspective of the theory of isotopisms
- Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups
- Autoparatopisms of Quasigroups and Latin Squares
- 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
- Partial Latin Squares Having a Santilli’s Autotopism in their Autotopism Groups
- Autoparatopism stabilized colouring games on rook's graphs
- Using a CAS/DGS to analyze computationally the configuration of planar bar linkage mechanisms based on partial Latin squares
- Two-line graphs of partial Latin rectangles
Uses Software
This page was built for publication: Computing the autotopy group of a Latin square by cycle structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q397148)
