Related papers: Multifraction reduction II: Conjectures for Artin-…
One can observe that Coxeter groups and right-angled Artin groups share the same solution to the word problem. On the other hand, in his study of reflection subgroups of Coxeter groups Dyer introduces a family of groups, which we call Dyer…
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 develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…
We find a condition on the underlying graph of an Artin group that fully determines if it is subgroup separable. As a consequence, an Artin group is subgroup separable if and only if it can be obtained from Artin groups of ranks at most 2…
We study the language-theoretic aspects of the word problem, in the sense of Duncan & Gilman, of free products of semigroups and monoids. First, we provide algebraic tools for studying classes of languages known as super-AFLs, which…
Inspired by a recent paper due to Jos\'{e} Luis Garc\'{i}a, we revisit the attempt of Daniel Simson to construct a counterexample to the pure semisimplicity conjecture. Using compactness, we show that the existence of such counterexample…
We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…
String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is…
Let $M(A,I)$ be a free partially commutative monoid with involution and $G(A,I)$ be its quotient group, e.g. a right-angled Artin or Coxeter group. Given a system of word equations over $M(A,I)$ with recognizable constraints with input size…
In an additive factorial monoid each element can be represented as a linear combination of irreducible elements (atoms) with uniquely determined coefficients running over all natural numbers. In this paper we develop for a wide class of…
Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to…
We consider the problem of deciding if a group is the fundamental group of a smooth connected complex quasi-projective (or projective) variety using Alexander-based invariants. In particular, we solve the problem for large families of…
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of…
We prove that an Artin-Tits group of type $\tilde C$ is the group of fractions of a Garside monoid, analogous to the known dual monoids associated with Artin-Tits groups of spherical type and obtained by the "generated group" method. This…
We prove the following results: (1) There is a one-relator inverse monoid $\mathrm{Inv}\langle A\:|\:w=1 \rangle$ with undecidable word problem; and (2) There are one-relator groups with undecidable submonoid membership problem. The first…
We observe an inductive structure in a large class of Artin groups and exploit this information to deduce the Farrell-Jones isomorphism conjecture for several classes of Artin groups of finite real, complex and affine types.
Artin glueings provide a way to reconstruct a frame from a closed sublocale and its open complement. We show that Artin glueings can be described as the weakly Schreier split extensions in the category of frames with finite-meet preserving…
Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of application has been constraint programming, whose key…
In this paper we study some combinatorial aspects of the singular Artin monoids. Firstly, we show that a singular Artin monoid $SA$ can be presented as a semidirect product of a graph monoid with its associated Artin group $A$. Such a…
In this paper, we establish a new criterion for determining whether an Artin group is subgroup separable (LERF), building upon a criterion introduced in a previous work. Specifically, we prove an Artin group is LERF if and only if it does…