Graph monoids

A graph semigroup refers to a monoid whose defining relations are of the form x_ix_j=x_jx_i. We describe the centralizer of an arbitrary element of a graph semigroup, show that there exists a unique factorization of any element into commuting parts, and prove related results. Dedicated to L. M. Gluskin on the occasion of his sixtieth birthday     

Malcev products of unipotent monoids and varieties of bands

Let \(\mathcal{U}\) be the class of all unipotent monoids and \(\mathcal{B}\) the variety of all bands. We characterize the Malcev product \(\mathcal{U} \circ \mathcal{V}\) where \(\mathcal{V}\) is a subvariety of \(\mathcal{B}\) low in its lattice of subvarieties, \(\mathcal{B}\) itself and the subquasivariety \(\mathcal{S} \circ \mathcal{RB}\), where \(\mathcal{S}\) stands for semilattices and \(\mathcal{RB}\) for rectangular bands, in several ways including by a set of axioms. For members of some of them we describe the structure as well. This succeeds by using the relation \(\widetilde{\mathcal{H}}= \widetilde{\mathcal{L}} \cap \widetilde{\mathcal{R}}\), where \(a\;\,\widetilde{\mathcal{L}}\;\,b\) if and only if a and b have the same idempotent right identities, and \(\widetilde{\mathcal{R}}\) is its dual.We also consider \((\mathcal{U} \circ \mathcal{RB}) \circ \mathcal{S}\) which provides the motivation for this study since \((\mathcal{G} \circ \mathcal{RB}) \circ \mathcal{S}\) coincides with completely regular semigroups, where \(\mathcal{G}\) is the variety of all groups. All this amounts to a generalization of the latter: \(\mathcal{U}\) instead of \(\mathcal{G}\).     

Graph products of monoids

The main aim of this paper is to characterize the Green relations in the graph product of monoids. Necessary and sufficient conditions for an element in a graph product of monoids to be idempotent, regular or completely regular, are established. These characterizations immediately lead to decidability results. A new proof for the word problem is also presented. May 22, 2000     

Endomorphism monoids of acts over monoids

In this paper we investigate under which conditions a monoid R is defined by the endomorphism monoid of an act over R. More precisely, we ask when an isomorphism between two such endomorphism monoids over monoids R₁ and R₂ is induced by a semilinear isomorphism. The question is considered also for ordered and for topological monoids. On the way we characterize monoids over which all projective acts are free. An abstract of this paper appeared in the Proceedings of the Conference on Semigroups, Szeged 1972.     

Regular unipotent elements

We construct a map from the set of regular unipotent classes of a finite reductive group to the corresponding set in a Levi subgroup. A theorem of Digne, Lehrer and Michel on Lusztig restriction of characteristic functions of such classes gives in particular another (not explicit) construction of such a map. We conjecture that these two maps coincide.     

Cohomology monoids of monoids with coefficients in semimodules II

We relate the old and new cohomology monoids of an arbitrary monoid M with coefficients in semimodules over M, introduced in the author’s previous papers, to monoid and group extensions. More precisely, the old and new second cohomology monoids describe Schreier extensions of semimodules by monoids, and the new third cohomology monoid is related to a certain group extension problem.     

Un groupe unipotent universel

On étudie le groupe affine 𝔊 correspondant à I’algèbre de battage de Hopf, et on montre que tout groupe algébrique unipotent est un quotient de 𝔊. De plus, on utilise 𝔊 pour mieux comprendre quelques caractérisations des séries de Lie en termes de battages.

We study the affine group 𝔊 corresponding to the Hopf shuffle algebra, and show that algebraic unipotent groups are always quotients of it. We also use 𝔊 to explain certain characterization of Lie series in terms of shuffles.     

Finitary monoids

Abstract. No abstract.     

Tied monoids

We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids indicate that they should give origin to new knot algebras; indeed, our tied monoids include the tied braid monoid and the tied singular braid monoid, which were used, respectively, to construct new polynomial invariants for classical links and singular links. Consequently, we provide a mechanism to attach an algebra to each tied monoid; this mechanism not only captures known generalizations of the bt-algebra, but also produces possible new knot algebras. To build the tied monoids it is necessary to have presentations of set partition monoids of types A, B and D, among others. For type A we use a presentation due to FitzGerald and for the other type it was necessary to built them.

     

Endomorphism monoids of free acts and O-wreath products of monoids

Monoids and acts which may have zero elements are considered. In Section 1 we construct a O-wreath product of monoids. In 2 we prove the theorem that the endomorphism monoid of a free act over a monoid with zero can be represented as a O-wreath product. Considering monoids with tero we are interested in their annihilator properties. In 3 we give necessary and sufficient conditions for a O-wreath product of monoids to be a right (left) Baer (Rickart) monoid. In 4 we obtain as a consequence corresponding conditions for the endomorphism monoid of a free act over a monoid with zero.     

Automorphisms with unipotent values

In this paper we obtain the following result: ifR is a prime ring andg is an automorphism ofR such that (g(x)?x) ⁿ=0 for allx∈R, wheren≥1 is a fixed integer, theng=1.     

Catalan monoids,monoids of local endomorphisms,and their presentations

The Catalan monoid and partial Catalan monoid of a directed graph are introduced. Also introduced is the notion of a local endomorphism of a tree, and it is shown that the Catalan (resp. partial Catalan) monoid of a tree is simply its monoid of extensive local endomorphisms (resp. partial endomorphisms) of finite shift. The main results of this paper are presentations for the Catalan and partial Catalan monoids of a tree. Our presentation for the Catalan monoid of a tree is used to give an alternative proof for a result of Higgins. We also identify results of Aîzen?tat and Popova which give presentations for the Catalan monoid and partial Catalan monoid of a finite symmetric chain.