Constructions of transitive Latin hypercubeatin hypercubes

DOI10.1016/J.EJC.2015.12.001MaRDI QIDQ5964255zbMATH OpenOpenAlexFDO

Authors Denis S. Krotov, Vladimir N. Potapov

Publication date 29 February 2016

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.0004

zbMATH Keywords

isotopically transitive Latin hypercube

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Abstract: A function $f:{0,\mathrm{...},q-1}^{n}o0,\mathrm{...},q-1$ invertible in each argument is called a latin hypercube. A collection $(p{i}_0,p{i}_1,\mathrm{...},p{i}_n)$ of permutations of $0,\mathrm{...},q-1$ is called an autotopism of a latin hypercube $f$ if $p{i}_{0}f(x_1,\mathrm{...},x_n)=f(p{i}_1{x}_1,\mathrm{...},p{i}_n{x}_n)$ for all $x_1$, ..., $x_n$. We call a latin hypercube isotopically transitive (topolinear) if its group of autotopisms acts transitively (regularly) on all $q^n$ collections of argument values. We prove that the number of nonequivalent topolinear latin hypercubes grows exponentially with respect to $sqrtn$ if $q$ is even and exponentially with respect to $n^2$ if $q$ is divisible by a square. We show a connection of the class of isotopically transitive latin squares with the class of G-loops, known in noncommutative algebra, and establish the existence of a topolinear latin square that is not a group isotope. We characterize the class of isotopically transitive latin hypercubes of orders $q=4$ and $q=5$. Keywords: transitive code, propelinear code, latin square, latin hypercube, autotopism, G-loop.

Recommendations

• scientific article; zbMATH DE number 5247093
• A Census of Small Latin Hypercubes
• Latin squares associated to principal autotopisms of long cycles. Application in cryptography
• scientific article; zbMATH DE number 3902666
• On transversals of homogeneous Latin squares

Cites work

• 10.17686/sced_rusnauka_2008-1040
• \(G\)-loops and permutation groups
• n-ary quasigroups of order 4.
• A Census of Small Latin Hypercubes
• A Class of Loops Which are Isomorphic to all Loop Isotopes
• An upper bound on the number of high-dimensional permutations
• Associativity in multiary quasigroups: The way of biased expansions
• Binary extended perfect codes of length 16 by the generalized concatenated construction
• Classification of Graeco-Latin Cubes
• scientific article; zbMATH DE number 6004879 (Why is no real title available?)
• scientific article; zbMATH DE number 4057820 (Why is no real title available?)
• scientific article; zbMATH DE number 4110626 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• Isotopy-isomorphy loops of prime order
• Maximising the permanent of (0,1)-matrices and the number of extensions of Latin rectangles
• On connection between reducibility of an \(n\)-ary quasigroup and that of its retracts.
• On extensions of partial \(n\)-quasigroups of order 4.
• On the Classification of MDS Codes
• On the number of transversal designs
• Propelinear 1-Perfect Codes From Quadratic Functions
• Quasidirect products of quasigroups
• Quasigroups. I
• Strong forms of orthogonality for sets of hypercubes
• Transitive nonpropelinear perfect codes

Cited in

(3)

• Constructing 2-arc-transitive covers of hypercubes
• scientific article; zbMATH DE number 5247093 (Why is no real title available?)
• On \(q\)-ary propelinear perfect codes based on regular subgroups of the general affine group

This page was built for publication: Constructions of transitive Latin hypercubeatin hypercubes

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