On reducibility of n-ary quasigroups

Abstract

An n-ary operation Q:Sn -> S is called an n-ary quasigroup of order |S| if in the equation x0=Q(x1,...,xn) knowledge of any n elements of x0, ..., xn uniquely specifies the remaining one. Q is permutably reducible if Q(x1,...,xn)=P(R(xs(1),...,xs(k)),xs(k+1),...,xs(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

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…