On presentations of Brauer-type monoids

We obtain presentations for the Brauer monoid, the partial analogue of the Brauer monoid, and for the greatest factorizable inverse submonoid of the dual symmetric inverse monoid. In all three cases we apply the same approach, based on the realization of all these monoids as Brauer-type monoids.     

On graphs with a given endomorphism monoid

Hedrlín and Pultr proved that for any monoid M there exists a graph G with endomorphism monoid isomorphic to M . In this paper we give a construction G(M) for a graph with prescribed endomorphism monoid M . Using this construction we derive bounds on the minimum number of vertices and edges required to produce a graph with a given endomorphism monoid for various classes of finite monoids. For example we show that for every monoid M , | M |=m there is a graph G with End(G)? M and |E(G)|≤(1 + 0(1))m². This is, up to a factor of 1/2, best possible since there are monoids requiring a graph with \begin{eqnarray*} && \frac{m^{2}}{2}(1 -0(1)) \end{eqnarray*} edges. We state bounds for the class of all monoids as well as for certain subclasses—groups, k‐cancellative monoids, commutative 3‐nilpotent monoids, rectangular groups and completely simple monoids. © 2009 Wiley Periodicals, Inc. J Graph Theory 62, 241–262, 2009     

The Natural Embedding of Positive Singular Artin Monoids

We explore some combinatorial properties of singular Artin monoids and invoke them to prove that a positive singular Artin monoid of arbitrary Coxeter type necessarily injects into the corresponding singular Artin monoid. This is an extension of L. Pari' result that positive Artin monoids embed in the correpsonding Artin groups: Adjoining inverses of the generators does not produce any new identities between words that do not involve those inverses.     

Fundamental groups,inverse schützenberger automata,and monoid presentations

This paper gives decidable conditions for when a finitely generated subgroup of a free group is the fundamental group of a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Also, generalizations are given to specific types of inverse monoids as well as to monoids which are "nearly inverse." This result has applications to computing membership for inverse monoids in a Mal'cev product of the pseudovariety of semilattices with a pseudovariety of groups.

This paper also shows that there is a bijection between strongly connected inverse automata and subgroups of a free group, generated by positive words. Hence, we also obtain that it is decidable whether a finite strongly connected inverse automaton is a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Again, we have generalizations to other types of inverse monoids and to "nearly inverse" monoids. We show that it is undecidable whether a finite strongly connected inverse automaton is a Schützenberger automaton of a monoid presentation of anE-unitary inverse monoid.     

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.

     

A new class of unique product monoids with applications to ring theory

We introduce a class of ordered monoids defined by the existence of certain “unique products” with respect to artinian and narrow subsets of the monoid. The logical relationships between this and other significant classes of monoids are explicated with several examples. We conclude with results on skew generalized power series rings. The new class of monoids provides the appropriate setting for obtaining results on reduced rings and domains of skew generalized power series, and on analogues of Armendariz rings.     

A generalized Goulden–Jackson cluster method and lattice path enumeration

The Goulden–Jackson cluster method is a powerful tool for obtaining generating functions counting words in a free monoid by occurrences of a set of subwords. We introduce a generalization of the cluster method for monoid networks, which generalize the combinatorial framework of free monoids. As a sample application of the generalized cluster method, we compute bivariate and multivariate generating functions counting Motzkin paths – both with height bounded and unbounded – by statistics corresponding to the number of occurrences of various subwords, yielding both closed-form and continued fraction formulas.     

Lorenzen Monoids: A Multiplicative Approach to Kronecker Function Rings

Using the formalism of module systems on a commutative cancellative monoid, we generalize the classical concept of Lorenzen monoids to obtain a multiplicative model for the semistar Kronecker function ring introduced by Fontana and Loper. We prove a universal mapping property and investigate the generalized Lorenzen monoid from a valuation-theoretic and an ideal-theoretic point of view.     

Rationally smooth algebraic monoids

A reductive monoid M is called rationally smooth if it has sufficiently mild singularities as a topological space. We characterize this class of monoids in combinatorial terms. We then use our results to calculate the Betti numbers of certain projective, rationally smooth group embeddings using the “monoid BB-decomposition”.     

Brauer Characters of Finite Monoids

We introduce the concept of a Brauer character of a representation of a finite monoid M in characteristic p>0. When p does not divide the order of any subgroup of M, we develop a theory of p-monoid quivers. We apply our results to the full transformation semigroup.     

A special class of tensor categories initiated by inverse braid monoids

In this paper, we introduce the concept of a wide tensor category which is a special class of a tensor category initiated by the inverse braid monoids recently investigated by Easdown and Lavers [The Inverse Braid Monoid, Adv. in Math. 186 (2004) 438-455].The inverse braid monoidsIB_n is an inverse monoid which behaves as the symmetric inverse semigroup so that the braid group B_n can be regarded as the braids acting in the symmetric group. In this paper, the structure of inverse braid monoids is explained by using the language of categories. A partial algebra category, which is a subcategory of the representative category of a bialgebra, is given as an example of wide tensor categories. In addition, some elementary properties of wide tensor categories are given. The main result is to show that for every strongly wide tensor category C, a strict wide tensor category C^str can be constructed and is wide tensor equivalent to C with a wide tensor equivalence F.As a generalization of the universality property of the braid category B, we also illustrate a wide tensor category through the discussion on the universality of the inverse braid category IB (see Theorem 3.3, 3.6 and Proposition 3.7).     

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.     

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.     

右消去幺半群、左正则带和左正则型A幺半群

本文利用右消去幺半群,左正则带建立了真左正则型A幺半群．在证明了任一左正则型A幺半群均有P－覆盖后,给出P－覆盖的结构．     

幺半群的内射类及投射类刻画

类比于一般环上模的内射类,定义了幺半群上的S-系的内射类和投射类,并利用它们刻画了几类特殊的幺半群．证明了完全内射幺半群和完全拟内射幺半群是等价的．并且证明了对于标致幺半群S,它是完全投射的当且仅当它是完全拟投射的当且仅当它上面的投射S-系构成了一个投射类．     

Principally Weakly and Weakly Coherent Monoids

We shall call a monoid S principally weakly (weakly) left coherent if direct products of nonempty families of principally weakly (weakly) flat right S-acts are principally weakly (weakly) flat. Such monoids have not been studied in general. However, Bulman-Fleming and McDowell proved that a commutative monoid S is (weakly) coherent if and only if the act S ^I is weakly flat for each nonempty set I. In this article we introduce the notion of finite (principal) weak flatness for characterizing (principally) weakly left coherent monoids. Also we investigate monoids over which direct products of acts transfer an arbitrary flatness property to their components.     

弱Clifford拟正则半群的半直积和圈积

本文给出两个么半群Ｓ和Ｔ的半直积和圈积为弱Ｃｌｉｆｆｏｒｄ拟正则么半群的充要条件和半直积的结构，同时还讨论了弱Ｃｌｉｆｆｏｒｄ拟正则么半群的最小群同余与半直积的最小群同余之间的关系．     

The radical-annihilator monoid of a ring

Kuratowski’s closure-complement problem gives rise to a monoid generated by the closure and complement operations. Consideration of this monoid yielded an interesting classification of topological spaces, and subsequent decades saw further exploration using other set operations. This article is an exploration of a natural analogue in ring theory: a monoid produced by “radical” and “annihilator” maps on the set of ideals of a ring. We succeed in characterizing semiprime rings and commutative dual rings by their radical-annihilator monoids, and we determine the monoids for commutative local zero-dimensional (in the sense of Krull dimension) rings.