Characterizing pure, cryptic and Clifford inverse semigroups

Mario Petrich

Czechoslovak Mathematical Journal (2014)

  • Volume: 64, Issue: 4, page 1099-1112
  • ISSN: 0011-4642

Abstract

top
An inverse semigroup S is pure if e = e 2 , a S , e < a implies a 2 = a ; it is cryptic if Green’s relation on S is a congruence; it is a Clifford semigroup if it is a semillatice of groups. We characterize the pure ones by the absence of certain subsemigroups and a homomorphism from a concrete semigroup, and determine minimal nonpure varieties. Next we characterize the cryptic ones in terms of their group elements and also by a homomorphism of a semigroup constructed in the paper. We also characterize groups and Clifford semigroups in a similar way by means of divisors. The paper also contains characterizations of completely semisimple inverse and of combinatorial inverse semigroups in a similar manner. It ends with a description of minimal non- 𝒱 varieties, for varieties 𝒱 of inverse semigroups considered.

How to cite

top

Petrich, Mario. "Characterizing pure, cryptic and Clifford inverse semigroups." Czechoslovak Mathematical Journal 64.4 (2014): 1099-1112. <http://eudml.org/doc/269845>.

@article{Petrich2014,
abstract = {An inverse semigroup $S$ is pure if $e=e^2$, $a\in S$, $e<a$ implies $a^2=a$; it is cryptic if Green’s relation $\mathcal \{H\}$ on $S$ is a congruence; it is a Clifford semigroup if it is a semillatice of groups. We characterize the pure ones by the absence of certain subsemigroups and a homomorphism from a concrete semigroup, and determine minimal nonpure varieties. Next we characterize the cryptic ones in terms of their group elements and also by a homomorphism of a semigroup constructed in the paper. We also characterize groups and Clifford semigroups in a similar way by means of divisors. The paper also contains characterizations of completely semisimple inverse and of combinatorial inverse semigroups in a similar manner. It ends with a description of minimal non-$\mathcal \{V\}$ varieties, for varieties $\mathcal \{V\}$ of inverse semigroups considered.},
author = {Petrich, Mario},
journal = {Czechoslovak Mathematical Journal},
keywords = {inverse semigroup; pure inverse semigroup; cryptic inverse semigroup; Clifford semigroup; group-closed inverse semigroup; pure variety; completely semisimple inverse semigroup; combinatorial inverse semigroup; variety; pure inverse semigroups; cryptic inverse semigroups; Clifford semigroups; semisimple semigroups; combinatorial semigroups; lattices of varieties of inverse semigroups},
language = {eng},
number = {4},
pages = {1099-1112},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Characterizing pure, cryptic and Clifford inverse semigroups},
url = {http://eudml.org/doc/269845},
volume = {64},
year = {2014},
}

TY - JOUR
AU - Petrich, Mario
TI - Characterizing pure, cryptic and Clifford inverse semigroups
JO - Czechoslovak Mathematical Journal
PY - 2014
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 64
IS - 4
SP - 1099
EP - 1112
AB - An inverse semigroup $S$ is pure if $e=e^2$, $a\in S$, $e<a$ implies $a^2=a$; it is cryptic if Green’s relation $\mathcal {H}$ on $S$ is a congruence; it is a Clifford semigroup if it is a semillatice of groups. We characterize the pure ones by the absence of certain subsemigroups and a homomorphism from a concrete semigroup, and determine minimal nonpure varieties. Next we characterize the cryptic ones in terms of their group elements and also by a homomorphism of a semigroup constructed in the paper. We also characterize groups and Clifford semigroups in a similar way by means of divisors. The paper also contains characterizations of completely semisimple inverse and of combinatorial inverse semigroups in a similar manner. It ends with a description of minimal non-$\mathcal {V}$ varieties, for varieties $\mathcal {V}$ of inverse semigroups considered.
LA - eng
KW - inverse semigroup; pure inverse semigroup; cryptic inverse semigroup; Clifford semigroup; group-closed inverse semigroup; pure variety; completely semisimple inverse semigroup; combinatorial inverse semigroup; variety; pure inverse semigroups; cryptic inverse semigroups; Clifford semigroups; semisimple semigroups; combinatorial semigroups; lattices of varieties of inverse semigroups
UR - http://eudml.org/doc/269845
ER -

References

top
  1. Mills, J. E., 10.1007/PL00006005, Semigroup Forum 59 (1999), 220-232. (1999) Zbl0936.20054MR1847288DOI10.1007/PL00006005
  2. Pastijn, F., Volkov, M. V., 10.1006/jabr.1996.0289, J. Algebra 184 (1996), 881-896. (1996) Zbl0862.20046MR1407875DOI10.1006/jabr.1996.0289
  3. Petrich, M., Inverse Semigroups, Pure and Applied Mathematics. A Wiley-Interscience Publication Wiley, New York (1984). (1984) Zbl0546.20053MR0752899
  4. Reilly, N. R., 10.1093/qmath/36.4.467, Q. J. Math., Oxf. II. Ser. 36 (1985), 467-487. (1985) Zbl0582.20038MR0816487DOI10.1093/qmath/36.4.467
  5. Sen, M. K., Yang, H. X., Guo, Y. Q., A note on relation on an inverse semigroup, J. Pure Math. 14 (1997), 1-3. (1997) MR1658187

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.