Artin theorem for semigroups

In this paper, we prove an Artin type theorem for semigroups. Namely, we consider the concepts of hyperalternative and hyperassociative semigroups and prove that every two elements in any hyperalternative semigroup generate a hyperassociative subsemigroup. As a consequence, we characterize all hyperalternative semigroups, and prove that these semigroups form a variety of semigroups with four identities.

Green's-Like Relations on Algebras and Varieties

There are five equivalence relations known as Green's relations definable on any semigroup or monoid, that is, on any algebra with a binary operation which is associative. In this paper, we examine whether Green's relations can be defined on algebras of any typeτ. Some sort of (super-)associativity is needed for such definitions to work, and we consider algebras which are clones of terms of typeτ, where the clone axioms including superassociativity hold. This allows us to define for any varietyVof typeτtwo Green's-like relationsℒVandℛVon the term clone of typeτ. We prove a number of properties of these two relations, and describe their behaviour whenVis a variety of semigroups.

INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS

We show that a number of natural membership problems for classes associated with finite semigroups are computationally difficult. In particular, we construct a 55-element semigroup S such that the finite membership problem for the variety of semigroups generated by S interprets the graph 3-colorability problem.

Undecidability of the identity problem for finite semigroups

In 1947 E. Post [28] and A. A. Markov [18] independently proved the undecidability of the word problem (or the problem of deducibility of relations) for semigroups. In 1968 V. L. Murskil [23] proved the undecidability of the identity problem (or the problem of deducibility of identities) in semigroups.If we slightly generalize the statement of these results we can state many related results in the literature and state our new results proved here. Let V denote either a (Birkhoff) variety of semigroups or groups or a pseudovariety of finite semigroups. By a very well-known theorem a (Birkhoff) variety is defined by equations or equivalently closed under substructure, surmorphisms and all products; see [7]. It is also well known that V is a pseudovariety of finite semigroups iff V is closed under substructure, surmorphism and finite products, or, equivalently, determined eventually by equations w1 = w1′, w2 = w2′, w3 = w3′,… (where the finite semigroup S eventually satisfies these equations iff there exists an n, depending on S, such that S satisfies Wj = Wj′ for j ≥ n). See [8] and [29]. All semigroups form a variety while all finite semigroups form a pseudovariety.We now consider a table (see the next page). In it, for example, the box denoting the “word” (identity) problem for the psuedovariety V” means, given a finite set of relations (identities) E and a relation (identity) u = ν, the problem of whether it is decidable that E implies u = ν inside V.