Projects per year
Abstract
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of order ten or less. Our approach is novel, using computer algebra to break symmetry and constraint satisfaction search to find candidate solutions. We present new results in algebraic combinatorics: up to isomorphism and anti-isomorphism, there are 858,977 monoids of order eight; 1,844,075,697 monoids of order nine and 52,991,253,973,742 monoids of order ten.
Original language | English |
---|---|
Pages (from-to) | 3-21 |
Number of pages | 19 |
Journal | Annals of Mathematics and Artificial Intelligence |
Volume | 56 |
Issue number | 1 |
DOIs | |
Publication status | Published - May 2009 |
Keywords
- Monoids
- Enumeration combinatorics
- AI search
Fingerprint
Dive into the research topics of 'The Monoids of Orders Eight, Nine & Ten'. Together they form a unique fingerprint.Projects
- 1 Finished
-
EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Linton, S. A. (PI), Gent, I. P. (CoI), Leonhardt, U. (CoI), Mackenzie, A. (CoI), Miguel, I. J. (CoI), Quick, M. (CoI) & Ruskuc, N. (CoI)
1/09/05 → 31/08/10
Project: Standard
Research output
- 1 Conference contribution
-
The semigroups of order 10
Distler, A., Jefferson, C. A., Kelsey, T. & Kotthoff, L., 2012, Principles and Practice of Constraint Programming: 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012. Proceedings. Milano, M. (ed.). Springer, p. 883-899 17 p. (Lecture Notes in Computer Science; vol. 7514).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution