Solvable monoids with commuting idempotents

International Journal of Algebra and Computation, 15, nº 3 (2005), p. 547-570The notion of Abelian kernel of a nite monoid extends the notion of derived subgroup of a nite group. In this line, an extension of the notion of solvable group to monoids is quite natural: they are the monoids such that the chain of Abelian kernels ends with the submonoid generated by the idempotents. We prove in this paper that the nite idempotent commuting monoids satisfying this property are precisely those whose subgroups are solvable

Artin group injection in the Hecke algebra for right-angled groups

For any Coxeter system we consider the algebra generated by the projections over the parabolic quotients. In the finite case it turn out that this algebra is isomorphic to the monoid algebra of the Coxeter monoid (0-Hecke algebra). In the infinite case it contains the Coxeter monoid algebra as a proper subalgebra. This construction provides a faithful integral representation of the Coxeter monoid algebra of any Coxeter system. As an application we will prove that a right-angled Artin group injects in Hecke algebra of the corresponding right-angled Coxeter group

On the relative solvability of certain inverse monoids

The notion of kernel of a finite monoid relative to a pseudovariety of groups can be used to define relative solvability of monoids in a similar way to the manner in which the notion of derived subgroup can be used to define solvable group. In this paper we study the solvability of certain inverse monoids relative to pseudovarieties of abelian groups.This work was partly supported by Fundação para a Ciência e a Tecnologia (FCT) through the Centro de Matemática da Universidade do Porto (CMUP) and by the project PTDC/MAT/65481/2006, which is partly funded by them European Community Fund FEDER. The second author gratefully acknowledges also the ESF programme “Au-tomata: from Mathematics to Applications (AutoMathA)” within whose framework the work leading to this paper has been carried out

Computing relative abelian kernels of finite monoids

Let H be a pseudovariety of abelian groups corresponding to a recursive supernatural number. In this note we explain how a concrete implementation of an algorithm to compute the kernel of a finite monoid relative to H can be achieved. The case of the pseudovariety Ab of all finite abelian groups was already treated by the second author and plays an important role here, where we will be interested in the proper subpseudovarieties of Ab. Our work relies on an algorithm obtained by Steinberg

Representation Theory of Finite Semigroups, Semigroup Radicals and Formal Language Theory

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are given to obtain many new results, as well as easier proofs of several results in the literature, involving: triangularizability of finite semigroups; which semigroups have (split) basic semigroup algebras, two-sided semidirect product decompositions of finite monoids; unambiguous products of rational languages; products of rational languages with counter; and \v{C}ern\'y's conjecture for an important class of automata

The commuting graph of the symmetric inverse semigroup

The commuting graph of a finite non-commutative semigroup S, denoted G(S), is a simple graph whose vertices are the non-central elements of S and two distinct vertices x, y are adjacent if xy = yx. Let I(X) be the symmetric inverse semigroup of partial injective transformations on a finite set X. The semigroup I(X) has the symmetric group Sym(X) of permutations on X as its group of units. In 1989, Burns and Goldsmith determined the clique number of the commuting graph of Sym(X). In 2008, Iranmanesh and Jafarzadeh found an upper bound of the diameter of G(Sym(X)), and in 2011, Dol˘zan and Oblak claimed that this upper bound is in fact the exact value.The goal of this paper is to begin the study of the commuting graph of the symmetric inverse semigroup I(X). We calculate the clique number of G(I(X)), the diameters of the commuting graphs of the proper ideals of I(X), and the diameter of G(I(X)) when |X| is even or a power of an odd prime. We show that when |X| is odd and divisible by at least two primes, then the diameter of G(I(X)) is either 4 or 5. In the process, we obtain several results about semigroups, such as a description of all commutative subsemigroups of I(X) of maximum order, and analogous results for commutative inverse and commutative nilpotent subsemigroups of I(X). The paper closes with a number of problems for experts in combinatorics and in group or semigroup theory