On irreducible n-ary quasigroups with reducible retracts

@article{Krotov2008OnIN,
  title={On irreducible n-ary quasigroups with reducible retracts},
  author={Denis S. Krotov},
  journal={Eur. J. Comb.},
  year={2008},
  volume={29},
  pages={507-513}
}
  • D. Krotov
  • Published 31 July 2006
  • Mathematics
  • Eur. J. Comb.

Figures from this paper

On reducibility of n-ary quasigroups
On connection between reducibility of an n-ary quasigroup and that of its retracts
On reconstructing reducible n-ary quasigroups and switching subquasigroups
(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 =4 and n>=3 we
n-Ary Quasigroups of Order 4
TLDR
Every n-ary quasigroups of order 4 is permutably reducible or semilinear, which means that an $n$-aryQuasigroup can be represented as a composition of $k-ary and $(n-k+1)$-aries for some $k$ from 2 to $n-1$, where the order of arguments in the representation can differ from the original order.
On extensions of partial n-quasigroups of order 4
We prove that every collection of pairwise compatible (nowhere coinciding) n-ary quasigroups of order 4 can be extended to an (n + 1)-ary quasigroup. In other words, every Latin 4×…×4 ×
On one test for the switching separability of graphs modulo q
We consider graphs whose edges are marked by numbers (weights) from 1 to q - 1 (with zero corresponding to the absence of an edge). A graph is additive if its vertices can be marked so that, for
ON SWITCHING NONSEPARABLE GRAPHS WITH SWITCHING SEPARABLE SUBGRAPHS
A graph of order n ≥ 4 is called switching separable if its modulo-2 sum with some complete bipartite graph on the same set of vertices is divided into two mutually independent subgraphs, each having
On connection between the switching separability of a graph and its subgraphs
A graph of order n ≥ 4 is called switching separable if its modulo-2 sum with some complete bipartite graph on the same set of vertices is divided into two mutually independent subgraphs, each having
On reducibility of n-ary quasigroups, II
An n-ary operation Q : Σ → Σ 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. Q

References

SHOWING 1-10 OF 15 REFERENCES
On reconstructing reducible n-ary quasigroups and switching subquasigroups
(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 =4 and n>=3 we
Solution of Belousov's problem
The authors prove that a local $n$-quasigroup defined by the equation x_{n+1} = F (x_1, ..., x_n) = [f_1 (x_1) + ... + f_n (x_n)]/[x_1 + ... + x_n], where f_i (x_i), i, j = 1, ..., n, are arbitrary
On decomposability of 4-ary distance 2 MDS codes, double-codes, and n-quasigroups of order 4
On reducibility of n-quasigroups
If the arity of a maximal irreducible retractof an n-quasigroup M belongs to {3, . . . , n − 3}, then M is reducible.
Asymptotics for the number of n-quasigroups of order 4
AbstractThe asymptotic form of the number of n-quasigroups of order 4 is $$3^{n + 1} 2^{2^n + 1} (1 + o(1))$$ .
Algebraic Graph Theory
TLDR
The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.
CRC Handbook of Combinatorial Designs
Balanced Incomplete Block Designs and t-Designs2-(v,k,l) Designs of Small OrderBIBDs with Small Block Sizet-Designs, t = 3Steiner SystemsSymmetric DesignsResolvable and Near Resolvable DesignsLatin
On reducibility of n-quasigroups, eprint math.CO/0607284, arXiv.org, available at http://arxiv.org/abs/math
  • On reducibility of n-quasigroups, eprint math.CO/0607284, arXiv.org, available at http://arxiv.org/abs/math
  • 2006
Krotov . On decomposability of distance 2 MDS codes
  • Proc . Ninth Int . Workshop on Algebraic and Combinatorial Coding Theory ACCT ’
  • 2004
Two-graphs
  • in: C. J. Colbourn, J. H. Dinitz (Eds.), CRC Handbook of Combinatorial Designs, Boca Raton, FL: CRC Press
  • 1996
...
1
2
...