On semigroup presentations and Adian graphs.
From MaRDI portal
Publication:2483416
Let \(\mathcal P\) be a semigroup presentation of the form \(\langle a_1,\dots,a_n\mid w_1=a_1,\dots,w_n=a_n\rangle\). In this paper we consider the semigroup defined by \(\mathcal P\) and its Adian graphs. We show that if both Adian graphs of \(\mathcal P\) are connected and if one of the Adian graphs of \(\mathcal P\) is a cycle graph then \(\mathcal P\) defines a group.
Recommendations
- On Cayley graphs of semilattices of semigroups.
- scientific article; zbMATH DE number 3396224
- scientific article; zbMATH DE number 2015515
- On connected Cayley graphs of semigroups.
- On cyclic graphs of finite semigroups.
- scientific article; zbMATH DE number 3898926
- PRESENTATIONS FOR SEMIGROUPS AND SEMIGROUPOIDS
- The structure of semigroups that admit outerplanar Cayley graphs.
- On semigroup presentations
- The groupoids of adaptable separated graphs and their type semigroups
Cites work
- scientific article; zbMATH DE number 52907 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 1421029 (Why is no real title available?)
- Minimal presentations and efficiency of semigroups
- On defining groups efficiently without using inverses
- On semigroup presentations and efficiency
- The semigroup efficiency of groups and monoids
Cited in
(6)- Semigroups related to certain group presentations.
- On semigroup presentations that define a group.
- On the solvability of word problem by Adian graphs.
- scientific article; zbMATH DE number 4073300 (Why is no real title available?)
- On semigroups defined by Coxeter-type presentations
- Adjan's theorem and conjugacy in semigroups
This page was built for publication: On semigroup presentations and Adian graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483416)