English

On reducibility of n-ary quasigroups

Combinatorics 2008-10-13 v2 Group Theory

Abstract

An nn-ary operation Q:Sn>SQ:S^n -> S is called an nn-ary quasigroup of order S|S| if in the equation x0=Q(x1,...,xn)x_{0}=Q(x_1,...,x_n) knowledge of any nn elements of x0x_0, ..., xnx_n uniquely specifies the remaining one. QQ is permutably reducible if Q(x1,...,xn)=P(R(xs(1),...,xs(k)),xs(k+1),...,xs(n))Q(x_1,...,x_n)=P(R(x_{s(1)},...,x_{s(k)}),x_{s(k+1)},...,x_{s(n)}) where PP and RR are (nk+1)(n-k+1)-ary and kk-ary quasigroups, ss is a permutation, and 1<k<n1<k<n. An mm-ary quasigroup SS is called a retract of QQ if it can be obtained from QQ or one of its inverses by fixing nm>0n-m>0 arguments. We prove that if the maximum arity of a permutably irreducible retract of an nn-ary quasigroup QQ belongs to {3,...,n3}\{3,...,n-3\}, then QQ is permutably reducible. Keywords: n-ary quasigroups, retracts, reducibility, distance 2 MDS codes, latin hypercubes

Keywords

Cite

@article{arxiv.math/0607284,
  title  = {On reducibility of n-ary quasigroups},
  author = {Denis Krotov},
  journal= {arXiv preprint arXiv:math/0607284},
  year   = {2008}
}

Comments

13 pages; presented at ACCT'2004 v2: revised; bibliography updated; 2 appendixes