On the inverse braid and reflection monoids of type <Emphasis Type="Italic">B</Emphasis>

There are well-known relations between braid and symmetric groups as well as Artin-Brieskorn braid groups and Coxeter groups: the latter are the factor-groups of the Artin-Brieskorn braid groups. The inverse braid monoid is related to the inverse symmetric monoid in the same way. We show that similar relations exist between the inverse braid monoid of type B and the inverse reflection monoid of type B. This gives a presentation of the latter monoid.     

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.     

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.      

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.     

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.     

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.     

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.     

Quasi-Armendariz rings relative to a monoid

For a monoid M, we introduce M-quasi-Armendariz rings which are a generalization of quasi-Armendariz rings, and investigate their properties. The M-quasi-Armendariz condition is a Morita invariant property. The class of M-quasi-Armendariz rings is closed under some kinds of upper triangular matrix rings. Every semiprime ring is M-quasi-Armendariz for any unique product monoid and any strictly totally ordered monoid M. Moreover, we study the relationship between the quasi-Baer property of a ring R and those of the monoid ring R[M]. Every quasi-Baer ring is M-quasi-Armendariz for any unique product monoid and any strictly totally ordered monoid M.     

Regular monoids generated by two galois connections

Consider a Galois connection (α, α) on an ordered setP and a Galois connection (β, β) on the dually ordered set . Arbitrary compositions of these Galois connections form a monoid. In this paper we will examine this monoid. First we prove that it is a regular monoid and then we construct two special Galois connectionsa andb such that every monoid of the above type is a homomorphic image of the monoid generated bya andb, and we give a solution of the word problem of the latter monoid.     

A partial converse to a theorem of Tamari

Let M be a cancellative monoid such that the monoid ring ℤM has no zero divisors. We show that if the monoid consisting of all elements of ℤM with strictly positive coefficients has nonzero common right multiples, then M is left amenable.     

SEPARABILITY CONDITIONS IN ACTS OVER MONOIDS

We discuss residual finiteness and several related separability conditions for the class of monoid acts, namely weak subact separability, strong subact separability and complete separability. For each of these four separability conditions, we investigate which monoids have the property that all their (finitely generated) acts satisfy the condition. In particular, we prove that: all acts over a finite monoid are completely separable (and hence satisfy the other three separability conditions); all finitely generated acts over a finitely generated commutative monoid are residually finite and strongly subact separable (and hence weakly subact separable); all acts over a commutative idempotent monoid are residually finite and strongly subact separable; and all acts over a Clifford monoid are strongly subact separable.

     

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.     

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 Composition Algebra and the Composition Monoid of the Kronecker Quiver

The Kronecker quiver K is considered, and the relations forthe specialisation at q = 0 of the generic composition algebraare given, as well as those for Reineke's composition monoid.As a corollary, it is deduced that the composition monoid isa proper factor of the specialisation of the composition algebra.A normal form is also obtained for the varieties occurring inthe composition monoid in terms of Schur roots.     

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.     

On the linearity of ω-primality in numerical monoids

In an atomic, cancellative, commutative monoid, the ω-value measures how far an element is from being prime. In numerical monoids, we show that this invariant exhibits eventual quasilinearity (i.e., periodic linearity). We apply this result to describe the asymptotic behavior of the ω-function for a general numerical monoid and give an explicit formula when the monoid has embedding dimension 2.     

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.     

Representation theory of q-rook monoid algebras

We show that, over an arbitrary field, q-rook monoid algebras are iterated inflations of Iwahori-Hecke algebras, and, in particular, are cellular. Furthermore we give an algebra decomposition which shows a q-rook monoid algebra is Morita equivalent to a direct sum of Iwahori-Hecke algebras. We state some of the consequences for the representation theory of q-rook monoid algebras.Supported by EPSRC grant GR/S18151/01     

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.     

Orbit decompositions of orthogonal monoids and the orders of finite orthogonal monoids

In this paper we determine the \(G\times G\) orbits of both an even orthogonal monoid and an even special orthogonal monoid, where G is the unit group of the even special orthogonal monoid. We then use the orbit decompositions to compute the orders of these monoids over a finite field.