相关论文: The algebra of rewriting for presentations of inve…
Presentations of groups by rewriting systems (that is, by monoid presentations), have been fruitfully studied by encoding the rewriting system in a $2$--complex -- the Squier complex -- whose fundamental groupoid then describes the…
We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…
This is an expository paper which provides a quick introduction to Boolean inverse semigroups and their type monoids, with the emphasis on techniques and insights of the theory, and also treats the connection of the type monoid…
A semiring generalises the notion of a ring, replacing the additive abelian group structure with that of a commutative monoid. In this paper, we study a notion positioned between a ring and a semiring -- a semiring whose additive monoid is…
As an appropriate generalisation of the features of the classical (Schein) theory of representations of inverse semigroups in $\mathscr{I}_{X}$, a theory of representations of inverse semigroups by homomorphisms into complete atomistic…
Wreath products involving symmetric inverse monoids/semigroups/categories arise in many areas of algebra and science, and presentations by generators and relations are crucial tools in such studies. The current paper finds such…
A coherent presentation of an n-category is a presentation by generators, relations and relations among relations. Confluent and terminating rewriting systems generate coherent presentations, whose relations among relations are defined by…
A fully invarient congruence relations on the free algebra on a given type induces a variety of the given type. In contrast, a congruence relation of the free algebra provides algebra of that type. This algebra is given by a so-called…
We investigate the groups of units of one-relator and special inverse monoids. These are inverse monoids which are defined by presentations where all the defining relations are of the form $r=1$. We develop new approaches for finding…
Convergent rewriting systems are well-known tools in the study of the word-rewriting problem. In particular, a presentation of a monoid by a finite convergent rewriting system gives an algorithm to decide the word problem for this monoid.…
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
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…
We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…
We define pullback and separated presentations of modules over pullback rings, and, if the ring is a pullback of epimorphisms over a semisimple ring, an algorithm reducing such a presentation of a module to an $R$-diagram. The latter is the…
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good cases, the method provides a powerful tool for investigating…
This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the…
We modify a previous result, which showed that certain diagrams of spaces are essentially simplicial monoids, to construct diagrams of spaces which model simplicial groups. Furthermore, we show that these diagrams can be generalized to…
We describe affine monoids whose group of invertible elements is an active semidirect product of a unipotent group and a torus, in terms of comultiplications on the algebra of regular functions. We introduce the notion of a root monoid,…
In 2010, Everitt and Fountain introduced the concept of reflection monoids. The Boolean reflection monoids form a family of reflection monoids (symmetric inverse semigroups are Boolean reflection monoids of type $A$). In this paper, we give…
A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…