This paper proves that any monoid presented by a confluent context-free monadic rewriting system is word-hyperbolic. This result then applied to answer a question asked by Duncan&Gilman by exhibiting an example of a word-hyperbolic monoid that does not admit a word-hyperbolic structure with uniqueness (that is, in which the language of representatives maps bijectively onto the monoid).

We study the geometry of algebraic monoids. We prove that the group of invertible elements of an irreducible algebraic monoid is an algebraic group, open in the monoid. Moreover, if this group is reductive, then the monoid is affine. We then give a combinatorial classification of reductive monoids by means of the theory of spherical varieties.

We describe a new monoid structure for braid groups associated with finite Coxeter systems. This monoid shares with the classical positive braid monoid its crucial algebraic properties: the monoid satisfies Öre’s conditions and embeds in its group of fractions, it admits a nice normal form, it can be used to construct braid group actions on categories... It also provides a new presentation for ...

The logic of bunched implications (BI), introduced by O’Hearn and Pym, is a substructural logic which freely combines additive and multiplicative implications. Boolean BI (BBI) denotes BI with classical interpretation of additives and its model is the commutative monoid. We show that when the monoid is finitely generated and propositions are recursively defined, or the monoid is infinitely gene...

A generalized arithemtic numerical monoid is of the form S = 〈a, ah+d, ah+2d, . . . , ah+ xd〉 where the gcd(a, d) = 1 and a > x. Much is known for the arithmetic numerical monoid, when h = 1, due to known information for that specific monoid’s length set. Therefore, this paper will explore various invariants of the generalized arithmetic numerical monoid.

We present an algebra for data-intensive scalable computing based on monoid homomorphisms that consists of a small set of operations that capture most features supported by current domain-specific languages for data-centric distributed computing. This algebra is being used as the formal basis of MRQL, which is a query processing and optimization system for large-scale distributed data analysis....

By a generalized Tannaka-Krein reconstruction we associate to the admissible representions of the category O of a Kac-Moody algebra, and its category of admissible duals a monoid with a coordinate ring. The Kac-Moody group is the Zariski open dense unit group of this monoid. The restriction of the coordinate ring to the Kac-Moody group is the algebra of strongly regular functions introduced by ...

A subresiduated lattice ordered commutative monoid (or srl-monoid for short) is a with particular subalgebra which contains residuated implication. The srl-monoids can be regarded as algebras that generalize lattices and respectively. In this paper we prove the class of forms variety. We show congruences any isomorphic to its strongly convex subalgebras also give description generated by subset...

A Puiseux monoid is an additive submonoid of the nonnegative rational numbers. If M a monoid, then question whether each nonunit element can be written as sum irreducible elements (that is, atomic) surprisingly difficult. For instance, although various techniques have been developed over past few years to identify subclasses monoids that are atomic, no general characterization such known. Here ...

This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of rank 1 is both 2-context-free (an intersection of two context-free languages) and ET0L; that the co-word problem of the free inverse monoid of rank 1 is context...