Name
Abstract | ||
|---|---|---|
It is well known that an inverse semigroup is completely semisimple if and only if it does not contain a copy of the bicyclic semigroup. We characterize the amalgams [S-1, S-2; U] of two finite inverse semigroups S-1, S-2 whose free product with amalgamation is completely semisimple and we show that checking whether the amalgamated free product of finite inverse semigroups contains a bicyclic subsemigroup is decidable by means of a polynomial time algorithm with respect to max{vertical bar S-1 vertical bar, vertical bar S-2 vertical bar}. Moreover we consider amalgams of finite inverse semigroups respecting the J-order proving that the free product with amalgamation is completely semisimple and we also provide necessary and sufficient conditions for the R-classes to be finite. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1142/S021819671000556X | INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION |
Keywords | Field | DocType |
Inverse semigroup, amalgam, bicyclic semigroup | Inverse,Discrete mathematics,Free product,Bicyclic semigroup,Combinatorics,Krohn–Rhodes theory,Algebra,Inverse semigroup,Inverse element,Special classes of semigroups,Semigroup,Mathematics | Journal |
Volume | Issue | ISSN |
20 | 1 | 0218-1967 |
Citations | PageRank | References |
1 | 0.48 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emanuele Rodaro | 1 | 55 | 15.63 |