Page 1

Displaying 1 – 12 of 12

Showing per page

Characterizing pure, cryptic and Clifford inverse semigroups

Mario Petrich (2014)

Czechoslovak Mathematical Journal

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...

Complexity of hypersubstitutions and lattices of varieties

Thawhat Changphas, Klaus Denecke (2003)

Discussiones Mathematicae - General Algebra and Applications

Hypersubstitutions are mappings which map operation symbols to terms. The set of all hypersubstitutions of a given type forms a monoid with respect to the composition of operations. Together with a second binary operation, to be written as addition, the set of all hypersubstitutions of a given type forms a left-seminearring. Monoids and left-seminearrings of hypersubstitutions can be used to describe complete sublattices of the lattice of all varieties of algebras of a given type. The complexity...

Currently displaying 1 – 12 of 12

Page 1