RO EN
A new method for computing the number of n-quasigroups.
Authors: S. Markovski, V. Dimitrova, A. Mileva
– 0.12 Mb
Abstract
We use the isotopy classes of quasigroups for computing the numbers of finite n-quasigroups (n=1,2,3,...). The computation is based on the property that every two isotopic n-quasigroups are substructures of the same number of n+1-quasigroups. This is a new method for computing the number of n-quasigroups and in an enough easy way we could compute the numbers of ternary quasigroups of orders up to and including 5 and of quaternary quasigroups of orders up to and including 4.E-mails: ,
Fulltext
– 0.12 Mb
Contents
- Lie algebras of operators and invariant GL(2, ℜ)-integrals for Darboux type differential systems.
- Measure of stability for a finite cooperative game with a generalized concept of equilibrium.
- Collocation and Quadrature Methods for Solving Singular Integral Equations with Piecewise Continuous Coefficients.
- Criterion of parametrical completeness in the 6-element non-chain extension of Intuitionistic logic of A. Heyting.
- Linear stability bounds in a convection problem for variable gravity field.
- A new method for computing the number of n-quasigroups.
- The GL(2, ℜ)-orbits of polynomial differential systems of degree four.
- A Linear Parametrical Programming Approach for Studying and Solving Bilinear Programming Problem.
- On topological torsion LCA groups with commutative ring of continuous endomorphisms.
- Natural classes and torsion free classes in categories of modules.
- Finite difference schemes for problems of mixture of two component elastic materials.
- Characteristic functions of Markovian random evolutions in ℜm.
- Nearly simple elementary divisor domains.
- Factorization theorems for some spaces of analytic functions.
