Related papers: Finitely presented monoids with linear Dehn functi…
We prove that a group is presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 if and only if the group is plain. Our proof goes via a new result concerning properties of embedded…
A new proof of the classification for tensor ideal thick subcategories of the bounded derived category, and the stable category, of modular representations of a finite group is obtained. The arguments apply more generally to yield a…
We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated…
In 1997, Deligne showed that the reduced lift presentation of a finite type generalized braid group remains correct if it is (suitably) interpreted as a presentation of a topological monoid. In this expository paper, we point out that…
This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…
In this paper we study rewriting systems for groups and monoids, focusing on situations where finite convergent systems may be difficult to find or do not exist. We consider systems which have no length increasing rules and are confluent…
In the first part of this note, we introduce Tietze transformations for $L$-presentations. These transformations enable us to generalize Tietze's theorem for finitely presented groups to invariantly finitely $L$-presented groups. Moreover,…
We provide new examples of groups without rational cross-sections (also called regular normal forms), using connections with bounded generation and rational orders on groups. Specifically, our examples are extensions of infinite torsion…
We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act itself has a finite presentation; it is weakly right coherent if every finitely generated right ideal of $S$ has a finite…
Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…
In my PhD thesis a version of Shelah's Presentation Theorem in the setting of Metric Abstract Elementary Classes was proved, where we claimed that the new function symbols are not necessarily uniformly continuous. In this paper we provide a…
Sequentiable structures are a subclass of monoids that generalise the free monoids and the monoid of non-negative real numbers with addition. In this paper we consider functions $f:\Sigma^*\rightarrow {\cal M}$ and define the Myhill-Nerode…
Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he constructed finitely presentable monoids with a…
We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act is finitely presented. This is a finiteness condition, and we investigate whether or not it is preserved under some standard…
The conjugator length function of a finitely generated group is the function $f$ so that $f(n)$ is the minimal upper bound on the length of a word realizing the conjugacy of two words of length at most $n$. We study herein the spectrum of…
We study the class of monoids that arise as the submonoid of right units of finitely presented special inverse monoids (SIMs). Gray and Ru\v{s}kuc (2024) gave the first example of a finitely presented SIM whose submonoid of right units does…
We construct a finitely presented group with infinitely many non-homeomorphic asymptotic cones. We also show that the existence of cut points in asymptotic cones of finitely presented groups does, in general, depend on the choice of scaling…
We study the maximal subgroups (also known as group $\mathcal{H}$-classes) of finitely presented special inverse monoids. We show that the maximal subgroups which can arise in such monoids are exactly the recursively presented groups, and…