Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On the number of n-ary quasigroups of finite order
-
V. N. Potapov
Veröffentlicht/Copyright:
1. Mai 2011
Published Online: 2011-05
Published in Print: 2011-05
©2012 by Walter de Gruyter GmbH & Co.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- On the stability radius of an efficient solution of a multicriteria portfolio optimisation problem with the Savage criteria
- On minimisation of the double-sided shadow in the unit cube
- On the singular series in the Waring–Goldbach problem with shifted primes
- On the number of n-ary quasigroups of finite order
- An algorithm for construction of the annihilator of a polylinear recurring sequence over a finite commutative ring
- Minor rank, zeros of the determinant of a Boolean matrix, and their applications
- On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number
- A fast algorithm for the construction of polynomials modulo k for k-valued functions for composite k
- The best asymptotic representation of Boolean functions by information graphs
- A criterion for reducibility of the problem on dangerous closeness to one-dimensional interval search
- A criterion for a partial prediction of general regular superevents
- On construction of an explicit basis for admissible inference rules of modal logics extending S4.1
Artikel in diesem Heft
- On the stability radius of an efficient solution of a multicriteria portfolio optimisation problem with the Savage criteria
- On minimisation of the double-sided shadow in the unit cube
- On the singular series in the Waring–Goldbach problem with shifted primes
- On the number of n-ary quasigroups of finite order
- An algorithm for construction of the annihilator of a polylinear recurring sequence over a finite commutative ring
- Minor rank, zeros of the determinant of a Boolean matrix, and their applications
- On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number
- A fast algorithm for the construction of polynomials modulo k for k-valued functions for composite k
- The best asymptotic representation of Boolean functions by information graphs
- A criterion for reducibility of the problem on dangerous closeness to one-dimensional interval search
- A criterion for a partial prediction of general regular superevents
- On construction of an explicit basis for admissible inference rules of modal logics extending S4.1