On reducibility of n-ary quasigroups
Denis Krotov
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
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.