Academia.eduAcademia.edu

2 Values of a(n) for small n  For 1 <n < 6, the values of a(n) have been determined in Jezek-Kepka [3]. Using a1 >xhaustive computer search we found the value of a(7). In addition, we have obtained a1 upper bound on a(8). With respect to Theorem 1.1, we looked for an idempotent quasi croup with the minimum number of associative triples. Our computational experiments d not provide any evidence that the extremal quasigroups should be idempotent. Therefore 11 the future we plan to seek a lower bound on a(n) that will not include the invariant i(Q) The left column of Table | contains the values of a(n) while the right column contains thi minimum number of associative triples over all idempotent quasigroups.  Tn [4] the anthoare nrecent an evampnle afidemnnatent qnacoraimn OO af arder 7 with v() —-   Table 1 Extremal values of a(Q) for general and idempotent quasigroups

Table 1 2 Values of a(n) for small n For 1 <n < 6, the values of a(n) have been determined in Jezek-Kepka [3]. Using a1 >xhaustive computer search we found the value of a(7). In addition, we have obtained a1 upper bound on a(8). With respect to Theorem 1.1, we looked for an idempotent quasi croup with the minimum number of associative triples. Our computational experiments d not provide any evidence that the extremal quasigroups should be idempotent. Therefore 11 the future we plan to seek a lower bound on a(n) that will not include the invariant i(Q) The left column of Table | contains the values of a(n) while the right column contains thi minimum number of associative triples over all idempotent quasigroups. Tn [4] the anthoare nrecent an evampnle afidemnnatent qnacoraimn OO af arder 7 with v() —- Table 1 Extremal values of a(Q) for general and idempotent quasigroups