On the number of n-ary quasigroups of finite order

preprint2016arXivOpen access

Abstract

Let Q(n,k)Q(n,k) be the number of nn-ary quasigroups of order kk. We derive a recurrent formula for Q(n,4). We prove that for all n≥2n\geq 2 and k≥5k\geq 5 the following inequalities hold: (k−3/2)n/2(k−12)n/2<log2Q(n,k)≤ck(k−2)n({k-3}/2)^{n/2}(\frac{k-1}2)^{n/2} < log_2 Q(n,k) \leq {c_k(k-2)^{n}} , where ckc_k does not depend on nn. So, the upper asymptotic bound for Q(n,k)Q(n,k) is improved for any k≥5k\geq 5 and the lower bound is improved for odd k≥7k\geq 7. Keywords: n-ary quasigroup, latin cube, loop, asymptotic estimate, component, latin trade.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.