Refining invariants for computing autotopism groups of partial Latin rectangles
From MaRDI portal
Publication:2305926
DOI10.1016/j.disc.2020.111812zbMath1435.05037OpenAlexW3002613698WikidataQ126315342 ScholiaQ126315342MaRDI QIDQ2305926
Dani Kotlar, Raúl M. Falcón, Eiran Danan, Trent G. Marbach, Rebecca J. Stones
Publication date: 20 March 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.111812
Related Items (3)
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classifying partial Latin rectangles
- The set of autotopisms of partial Latin squares
- Computing the autotopy group of a Latin square by cycle structure
- Parity types, cycle structures and autotopisms of Latin squares
- The spectrum for quasigroups with cyclic automorphisms and additional symmetries.
- Loops of order \(p^ n+1\) with transitive automorphism groups
- Autoparatopism stabilized colouring games on rook's graphs
- Every regular graph is a quasigroup graph
- Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups
- Practical graph isomorphism. II.
- Bounds on the number of autotopisms and subsquares of a Latin square
- Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\)
- Symmetries of partial Latin squares
- On the number of Latin squares
- Atomic Latin squares based on cyclotomic orthomorphisms
- A lattice-theoretical fixpoint theorem and its applications
- Counting Hamiltonian cycles in bipartite graphs
- Cycle structure of autotopisms of quasigroups and latin squares
- Near-automorphisms of Latin squares
- Small latin squares, quasigroups, and loops
- Study of Critical Sets in Latin Squares by using the Autotopism Group
- The recognition of symmetric latin squares
- An algorithm for counting short cycles in bipartite graphs
- Generating uniformly distributed random latin squares
- Atomic Latin squares of order eleven
- The Parameterized Complexity of Counting Problems
- Symmetries that latin squares inherit from 1‐factorizations
- Cycle structures of autotopisms of the Latin squares of order up to 11
- Quasigroup automorphisms and the Norton-Stein complex
- Colouring games based on autotopisms of Latin hyper-rectangles
- Autoparatopisms of Quasigroups and Latin Squares
- Graph isomorphism in quasipolynomial time [extended abstract]
- Partial Latin Squares Having a Santilli’s Autotopism in their Autotopism Groups
- The Order of Automorphisms of Quasigroups
- A generalization of transversals for Latin squares
This page was built for publication: Refining invariants for computing autotopism groups of partial Latin rectangles
