𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The spectrum for large sets of idempotent quasigroups

✍ Scribed by Yanxun Chang


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
73 KB
Volume
8
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis


In this article we construct a large set of idempotent quasigroups of order 14. Combined with the results in Chang, JCMCC; and Teirlinck and Lindner, Eur J Combin 9 (1988), 83Β±89, this shows that the spectrum for large sets of idempotent quasigroups of order n [brieΒ―y, LIQ(n)] is the set all integers n ! 3 with the exception of n 6.


πŸ“œ SIMILAR VOLUMES


The spectrum of 2-idempotent 3-quasigrou
✍ Lijun Ji; R. Wei πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 133 KB

## Abstract A ternary quasigroup (or 3‐quasigroup) is a pair (__N, q__) where __N__ is an __n__‐set and __q__(__x, y, z__) is a ternary operation on __N__ with unique solvability. A 3‐quasigroup is called 2‐idempotent if it satisfies the generalized idempotent law: __q__(__x, x, y__) = __q__(__x, y

The spectrum for large sets of disjoint
✍ Qing-De Kang; Jian-Guo Lei; Yan-Xun Chang πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 369 KB πŸ‘ 1 views

The spectrum for LMTS(v, 1) has been obtained by Kang and Lei (Bulletin of the ICA, 1993). In this article, firstly, we give the spectrum for LMTS(v,3). Furthermore, by the existence of LMTS(v, 1) and LMTS(v, 3), the spectrum for LMTS(v, A) is completed, that is Y = 2 (mod A), v 2 A + 2, if A # 0 (m

Using image pyramids for the visualizati
✍ Daniel F. Stanfill IV πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 892 KB

Viewing terrain data from various remote sensors in three dimensions has proven to be a valuable tool for scientists in understanding a variety of problems. A technique is presented for using image pyramids in such visualization of large terrain data sets, providing up to two orders of magnitude per

Selective sampling for approximate clust
✍ Liang Wang; James C. Bezdek; Christopher Leckie; Ramamohanarao Kotagiri πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 506 KB

A key challenge in pattern recognition is how to scale the computational efficiency of clustering algorithms on large data sets. The extension of non-Euclidean relational fuzzy c-means (NERF) clustering to very large (VL = unloadable) relational data is called the extended NERF (eNERF) clustering al