The Monoids of Orders Eight, Nine & Ten

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)3-21
Number of pages19
JournalAnnals of Mathematics and Artificial Intelligence
Volume56
Issue number1
DOIs
Publication statusPublished - 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.
  • 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 proceedingConference contribution

Cite this