An n-ary operation Q : Σn → Σ is called an n-ary quasigroup of order |Σ | if in the equation x0 = Q (x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. An n-ary quasigroup Q is (permutably) reducible if Q (x1, . . . , xn) = P(R(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n)) where P and R are (n − k + 1)-ary… (More)
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.