Related papers: Algorithmic problems in groups with quadratic Dehn…
This is the first of two papers devoted to connections between asymptotic functions of groups and computational complexity. One of the main results of this paper states that if for every $m$ the first $m$ digits of a real number $\alpha\ge…
This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…
We construct examples of finitely presented simple groups whose Dehn functions are at least exponential. To the best of our knowledge, these are the first such examples known. Our examples arise from R\"over-Nekrashevych groups, using…
The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…
We prove that if every hyperbolic group is residually finite, then every quasi-convex subgroup of every hyperbolic group is separable. The main tool is relatively hyperbolic Dehn filling.
While Dehn functions, D(n), of finitely presented groups are very well studied in the literature, mean Dehn functions are much less considered. M. Gromov introduced the notion of mean Dehn function of a group, $D_{mean}(n)$, suggesting that…
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).…
A group $G$ with conjugation operation is a rack. We call such racks \emph{group racks}. In this paper we study finite group racks via their subrack lattices. Heckenberger, Shareshian, and Welker proved that the isomorphism type of the…
We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the…
The Diophantine problem for a monoid $M$ is the decision problem to decide whether any given system of equations has a solution in $M$. In this note, we give a simple example of a context-free, word-hyperbolic, finitely presented, special…
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…
In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…
This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…
The present work stemmed from the study of the problem of harmonic analysis on the infinite-dimensional unitary group U(\infty). That problem consisted in the decomposition of a certain 4-parameter family of unitary representations, which…
We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…
We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…
Dehn fillings for relatively hyperbolic groups generalize the topological Dehn surgery on a non-compact hyperbolic $3$-manifold such as a hyperbolic knot complement. We prove a rigidity result saying that if two non-elementary relatively…
We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we…
We give an infinite family of monoids $\Pi_N$ (for $N=2, 3, \dots$), each with a single defining relation of the form $bUa = a$, such that the Dehn function of $\Pi_N$ is at least exponential. More precisely, we prove that the Dehn function…