On reducibility of n-ary quasigroups

Abstract

An $n$-ary operation $Q:S^n->S$ is called an $n$-ary quasigroup of order $|S|$ if in the equation $x_0=Q(x_1,...,x_n)$ knowledge of any $n$ elements of $x_0$, ..., $x_n$ uniquely specifies the remaining one. $Q$ is permutably reducible if $Q(x_1,...,x_n)=P(R(x_{s(1)},...,x_{s(k)}),x_{s(k+1)},...,x_{s(n)})$ where $P$ and $R$ are $(n-k+1)$-ary and $k$-ary quasigroups, $s$ is a permutation, and $1<k<n$. An $m$-ary quasigroup $S$ is called a retract of $Q$ if it can be obtained from $Q$ or one of its inverses by fixing $n-m>0$ arguments. We prove that if the maximum arity of a permutably irreducible retract of an $n$-ary quasigroup $Q$ belongs to $\{3,...,n-3\}$, then $Q$ is permutably reducible. Keywords: n-ary quasigroups, retracts, reducibility, distance 2 MDS codes, latin hypercubes

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

References in corpus (3)

• Asymptotics for the number of n-quasigroups of order 4
• On decomposability of 4-ary distance 2 MDS codes, double-codes, and n-quasigroups of order 4
• On irreducible n-ary quasigroups with reducible retracts

Cited by in corpus (5)

• n-Ary quasigroups of order 4
• On connection between reducibility of an n-ary quasigroup and that of its retracts
• Distance-2 MDS codes and latin colorings in the Doob graphs
• On a connection between the switching separability of a graph and that of its subgraphs
• On a test on switching separability of graphs modulo $q$