Abstract
A collection of n − 2 idempotent quasigroups of order n is 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).
This work is supported by the National Natural Science Foundation of China (NSFC) under grant No. 60673044.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chang, Y.: The Spectrum for Large Sets of Idempotent Quasigroups. Journal of Combinatorial Designs (2000)
Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2007)
Dubois, O., Dequen, G.: The Non-existence of (3,1,2)-Conjugate Orthogonal Idempotent Latin Square of Order 10. In: Proc. of the 7th International Conference on Principles and Practice of Constraint Programming (2001)
Fujita, M., Slaney, J.K., Bennett, F.: Automatic Generation of Some Results in Finite Algebra. In: Proc. IJCAI, pp. 52–59 (1993)
Jia, X., Zhang, J.: A Powerful Technique to Eliminate Isomorphism in Finite Model Search. In: Proc. IJCAR, pp. 318–331 (2006)
Lindner, C.C., Stinson, D.R.: Steiner Pentagon Systems. Discrete Math. 52, 67–74 (1984)
McCune, W.: Mace4 Reference Manual and Guide. Technical Memorandum 264, Argonne National Laboratory, Argonne, IL, USA (2003)
Slaney, J., Fujita, M., Stickel, M.: Automated Reasoning and Exhaustive Search: Quasigroup Existence Problems. Computers and Mathematics with Applications 29, 115–132 (1995)
Teirlinck, L., Lindner, C.C.: The Construction of Large Sets of Idempotent Quasigroups. Eur. J. of Combin. 9, 83–89 (1988)
Zhang, H.: SATO: An Efficient Propositional Prover. In: Proc. of CADE, pp. 272–275 (1997)
Zhang, H., Stickel, M.: Implementing the Davis-Putnam Method. Journal of Automated Reasoning 24(1/2), 277–296 (2000)
Zhang, J., Zhang, H.: SEM: a System for Enumerating Models. In: Proc. of International Joint Conference on Artificial Intelligence, pp. 11–18 (1995)
Zhu, L.: Large Set Problems for Various Idempotent Quasigroups (July 2006)
Zhu, L.: Personal Communication (September 2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, F., Zhang, J. (2008). Computer Search for Large Sets of Idempotent Quasigroups . In: Kapur, D. (eds) Computer Mathematics. ASCM 2007. Lecture Notes in Computer Science(), vol 5081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87827-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-87827-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87826-1
Online ISBN: 978-3-540-87827-8
eBook Packages: Computer ScienceComputer Science (R0)