Related papers: On the difficulty of presenting finitely presentab…

There exist right angled Artin groups $A$ such that the isomorphism problem for finitely presented subgroups of $A$ is unsolvable, and for certain finitely presented subgroups the conjugacy and membership problems are unsolvable. It follows…

We present two uncountable families of finitely generated residually finite groups all having the same profinite completion. One consists of soluble groups, the other of branch groups.

The Cohn-Umans (FOCS '03) group-theoretic framework for matrix multiplication produces fast matrix multiplication algorithms from three subsets of a finite group $G$ satisfying a simple combinatorial condition (the Triple Product Property).…

The monogenic free inverse semigroup $FI_1$ is not finitely presented as a semigroup due to the classic result by Schein (1975). We extend this result and prove that a finitely generated subsemigroup of $FI_1$ is finitely presented if and…

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

Tits has defined Kac-Moody and Steinberg groups over commutative rings, providing infinite dimensional analogues of the Chevalley-Demazure group schemes. Here we establish simple explicit presentations for all Steinberg and Kac-Moody groups…

It is well known that the triviality problem for finitely presented groups is unsolvable; we ask the question of whether there exists a general procedure to produce a non-trivial element from a finite presentation of a non-trivial group. If…

We show that if a group G is finitely presented and nilpotent-by-abelian-by-finite, then there is an upper bound on the first betti number of M as M runs through all subgroups of finite index in G.

Given a universal elementary Chevalley-Demazure group $E_\Phi^{sc}(R)$ for which its (standard) parabolic subgroups are finitely generated, we consider the problem of classifying which parabolics $P(R) \subset E_\Phi^{sc}(R)$ are finitely…

We show that for any pair of non-trivial finite groups, their coproduct in the category of finite groups is not representable.

A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…

We describe a new type of polycyclic presentations, that we will call refined solvable presentations, for polycyclic groups. These presentations are obtained by refining a series of normal subgroups with abelian sections. These…

We introduce the class of perturbed right-angled Artin groups. These are constructed by gluing Bieri double groups into standard right-angled Artin groups. As a first application of this construction we obtain families of CAT(0) groups…

We construct a finitely presented group $G$ with non-quadratic Dehn function $f$ majorizable by a quadratic function on arbitrary long intervals.

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

We prove that the irreducible affine Coxeter groups are first-order rigid and deduce from this that they are profinitely rigid in the absolute sense. We then show that the first-order theory of any irreducible affine Coxeter group does not…

We show that a finitely generated soluble group is virtually nilpotent if and only if the diameter of its finite coset spaces admits a uniform polynomial lower bound in terms of their size. We obtain the same conclusion for certain finitely…

In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…

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…

We apply the techniques of symmetric generation to establish the standard presentations of the finite simply laced irreducible finite Coxeter groups, that is the Coxeter groups of types An, Dn and En, and show that these are naturally…