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.     

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.     

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.     

Congruences and Closure Endomorphisms of Hilbert Algebras

In this paper we describe the congruences of a finite Hilbert algebra in terms of its closure endomorphisms. We use this result to give a necessary and sufficient condition under which two finite Hilbert algebras share the same monoid of endomorphisms.     

Constructing finitely presented monoids which have no finite complete presentation

Squier (1987) showed that if a monoid is defined by a finite complete rewriting system, then it satisfies the homological finiteness condition FP₃, and using this fact he gave monoids (groups) which have solvable word problems but cannot be presented by finite complete systems. In the present paper we show that a monoid cannot have a finite complete presentation if it contains certain special elements. This observation enables us to construct monoids without finite complete presentation in a direct and elementary way. We give a finitely presented monoid which has (1) a word problem solvable in linear time and (2) linear growth but (3) no finite complete presentation. We also give a finitely presented monoid which has (1) a word problem solvable in linear time, (2) finite derivation type in the sense of Squier and (3) the property FP_∞, but (4) no finite complete presentation.     

Knuth’s Coherent Presentations of Plactic Monoids of Type A

We construct finite coherent presentations of plactic monoids of type A. Such coherent presentations express a system of generators and relations for the monoid extended in a coherent way to give a family of generators of the relations amongst the relations. Such extended presentations are used for representations of monoids, in particular, it is a way to describe actions of monoids on categories. Moreover, a coherent presentation provides the first step in the computation of a categorical cofibrant replacement of a monoid. Our construction is based on a rewriting method introduced by Squier that computes a coherent presentation from a convergent one. We compute a finite coherent presentation of a plactic monoid from its column presentation and we reduce it to a Tietze equivalent one having Knuth’s generators.     

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.

     

Split graphs whose half-strong endomorphisms form a monoid

In this paper,the half-strong,the locally strong and the quasi-strong endomorphisms of a split graph are investigated.Let X be a split graph and let End(X),hEnd(X),lEnd(X) and qEnd(X) be the endomorphism monoid,the set of all half-strong endomorphisms,the set of all locally strong endomorphisms and the set of all quasi-strong endomorphisms of X,respectively.The conditions under which hEnd(X) forms a submonoid of End(X) are given.It is shown that lEnd(X) = qEnd(X) for any split graph X.The conditions under which lEnd(X)(resp.qEnd(X)) forms a submonoid of End(X) are also given.In particular,if hEnd(X) forms a monoid,then lEnd(X)(resp.qEnd(X)) forms a monoid too.     

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.     

Admissible submonoids of Artin-Tits monoids

We show the analogue of Mühlherr’s [B. Mühlherr, Coxeter groups in Coxeter groups, in: Finite Geometry and Combinatorics, Cambridge University Press, 1993, pp. 277-287] for Artin-Tits monoids and for Artin-Tits groups of spherical type. That is, the submonoid (resp. subgroup) of an Artin-Tits monoid (resp. group of spherical type) induced by an admissible partition of the Coxeter graph is an Artin-Tits monoid (resp. group).This generalizes and unifies the situation of the submonoid (resp. subgroup) of fixed elements of an Artin-Tits monoid (resp. group of spherical type) under the action of graph automorphisms, and the notion of LCM-homomorphisms defined by Crisp in [J. Crisp, Injective maps between Artin groups, in: Geom. Group Theory Down Under (Canberra 1996), de Gruyter, Berlin, 1999, pp. 119-137] and generalized by Godelle in [E. Godelle, Morphismes injectifs entre groupes d’Artin-Tits, Algebr. Geom. Topol. 2 (2002) 519-536].We then complete the classification of the admissible partitions for which the Coxeter graphs involved have no infinite label, started by Mühlherr in [B. Mühlherr, Some contributions to the theory of buildings based on the gate property, Dissertation, Tübingen, 1994]. This leads us to the classification of Crisp’s LCM-homomorphisms.     

Endomorphisms of finite regular Kleene lattices

The class of regular Kleene lattices is the least strict quasi-variety of De Morgan lattices. In this paper we give necessary and sufficient conditions for two finite regular Kleene lattices to share the same monoid of endomorphisms.     

On the finite basis problem for the monoids of partial extensive injective transformations

Let \(PEI_n (POEI_n)\) be the monoid of all partial (order-preserving) extensive and injective transformations over a chain of order n. We give a sufficient condition under which a semigroup is nonfinitely based and apply this condition to show that the monoid \(PEI_3 (POEI_3)\) is nonfinitely based. This together with the results of Edmunds and Goldberg gives a complete answer to the finite basis problem for the monoid \(PEI_n (POEI_n)\): the monoid \(PEI_n (POEI_n)\) is nonfinitely based if and only if \(n\geqslant 3\). Furthermore, it is shown that the monoid \(PEI_n (POEI_n)\) is hereditarily finitely based if and only if \(n\leqslant 2\).     

Morita duality for monoids

In this paper Morita duality for monoids is introduced. Necessary and sufficient conditions for two monoids S and T to be Morita dual are given. Moreover, it is shown that if S and T are Morita dual monoids, then S and U are Morita dual if and only if T and U are Morita equivalent. In addition, every finite monoid having Morita duality is selfdual and even reflexive.     

Extensions of partially ordered partial abelian monoids

The notion of a partially ordered partial abelian monoid is introduced and extensions of partially ordered abelian monoids by partially ordered abelian groups are studied. Conditions for the extensions to exist are found. The cases when both the above mentioned structures have the Riesz decomposition property, or are lattice ordered, are treated. Some applications to effect algebras and MV-algebras are shown.     

Vines and partial transformations

We introduce the partial vine monoid PVn. This monoid is related to the partial transformation semigroup PTn in the same way as the braid group Bn is related to the symmetric group Sn, and contains both the vine monoid [T.G. Lavers, The theory of vines, Comm. Algebra 25 (4) (1997) 1257-1284] and the inverse braid monoid [D. Easdown, T.G. Lavers, The inverse braid monoid, Adv. Math. 186 (2) (2004) 438-455]. We give a presentation for PVn in terms of generators and relations, as well as a faithful representation in a monoid of endomorphisms of a free group. We also derive a new presentation for PTn.     

The Join of Split Graphs Whose Regular Endomorphisms Form a Monoid

In this paper, the regular endomorphisms of the join of split graphs are investigated. We give a condition under which the regular endomorphisms of the join of split graphs form a monoid.     

A note on the definition of small overlap monoids

Small overlap conditions are simple and natural combinatorial conditions on semigroup and monoid presentations, which serve to limit the complexity of derivation sequences between equivalent words in the generators. They were introduced by J.H. Remmers, and more recently have been extensively studied by the present author. However, the definition of small overlap conditions hitherto used by the author was slightly more restrictive than that introduced by Remmers; this note eliminates this discrepancy by extending the recent methods and results of the author to apply to Remmers’ small overlap monoids in full generality.     

Endomorphism monoids and topological subgraphs of graphs

We prove, that, given a finite graph Y there exists a finite monoid (semigroup with unity) M such that any graph X whose endomorphism monoid is isomorphic to M contains a subdivision of Y. This contrasts with several known results on the simultaneous prescribability of the endomorphism monoid and various graph theoretical properties of a graph. It is also related to the analogous problems on graphs having a given permutation group as a restriction of their automorphism group to an invariant subset.     

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.