Related papers: Two Algorithms in Group Theory

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

We design new deterministic and randomized algorithms for computational problems in free solvable groups. In particular, we prove that the word problem and the power problem can be solved in quasi-linear time and the conjugacy problem can…

A word hyperbolic group $G$ is called GFERF if every quasiconvex subgroup coincides with the intersection of finite index subgroups containing it. We show that in any such group, the product of finitely many quasiconvex subgroups is closed…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

Given a group acting cellularly and cocompactly on a simply-connected 2-complex, we provide a criterion establishing that all finitely generated subgroups have quasiconvex orbits. This work generalizes the "perimeter method". As an…

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…

We describe an algorithm which determines whether or not a group which is hyperbolic relative to abelian groups admits a nontrivial splitting over a finite group.

Let $G$ be a relatively hyperbolic group and let $Q$ and $R$ be relatively quasiconvex subgroups. It is known that there are many pairs of finite index subgroups $Q' \leqslant_f Q$ and $R' \leqslant_f R$ such that the subgroup join $\langle…

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

We develop two adaptive discretization algorithms for convex semi-infinite optimization, which terminate after finitely many iterations at approximate solutions of arbitrary precision. In particular, they terminate at a feasible point of…

In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…

Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…

In this paper, we prove a limit set intersection theorem in relatively hyperbolic groups. Our approach is based on a study of dynamical quasiconvexity of relatively quasiconvex subgroups. Using dynamical quasiconvexity, many well-known…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

In this paper we propose a subgradient algorithm for solving the equilibrium problem where the bifunction may be quasiconvex with respect to the second variable. The convergence of the algorithm is investigated. A numerical example for a…

We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…

The aim of this short note is to provide a proof of the decidability of the generalized membership problem for relatively quasi-convex subgroups of finitely presented relatively hyperbolic groups, under some reasonably mild conditions on…

If $G_1$ and $G_2$ are torsion-free hyperbolic groups and $P<G_1\times G_2$ is a finitely generated subdirect product, then the conjugacy problem in $P$ is solvable if and only if there is a uniform algorithm to decide membership of the…

Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…