On reducibility of n-ary quasigroups

Details On reducibility of n-ary quasigroups On reducibility of n-ary quasigroups

2006-07-12

arxiv.org/abs/math/0607284v2

Discrete Math. 308(22) 2008, 5289-5297

Mathematics

Combinatorics

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

Scientific paper

10.1016/j.disc.2007.08.099

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 $10$ 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

Affiliated with

Also associated with

No associations

Rating

On reducibility of n-ary quasigroups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On reducibility of n-ary quasigroups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On reducibility of n-ary quasigroups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-168815