Computing Autotopism Groups of Partial Latin Rectangles

DOI10.1145/3412324zbMath1525.05016OpenAlexW3089486988WikidataQ113268493 ScholiaQ113268493MaRDI QIDQ6043670

Raúl M. Falcón, Daniel Kotlar, Rebecca J. Stones, Trent G. 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

zbMATH Keywords

Latin squarepartial Latin rectangleautotopism

Mathematics Subject Classification ID

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

Related Items (max. 100)

A census of critical sets based on non-trivial autotopisms of Latin squares of order up to five ⋮ A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares

Cites Work

• 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
• Using a CAS/DGS to analyze computationally the configuration of planar bar linkage mechanisms based on partial Latin squares
• Classification algorithms for codes and designs
• Research problems from the BCC22
• On the number of 8\(\times 8\) Latin squares
• The many formulae for the number of Latin rectangles
• The spectrum for quasigroups with cyclic automorphisms and additional symmetries.
• A general backtrack algorithm for the isomorphism problem of combinatorial objects
• An algorithm for computing the automorphism group of a Hadamard matrix
• 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
• An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
• Most Latin squares have many subsquares
• Loops of order \(p^ n+1\) with transitive automorphism groups
• Perfect hash families: Probabilistic methods and explicit constructions
• The QAP-polytope and the graph isomorphism problem
• Classification of Hadamard matrices of order 44 with automorphisms of order 7
• Autotopism stabilized colouring games on rook's graphs
• Enumerating partial Latin rectangles
• Refining invariants for computing autotopism groups of partial Latin rectangles
• A historical perspective of the theory of isotopisms
• Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method
• 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
• Strongly regular graphs, partial geometries and partially balanced designs
• Cycle structure of autotopisms of quasigroups and latin squares
• Near-automorphisms of Latin squares
• The number of Latin squares of order 11
• Small latin squares, quasigroups, and loops
• The recognition of symmetric latin squares
• Computing automorphism groups of error-correcting codes
• Minimal Edge-Colourings of Complete Graphs
• On the chromatic index and the cover index of a multigraph
• The graph isomorphism disease
• Generating uniformly distributed random latin squares
• Isomorph-Free Exhaustive Generation
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• On the Placement Delivery Array Design for Centralized Coded Caching Scheme
• Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers
• 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
• An improved isomorphism test for bounded-tree-width graphs
• GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM
• K-Plex 2-Erasure Codes and Blackburn Partial Latin Squares
• Seeded graph matching via large neighborhood statistics
• Colouring games based on autotopisms of Latin hyper-rectangles
• Canonical form for graphs in quasipolynomial time: preliminary report
• A unifying method for the design of algorithms canonizing combinatorial objects
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
• A spectral assignment approach for the graph isomorphism problem
• Autoparatopisms of Quasigroups and Latin Squares
• Graph isomorphism in quasipolynomial time [extended abstract]
• On the n^{log n} isomorphism technique (A Preliminary Report)
• Partial Latin Squares Having a Santilli’s Autotopism in their Autotopism Groups
• The Order of Automorphisms of Quasigroups
• Parent-identifying codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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