Enumerating transformation semigroups
From MaRDI portal
Publication:1677265
Abstract: We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation semigroups up to degree 4. Classification of these semigroups up to conjugacy, isomorphism and anti-isomorphism, by size and rank, provides a solid base for further investigations of transformation semigroups.
Recommendations
Cites work
- A Census of Finite Automata
- A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
- Classical finite transformation semigroups. An introduction.
- Computation of the transformation semigroups on three letters
- Computing automorphisms of semigroups.
- Counting finite posets and topologies
- Die Halbgruppen der Ordnungen \(\leq 7\)
- scientific article; zbMATH DE number 2186890 (Why is no real title available?)
- scientific article; zbMATH DE number 5778567 (Why is no real title available?)
- scientific article; zbMATH DE number 3391078 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- scientific article; zbMATH DE number 3092583 (Why is no real title available?)
- scientific article; zbMATH DE number 3111929 (Why is no real title available?)
- Idempotent generators in finite full transformation semigroups
- Idempotent rank in finite full transformation semigroups
- Maximal subsemigroups of finite semigroups
- On the automorphism group of the full transformation semigroups
- On the ranks of certain finite semigroups of transformations
- On the representation of abstract semigroups by transformation semigroups: Computer investigations
- Semigroups of order 8
- SWAC Computes 126 Distinct Semigroups of Order 4
- The monoids of orders eight, nine \& ten.
- The number of nilpotent semigroups of degree 3.
- The Number of Semigroups of Order n
- The semigroups of order 9 and their automorphism groups.
Cited in
(10)- On the representation of abstract semigroups by transformation semigroups: Computer investigations
- Enumeration of the elements of a symmetric semigroup
- Computing maximal subsemigroups of a finite semigroup
- Enumeration of finite inverse semigroups
- scientific article; zbMATH DE number 1047933 (Why is no real title available?)
- Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples
- Counting monogenic monoids and inverse monoids
- Minimum degrees of finite rectangular bands, null semigroups, and variants of full transformation semigroups
- Minimum transformation representations of diagram monoids
- Semirigidity and the enumeration of nilpotent semigroups of index three
This page was built for publication: Enumerating transformation semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677265)