Computing Autotopism Groups of Partial Latin Rectangles

DOI10.1145/3412324zbMATH Open1525.05016OpenAlexW3089486988WikidataQ113268493 ScholiaQ113268493MaRDI QIDQ6043670FDOQ6043670

Authors: Douglas S. Stones, Raúl M. Falcón, Daniel Kotlar, Trent Gregory Marbach 

Publication date: 23 May 2023

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3412324

Recommendations

• Refining invariants for computing autotopism groups of partial Latin rectangles
• Two-line graphs of partial Latin rectangles
• Computing the autotopy group of a Latin square by cycle structure
• Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups
• Symmetries of partial Latin squares

zbMATH Keywords

Latin squareautotopismpartial Latin rectangle

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Practical graph isomorphism. II.
• An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
• On the number of Latin squares
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Title not available (Why is that?)
• Classification algorithms for codes and designs
• The many formulae for the number of Latin rectangles
• The graph isomorphism disease
• Title not available (Why is that?)
• Bounds on the number of autotopisms and subsquares of a Latin square
• Cycle structure of autotopisms of quasigroups and Latin squares
• Small latin squares, quasigroups, and loops
• Title not available (Why is that?)
• Generating uniformly distributed random latin squares
• Cycle structures of autotopisms of the Latin squares of order up to 11.
• Title not available (Why is that?)
• Perfect hash families: Probabilistic methods and explicit constructions
• Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method
• The number of Latin squares of order 11
• Classifying partial Latin rectangles
• The set of autotopisms of partial Latin squares
• Engineering an efficient canonical labeling tool for large and sparse graphs
• Isomorph-Free Exhaustive Generation
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• The spectrum for quasigroups with cyclic automorphisms and additional symmetries.
• Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\)
• Quasigroup automorphisms and symmetric group characters.
• Near-automorphisms of Latin squares
• Quasigroup automorphisms and the Norton-Stein complex.
• Atomic Latin squares based on cyclotomic orthomorphisms
• Title not available (Why is that?)
• Computing the autotopy group of a Latin square by cycle structure
• Parity types, cycle structures and autotopisms of Latin squares
• Symmetries that latin squares inherit from 1‐factorizations
• Title not available (Why is that?)
• Strongly regular graphs, partial geometries and partially balanced designs
• On the \(n\log{n}\) isomorphism technique (preliminary report)
• The Order of Automorphisms of Quasigroups
• Research problems from the BCC22
• On uniformly generating Latin squares
• Most Latin squares have many subsquares
• Graph isomorphism in quasipolynomial time (extended abstract)
• Parent-identifying codes
• Enumerating partial Latin rectangles
• GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM
• A historical perspective of the theory of isotopisms
• Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups
• Symmetries of partial Latin squares
• Using a CAS/DGS to analyze computationally the configuration of planar bar linkage mechanisms based on partial Latin squares
• On the number of 8\(\times 8\) Latin squares
• Computing automorphism groups of error-correcting codes
• Title not available (Why is that?)
• An algorithm for computing the automorphism group of a Hadamard matrix
• On the chromatic index and the cover index of a multigraph
• An improved isomorphism test for bounded-tree-width graphs
• Minimal Edge-Colourings of Complete Graphs
• Classification of Hadamard matrices of order 44 with automorphisms of order 7
• Title not available (Why is that?)
• Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers
• A general backtrack algorithm for the isomorphism problem of combinatorial objects
• Title not available (Why is that?)
• Title not available (Why is that?)
• The recognition of symmetric latin squares
• Loops of order \(p^ n+1\) with transitive automorphism groups
• The QAP-polytope and the graph isomorphism problem
• Title not available (Why is that?)
• Partial Latin Squares Having a Santilli’s Autotopism in their Autotopism Groups
• Autoparatopisms of Quasigroups and Latin Squares
• A unifying method for the design of algorithms canonizing combinatorial objects
• A spectral assignment approach for the graph isomorphism problem
• Autotopism stabilized colouring games on rook's graphs
• Latin squares associated to principal autotopisms of long cycles. Application in cryptography
• Colouring games based on autotopisms of Latin hyper-rectangles
• Refining invariants for computing autotopism groups of partial Latin rectangles
• K-Plex 2-Erasure Codes and Blackburn Partial Latin Squares
• The classification construction and the non-isomorphism counting of symmetric Latin square
• On the Placement Delivery Array Design for Centralized Coded Caching Scheme
• Canonical form for graphs in quasipolynomial time: preliminary report

Cited In (4)

• A computational algebraic geometry approach to analyze pseudo-random sequences based on 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

This page was built for publication: Computing Autotopism Groups of Partial Latin Rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043670)