Related papers: On the difficulty of presenting finitely presentab…
We study the subgroup structure, Hecke algebras, quasi-regular representations, and asymptotic properties of some fractal groups of branch type. We introduce parabolic subgroups, show that they are weakly maximal, and that the corresponding…
William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…
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…
A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…
We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…
Given a finitely generated linear group $G$ over $\mathbb{Q}$, we construct a simple group $\Gamma$ that has the same finiteness properties as $G$ and admits $G$ as a quasi-retract. As an application, we construct a simple group of type…
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…
The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…
We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…
In this thesis we investigate the Dehn functions of two different classes of groups: subdirect products, in particular subdirect products of limit groups; and Bestvina-Brady groups. Let D = \Gamma_1 \times ... \times \Gamma_n be a direct…
The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…
There has been substantial investigation in recent years of subdirect products of limit groups and their finite presentability and homological finiteness properties. To contrast the results obtained for limit groups, Baumslag, Bridson, Holt…
We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First,…
We study the construction of premonoidal categories, where the pentagon relation fails, through representations of finite group algebras and their quantum doubles. Both finite group algebras and their quantum doubles have a finite number of…
A result by Bridson, Howie, Miller, and Short states that if $S$ is a finitely presented subgroup of the direct product of free groups, then $S$ is virtually a nilpotent extension of a direct product of free groups. Moreover, if $S$ is a…
In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…
The problem of describing the group of units $\mathcal{U}(\mathbb{Z} G)$ of the integral group ring $\mathbb{Z} G$ of a finite group $G$ has attracted a lot of attention and providing presentations for such groups is a fundamental problem.…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…