Related papers: Presenting parabolic subgroups
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…
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 finite solvable group. Then $G$ always has a useful presentation, which we call a "long presentation". Using a "long presentation" of $G$, we present an inductive method of constructing the irreducible representations of $G$…
In this paper we study hyperbolicty of the universal group $U(P)$ of a pregroup $P$. Given a finitely generated group $G$ and a pregroup $P$ such that $G \simeq U(P)$, we provide a particular set of axioms on $P$ which ensure that $G$ is…
An automorphism $\alpha$ of a group $G$ is normal if it fixes every normal subgroup of $G$ setwise. We give an algebraic description of normal automorphisms of relatively hyperbolic groups. In particular, we prove that for any relatively…
We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…
Given a finitely generated group $G$ that is relatively finitely presented with respect to a collection of peripheral subgroups, we prove that every infinite subgroup $H$ of $G$ that is bounded in the relative Cayley graph of $G$ is…
We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.
We prove that there is an algorithm to determine whether a tuple of elements in a toral relatively hyperbolic group G is in the automorphic orbit of the other tuple.
A closed subgroup of a semisimple algebraic group is called irreducible if it lies in no proper parabolic subgroup. In this paper we classify all irreducible subgroups of exceptional algebraic groups $G$ which are connected, closed and…
This text brings to an end the classification of non-reduced parabolic subgroups in positive characteristic, especially two and three: they are all obtained as intersections of parabolics having maximal reduced part. We prove this result…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
We prove that a parabolic subgroup $P$ contained in another parabolic subgroup $P'$ of an Artin group $A$ is a parabolic subgroup of $P'$. This answers a question of Godelle which is not obvious despite appearances. In order to achieve our…
We suggest a new approach to the study of relatively hyperbolic groups based on relative isoperimetric inequalities. Various geometric, algebraic, and algorithmic properties are discussed.
Let $G=G(K)$ be a simple algebraic group defined over an algebraically closed field $K$ of characteristic $p>0$. A subgroup $X$ of $G$ is said to be $G$-completely reducible if, whenever it is contained in a parabolic subgroup of $G$, it is…
Given any finitely presented group G we find a triangular algebra such that has two presentations, one with fundamental group G and another with trivial group. Thus proving that given a collection G1,...,Gn of finitely presented groups…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in…