Computing Autotopism Groups of Partial Latin Rectangles

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

Cites work

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

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)