Authors: Parascovia Syrbu
Keywords: quasigroup, recursive derivative, recursively differentiable quasigroup
Abstract
The recursive derivatives of an algebraic operation are
defined in \cite{CousGonzMarkNech98}, where they appear as control
mappings of complete recursive codes. It is proved in
\cite{CousGonzMarkNech98}, in particular, that the recursive
derivatives of order up to $r$ of a finite binary quasigroup
$(Q,\cdot )$ are quasigroup operations if and only if $(Q,\cdot )$
defines a recursive MDS-code of length $r+3$. The author of the
present note gives an algebraic proof of an equivalent statement:
a finite binary quasigroup $(Q,\cdot )$ is recursively
$r$-differentiable $(r\geq 0)$ if and only if the system
consisting of its recursive derivatives of order up to $r$ and of
the binary selectors, is orthogonal. This involves the fact that
the maximum order of recursive differentiability of a finite
binary quasigroup of order $q$ does not exceed $q-2$.
Moldova State University,
Department of Mathematics
E-mail:
DOI
https://doi.org/10.56415/basm.y2023.i3.p103
Fulltext

–
0.08 Mb