The construction of large sets of indempotent quasigroups
European Journal of Combinatorics
Implementing the Davis–Putnam Method
Journal of Automated Reasoning
The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Automatic generation of some results in finite algebra
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
SEM: a system for enumerating models
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A powerful technique to eliminate isomorphism in finite model search
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Hi-index | 0.00 |
A collection of n茂戮驴 2 idempotent quasigroups of order nis called a large set if any two of them are disjoint, denoted by LIQ(n). While the existence of ordinary LIQ(n) has been extensively studied, the spectrums of large sets of idempotent quasigroups with various identities remain open, for example, large set of Steiner pentagon quasigroups of order 11 which is denoted by LSPQ(11). This paper describes some computer searching efforts seeking to solve such problems. A series of results are obtained, including the non-existence of LSPQ(11).