Abstract
The number of finite semigroups increases rapidly with the number of elements. Since existing counting formulae do not give the complete number of semigroups of given order up to equivalence, the remainder can only be found by careful search. We describe the use of mathematical results combined with distributed Constraint Satisfaction to show that the number of non-equivalent semigroups of order 10 is 12,418,001,077,381,302,684. This solves a previously open problem in Mathematics, and has directly led to improvements in Constraint Satisfaction technology.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amazon Elastic Compute Cloud, Amazon EC2 (2008), http://aws.amazon.com/ec2/
Bilous, R.T., Van Rees, G.H.J.: An enumeration of binary self-dual codes of length 32. Des. Codes Cryptography 26(1-3), 61–86 (2002), http://dx.doi.org/10.1023/A:1016544907275
Cohen, D., Jeavons, P., Jefferson, C., Petrie, K.E., Smith, B.M.: Symmetry Definitions for Constraint Satisfaction Problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 17–31. Springer, Heidelberg (2005)
Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Aiello, L.C., Doyle, J., Shapiro, S. (eds.) KR 1996: Principles of Knowledge Representation and Reasoning, pp. 148–159. Morgan Kaufmann, San Francisco (1996)
Distler, A.: Classification and Enumeration of Finite Semigroups. Shaker Verlag, Aachen (2010), also PhD thesis, University of St Andrews (2010), http://hdl.handle.net/10023/945
Distler, A., Kelsey, T.: The Monoids of Order Eight and Nine. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC/Calculemus/MKM 2008. LNCS (LNAI), vol. 5144, pp. 61–76. Springer, Heidelberg (2008)
Distler, A., Kelsey, T.: The monoids of orders eight, nine & ten. Ann. Math. Artif. Intell. 56(1), 3–21 (2009)
Distler, A., Mitchell, J.D.: The number of nilpotent semigroups of degree 3. Electron. J. Combin. 19(2), Research Paper 51 (2012)
Forsythe, G.E.: SWAC computes 126 distinct semigroups of order 4. Proc. Amer. Math. Soc. 6, 443–447 (1955)
Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Propagation algorithms for lexicographic ordering constraints. Artificial Intelligence 170, 834 (2006)
The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.4.12 (2008), http://www.gap-system.org
Gecode: Generic constraint development environment, http://www.gecode.org/
Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast scalable constraint solver. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) The European Conference on Artificial Intelligence 2006 (ECAI 2006), pp. 98–102. IOS Press (2006)
Gent, I.P., Jefferson, C., Miguel, I.: Watched Literals for Constraint Propagation in Minion. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 182–197. Springer, Heidelberg (2006)
Howie, J.M.: Fundamentals of semigroup theory, London Mathematical Society Monographs. New Series, vol. 12. The Clarendon Press, Oxford University Press, New York (1995), Oxford Science Publications
Jefferson, C.: Quicklex - a case study in implementing constraints with dynamic triggers. In: Proceedings of the ERCIM Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2011 (2011)
Jürgensen, H., Wick, P.: Die Halbgruppen der Ordnungen ≤ 7. Semigroup Forum 14(1), 69–79 (1977)
Katritzky, A., Hall, C., El-Gendy, B., Draghici, B.: Tautomerism in drug discovery. Journal of Computer-Aided Molecular Design 24, 475–484 (2010), http://dx.doi.org/10.1007/s10822-010-9359-z , doi:10.1007/s10822-010-9359-z
Klee Jr., V.L.: The November meeting in Los Angeles. Bull. Amer. Math. Soc. 62(1), 13–23 (1956), http://dx.doi.org/10.1090/S0002-9904-1956-09973-2
Kotthoff, L., Moore, N.C.: Distributed solving through model splitting. In: 3rd Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), pp. 26–34 (2010)
Kreher, D., Stinson, D.: Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press (1998)
Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood recording from restarts. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, pp. 131–136 (2007)
McKay, B.D.: Transitive graphs with fewer than twenty vertices. Math. Comp. 33(147), 1101–1121 (1979), contains microfiche supplement
McKay, B.D., Royle, G.F.: The transitive graphs with at most 26 vertices. Ars Combin. 30, 161–176 (1990)
Milletti, F., Storchi, L., Sforna, G., Cross, S., Cruciani, G.: Tautomer enumeration and stability prediction for virtual screening on large chemical databases. Journal of Chemical Information and Modeling 49(1), 68–75 (2009), http://pubs.acs.org/doi/abs/10.1021/ci800340j
Motzkin, T.S., Selfridge, J.L.: Semigroups of order five. Presented in [19] (1955)
Petrie, K.E., Smith, B.M.: Symmetry Breaking in Graceful Graphs. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 930–934. Springer, Heidelberg (2003)
Plemmons, R.J.: There are 15973 semigroups of order 6. Math. Algorithms 2, 2–17 (1967)
Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)
Satoh, S., Yama, K., Tokizawa, M.: Semigroups of order 8. Semigroup Forum 49(1), 7–29 (1994)
Thain, D., Tannenbaum, T., Livny, M.: Distributed computing in practice: The Condor experience. Concurrency – Practice and Experience 17(2-4), 323–356 (2005)
Yamanaka, K., Otachi, Y., Nakano, S.-I.: Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract). In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 141–150. Springer, Heidelberg (2009), http://dx.doi.org/10.1007/978-3-642-00202-1_13
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Distler, A., Jefferson, C., Kelsey, T., Kotthoff, L. (2012). The Semigroups of Order 10. In: Milano, M. (eds) Principles and Practice of Constraint Programming. CP 2012. Lecture Notes in Computer Science, vol 7514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33558-7_63
Download citation
DOI: https://doi.org/10.1007/978-3-642-33558-7_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33557-0
Online ISBN: 978-3-642-33558-7
eBook Packages: Computer ScienceComputer Science (R0)