Related papers: On reducibility of n-ary quasigroups

An $n$-ary operation $Q:S^n\to 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. An $n$-ary quasigroup $Q$ is…

An n-ary operation q:A^n->A is called an n-ary quasigroup of order |A| if in x_0=q(x_1,...,x_n) knowledge of any n elements of x_0,...,x_n uniquely specifies the remaining one. An n-ary quasigroup q is permutably reducible if…

We characterize the set of all N-ary quasigroups of order 4: every N-ary quasigroup of order 4 is permutably reducible or semilinear. Permutable reducibility means that an N-ary quasigroup can be represented as a composition of K-ary and…

(1) We prove that, provided n>=4, a permutably reducible n-ary quasigroup is uniquely specified by its values on the n-ples containing zero. (2) We observe that for each n,k>=2 and r<=[k/2] there exists a reducible n-ary quasigroup of order…

An $n$-ary quasigroup $f$ of order $q$ is an $n$-ary operation over a set of cardinality $q$ such that the Cayley table of the operation is an $n$-dimensional latin hypercube of order $q$. A transversal in a quasigroup $f$ (or in the…

We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…

Let $X$ be a nonempty set. Denote by $\mathcal{F}^n_k$ the class of associative operations $F\colon X^n\to X$ satisfying the condition $F(x_1,\ldots,x_n)\in\{x_1,\ldots,x_n\}$ whenever at least $k$ of the elements $x_1,\ldots,x_n$ are equal…

An algebraic system from a finite set $\Sigma$ of cardinality $k$ and an $n$-ary operation $f$ invertible in each argument is called an $n$-ary quasigroup of order $k$. An autotopy of an $n$-ary quasigroup $(\Sigma,f)$ is a collection…

A quasigroup is a pair $(Q, *)$ where $Q$ is a non-empty set and $*$ is a binary operation on $Q$ such that for every $(a, b) \in Q^2$ there exists a unique $(x, y) \in Q^2$ such that $a*x=b=y*a$. Let $(Q, *)$ be a quasigroup. A pair $(x,…

A quasigroup $Q$ is called maximally nonassociative if for $x,y,z\in Q$ we have that $x\cdot (y\cdot z) = (x\cdot y)\cdot z$ only if $x=y=z$. We show that, with finitely many exceptions, there exists a maximally nonassociative quasigroup of…

It was claimed in [4] that for any integer $n\geqslant 2$, a neutral element can be adjoined to an $n$-ary semigroup if and only if the $n$-ary semigroup is reducible to a binary semigroup. We show that the `only if' direction of this…

Let $\mathcal{S}$ be a commutative semigroup, and let $T$ be a sequence of terms from the semigroup $\mathcal{S}$. We call $T$ an (additively) {\sl irreducible} sequence provided that no sum of its some terms vanishes. Given any element $a$…

We provide a description of the class of n-ary operations on an arbitrary chain that are quasitrivial, symmetric, nondecreasing, and associative. We also prove that associativity can be replaced with bisymmetry in the definition of this…

Let G be a linear Lie group. We define the G-reducibility of a continuous or discrete cocycle modulo N. We show that a G-valued continuous or discrete cocycle which is GL(n,C)-reducible is in fact G-reducible modulo 2 if…

A subset $S$ of $\{0,1,...,2t-1\}^n$ is called a $t$-fold MDS code if every line in each of $n$ base directions contains exactly $t$ elements of $S$. The adjacency graph of a $t$-fold MDS code is not connected if and only if the…

A subsemigroup S of a semigroup Q is a left order in Q and Q is a semigroup of left quotients of S if every element of Q can be expressed as a# b where a and b are elements of S and if, in addition, every element of S that is square…

A permutation group is said to be quasiregular if every its transitive constituent is regular, and a quasiregular coherent configuration can be thought as a combinatorial analog of such a group: the transitive constituents are replaced by…

A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written as an intersection of numerical semigroups properly…

Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a semigroup of left I-quotients of $S$ if every element in $Q$ can be written as $a^{-1}b$, where $a, b \in S$ and $a^{-1}$ is the inverse of $a$…

An $n$-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that…