On finitary properties for fiber products of free semigroups and free monoids

We consider necessary and sufficient conditions for finite generation and finite presentability for fiber products of free semigroups and free monoids. We give a necessary and sufficient condition on finite fiber quotients for a fiber product of two free monoids to be finitely generated, and show that all such fiber products are also finitely presented. By way of contrast, we show that fiber products of free semigroups over finite fiber quotients are never finitely generated. We then consider fiber products of free semigroups over infinite semigroups, and show that for such a fiber product to be finitely generated, the quotient must be infinite but finitely generated, idempotent-free, and $$\mathcal {J}$$ J -trivial. Finally, we construct automata accepting the indecomposable elements of the fiber product of two free monoids/semigroups over free monoid/semigroup fibers, and give a necessary and sufficient condition for such a product to be finitely generated.

Finite presentability of generalized Bruck–Reilly ∗-extension of groups

In [Finite presentability of Bruck–Reilly extensions of groups, J. Algebra 242 (2001) 20–30], Araujo and Ruškuc studied finite generation and finite presentability of Bruck–Reilly extension of a group. In this paper, we aim to generalize some results given in that paper to generalized Bruck–Reilly ∗-extension of a group. In this way, we determine necessary and sufficent conditions for generalized Bruck–Reilly ∗-extension of a group, [Formula: see text], to be finitely generated and finitely presented. Let [Formula: see text] be a group, [Formula: see text] be morphisms and [Formula: see text] ([Formula: see text] and [Formula: see text] are the [Formula: see text]- and [Formula: see text]-classes, respectively, contains the identity element [Formula: see text] of [Formula: see text]). We prove that [Formula: see text] is finitely generated if and only if there exists a finite subset [Formula: see text] such that [Formula: see text] is generated by [Formula: see text]. We also prove that [Formula: see text] is finitely presented if and only if [Formula: see text] is presented by [Formula: see text], where [Formula: see text] is a finite set and [Formula: see text] [Formula: see text] for some finite set of relations [Formula: see text].

QUASI-ISOMETRY AND FINITE PRESENTATIONS OF LEFT CANCELLATIVE MONOIDS

We show that being finitely presentable and being finitely presentable with solvable word problem are quasi-isometry invariants of finitely generated left cancellative monoids. Our main tool is an elementary, but useful, geometric characterization of finite presentability for left cancellative monoids. We also give examples to show that this characterization does not extend to monoids in general, and indeed that properties such as solvable word problem are not isometry invariants for general monoids.