Computing automorphisms of semigroups.
From MaRDI portal
Publication:846358
DOI10.1016/j.jsc.2009.10.001zbMath1186.20049OpenAlexW1997841430MaRDI QIDQ846358
P. V. Bünau, Max Neunhöffer, João Araújo, James D. Mitchell
Publication date: 9 February 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2009.10.001
Symbolic computation and algebraic computation (68W30) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Semigroups of transformations, relations, partitions, etc. (20M20) Mappings of semigroups (20M15)
Related Items (9)
Orbits of primitive $k$-homogenous groups on $(n-k)$-partitions with applications to semigroups ⋮ Enumerating transformation semigroups ⋮ On groups generated by involutions of a semigroup. ⋮ HOMOGENEOUS COMPLETELY SIMPLE SEMIGROUPS ⋮ The semigroups of order 9 and their automorphism groups. ⋮ The largest subsemilattices of the endomorphism monoid of an independence algebra. ⋮ Computing finite semigroups ⋮ \(\aleph_0\)-categoricity of semigroups. II. ⋮ Convolution type \(C^*\)-algebras
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semigroups of mappings on graphs
- A method of finding automorphism groups of endomorphism monoids of relational systems.
- Largest subsemigroups of the full transformation monoid.
- Completely O-simple semigroups and their associated graphs and groups
- The Magma algebra system. I: The user language
- Automorphism group computation and isomorphism testing in finite groups
- Automorphism groups of centralizers of idempotents.
- Über ein Programm zu Berechnung der Automorphismengruppe einer endlichen Gruppe
- How comprehensive is the category of semigroups?
- On the endomorphism semigroup (and category) of bounded lattices
- Automorphisms of normal transformation semigroups
- AUTOMORPHISMS OF ENDOMORPHISM MONOIDS OF RELATIVELY FREE BANDS
- Automorphisms of normal partial transformation semigroups
- Automorphisms of transformation semigroups
- Automorphisms of transformation semigroups
- Algorithms for computing finite semigroups
- CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
- Semigroup structures for families of functions, I. Some Homomorphism Theorems
- Semigroups and rings of endomorphisms of linear spaces. I
- Ordered sets, semilattices, distributive lattices and Boolean algebras with homomorphic endomorphism semigroups
- Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)
- On definability of hypergraphs by their semigroups of homomorphisms
This page was built for publication: Computing automorphisms of semigroups.
