On rigid monoids and 2-fir monoid rings

It is proved that the universal group of a torsion free rigid monoid is torsion free. As a consequence, a new condition on a monoid M for the monoid ring R[M] to be a 2-fir is given. Furthermore, the monoids between a rigid monoid and its universal group are studied.     

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.     

Idempotent-Conjugate Monoids with Nilpotent Unit Groups

Let M be a finite monoid with unit group G such that J-related idempotents in M are conjugate. If G is nilpotent, we prove that the complex monoid algebra CM of M is semisimple if and only if M is an inverse monoid. Conversely let G be a finite group such that for any finite idempotent-conjugate monoid M with unit group G, CM semisimple implies that M is an inverse monoid. We then show that G is a nilpotent group.     

Brauer and Jones tied monoids

We introduce a ramified monoid, attached to each Brauer–type monoid, that is, to the symmetric group, to the Jones and Brauer monoids among others. Ramified monoids correspond to a class of tied monoids arising from knot theory and are interesting in themselves. The ramified monoid attached to the symmetric group is the Coxeter-like version of the so–called tied braid monoid. We give a presentation of the ramified monoid attached to the Brauer monoid. Also, we introduce and study two tied-like monoids that cannot be described as ramified monoids. However, these monoids can also be regarded as tied versions of the Jones and Brauer monoids.     

一类模糊逻辑系统幺半群与同态映射

首先利用代数中幺半群的概念给出了模糊逻辑系统专业领域的概念, 建立专业领域概念的目的是为了规范模糊逻辑系统中语言变量的取值范围, 从而将模糊逻辑系统看作是某个笛卡儿乘积幺半群的有限子集. 然后利用这个笛卡儿乘积幺半群的乘积运算构造了模糊逻辑系统幺半群. 最后, 在一定的约定条件下证明了通常使用的一类Mamdani形模糊逻辑系统的输出可以看作是从模糊逻辑系统幺半群到连续函数域的同态映射.     

On Presentations of Bruck–Reilly Extensions

We first consider the class of monoids in which every left invertible element is also right invertible, and prove that if a monoid belonging to this class admits a finitely presented Bruck–Reilly extension then it is finitely generated. This allow us to obtain necessary and sufficient conditions for the Bruck–Reilly extensions of this class of monoids to be finitely presented. We then prove that thes 𝒟-classes of a Bruck–Reilly extension of a Clifford monoid are Bruck–Reilly extensions of groups. This yields another necessary and sufficient condition for these Bruck–Reilly extensions to be finitely generated and presented. Finally, we show that a Bruck–Reilly extension of a Clifford monoid is finitely presented as an inverse monoid if and only if it is finitely presented as a monoid, and that this property cannot be generalized to Bruck–Reilly extensions of arbitrary inverse monoids.     

Symmetric factorizations of the complete uniform hypergraph

Crystal graphs, in the sense of Kashiwara, carry a natural monoid structure given by identifying words labelling vertices that appear in the same position of isomorphic components of the crystal. In the particular case of the crystal graph for the q-analogue of the special linear Lie algebra \(\mathfrak {sl}_{n}\), this monoid is the celebrated plactic monoid, whose elements can be identified with Young tableaux. The crystal graph and the so-called Kashiwara operators interact beautifully with the combinatorics of Young tableaux and with the Robinson–Schensted–Knuth correspondence and so provide powerful combinatorial tools to work with them. This paper constructs an analogous ‘quasi-crystal’ structure for the hypoplactic monoid, whose elements can be identified with quasi-ribbon tableaux and whose connection with the theory of quasi-symmetric functions echoes the connection of the plactic monoid with the theory of symmetric functions. This quasi-crystal structure and the associated quasi-Kashiwara operators are shown to interact just as neatly with the combinatorics of quasi-ribbon tableaux and with the hypoplactic version of the Robinson–Schensted–Knuth correspondence. A study is then made of the interaction of the crystal graph for the plactic monoid and the quasi-crystal graph for the hypoplactic monoid. Finally, the quasi-crystal structure is applied to prove some new results about the hypoplactic monoid.     

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.     

Groupes de Garside

Define a Garside monoid to be a cancellative monoid where right and left lcm's exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside monoid. The family of Garside groups contains the braid groups, all spherical Artin-Tits groups, and various generalizations previously considered.² Here we prove that Garside groups are biautomatic, and that being a Garside group is a recursively enumerable property, i.e., there exists an algorithm constructing the (infinite) list of all small Gaussian groups. The latter result relies on an effective, tractable method for recognizing those presentations that define a Garside monoid.     

Double Catalan monoids

In this paper, we define and study what we call the double Catalan monoid. This monoid is the image of a natural map from the 0-Hecke monoid to the monoid of binary relations. We show that the double Catalan monoid provides an algebraization of the (combinatorial) set of 4321-avoiding permutations and relate its combinatorics to various off-shoots of both the combinatorics of Catalan numbers and the combinatorics of permutations. In particular, we give an algebraic interpretation of the first derivative of the Kreweras involution on Dyck paths, of 4321-avoiding involutions and of recent results of Barnabei et al. on admissible pairs of Dyck paths. We compute a presentation and determine the minimal dimension of an effective representation for the double Catalan monoid. We also determine the minimal dimension of an effective representation for the 0-Hecke monoid.     

Ideal Structure of the Kauffman and Related Monoids

The generators of the Temperley-Lieb algebra generate a monoid with an appealing geometric representation. It has been much studied, notably by Louis Kauffman. Borisavljevi?, Do?en, and Petri? gave a complete proof of its abstract presentation by generators and relations, and suggested the name “Kauffman monoid”. We bring the theory of semigroups to the study of a certain finite homomorphic image of the Kauffman monoid. We show the homomorphic image (the Jones monoid) to be a combinatorial and regular *-semigroup with linearly ordered ideals. The Kauffman monoid is explicitly described in terms of the Jones monoid and a purely combinatorial numerical function. We use this to describe the ideal structure of the Kauffman monoid and two other of its homomorphic images.     

特殊Thue系统表现的幺半群的两个性质

本文给出了有限特殊Ｃｈｕｒｃｈ－ＲｏｓｓｅｒＴｈｕｅ系统表现的上半群是群或正则半群的两个充要条件．并由此获得了判定该种幺半群是否群、正则半群的十分简单的算法．     

The Homology of Partial Monoid Actions and Petri Nets

The aim of this paper is to study the homology theory of partial monoid actions and apply it to computing the homology groups of mathematical models for concurrency. We study the Baues–Wirsching homology groups of a small category associated with a partial monoid action on a set. We prove that these groups can be reduced to the Leech homology groups of the monoid. For a trace monoid with a partial action on a set, we build a complex of free Abelian groups for computing the homology groups of this small category. It allows us to solve the problem posed by the author on the construction of an algorithm to computing the homology groups of elementary Petri nets. We describe the algorithm and give examples of computing the homology groups.     

Coxeter groups,Coxeter monoids and the Bruhat order

Associated with any Coxeter group is a Coxeter monoid, which has the same elements, and the same identity, but a different multiplication. (Some authors call these Coxeter monoids 0-Hecke monoids, because of their relation to the 0-Hecke algebras—the q=0 case of the Hecke algebra of a Coxeter group.) A Coxeter group is defined as a group having a particular presentation, but a pair of isomorphic groups could be obtained via non-isomorphic presentations of this form. We show that when we have both the group and the monoid structure, we can reconstruct the presentation uniquely up to isomorphism and present a characterisation of those finite group and monoid structures that occur as a Coxeter group and its corresponding Coxeter monoid. The Coxeter monoid structure is related to this Bruhat order. More precisely, multiplication in the Coxeter monoid corresponds to element-wise multiplication of principal downsets in the Bruhat order. Using this property and our characterisation of Coxeter groups among structures with a group and monoid operation, we derive a classification of Coxeter groups among all groups admitting a partial order.     

Existence of a new limit variety of aperiodic monoids

Presently, the two limit varieties of Marcel Jackson are the only known examples of limit varieties of aperiodic monoids. This article establishes the existence of a new example by showing that a certain aperiodic monoid of order seven is non-finitely based. This monoid turns out to be a smallest non-finitely based monoid that is not inherently non-finitely based.     

Inverse Subsemigroups of the Monogenic Free Inverse Semigroup

It is shown that every finitely generated inverse subsemigroup (submonoid) of the monogenic free inverse semigroup (monoid) is finitely presented. As a consequence, the homomorphism and the isomorphism problems for the monogenic free inverse semigroup (monoid) are proven to be decidable.     

Sur les automates qui reconnaissent une famille de langages

The main results about automatas and the languages they accept are easily extended to automatas which recognize a family of languages (L_i)_iεI of a free monoid, that is to automatas which recognize simultaneously all the languages L_i. This generalization enhances the notion of automata of type (p,r) introduced by S. Eilenberg [4]. In a similar way the notion of syntactic monoid of a family of languages extends the notion of syntactic monoid of a language. This extension is far from being trivial since we show that every finite monoid is the syntactic monoid of a recognizable partition of a free monoid, though this is false for the syntactic monoids of languages.      

On morphisms of commutative monoids

The aim of this work is to study monoid morphisms between commutative monoids. Algorithms to check if a monoid morphism between two finitely generated monoids is injective and/or surjective are given. The structure of the set of monoid morphisms between a monoid and a cancellative monoid is also studied and an algorithm to obtain a system of generators of this set is provided.     

Lipschitz monoids and Vahlen matrices

Recent studies of Vahlen matrices have again pointed out a very interesting multiplicative monoid that is present in every Clifford algebra; this motivates a new presentation of the knowledge already collected about this monoid before it got involved in Vahlen matrices. This monoid is first studied for itself (and under rather weak hypotheses), and secondly in view of a more effective application to Vahlen matrices. The “invariance property” of this monoid opens the way to new information about these matrices.     

The dual braid monoid

We study a new monoid structure for Artin groups associated with finite Coxeter systems. Like the classical positive braid monoid, the new monoid is a Garside monoid. We give several equivalent constructions: algebraically, the new monoid arises when studying Coxeter systems in a “dual” way, replacing the pair (W,S) by (W,T), with T the set of all reflections; geometrically, it arises when looking at the reflection arrangement from a certain basepoint. In the type A case, we recover the monoid constructed by Birman, Ko and Lee.