Orthogonal Latin squares based on groups
From MaRDI portal
Publication:721708
DOI10.1007/978-3-319-94430-2zbMath1404.05002OpenAlexW2886640757MaRDI QIDQ721708
Publication date: 19 July 2018
Published in: Developments in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-94430-2
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Orthogonal arrays, Latin squares, Room squares (05B15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (21)
Equivalence of Butson-type Hadamard matrices ⋮ Coset-wise affine functions and cycle types of complete mappings ⋮ Cycle types of complete mappings of finite fields ⋮ An asymptotic for the Hall-Paige conjecture ⋮ Cycles of quadratic Latin squares and antiperfect 1‐factorisations ⋮ ON THE NUMBER OF QUADRATIC ORTHOMORPHISMS THAT PRODUCE MAXIMALLY NONASSOCIATIVE QUASIGROUPS ⋮ Unnamed Item ⋮ Row‐Hamiltonian Latin squares and Falconer varieties ⋮ Difference matrices with four rows over generalized dihedral groups ⋮ Compositions and parities of complete mappings and of orthomorphisms ⋮ Isomorphisms of quadratic quasigroups ⋮ Partial orthomorphisms and Latin squares based on parts of a group ⋮ All group‐based latin squares possess near transversals ⋮ Unnamed Item ⋮ Latin squares with maximal partial transversals of many lengths ⋮ Degree of orthomorphism polynomials over finite fields ⋮ Idempotent solutions of the Yang–Baxter equation and twisted group division ⋮ Maximally nonassociative quasigroups via quadratic orthomorphisms ⋮ Finite groups with an automorphism that is a complete mapping ⋮ A note on a pair of orthogonal orthomorphisms of cyclic groups ⋮ Nonassociative triples in involutory loops and in loops of small order
This page was built for publication: Orthogonal Latin squares based on groups
