Related papers: Solving linear equations over finitely generated a…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…

A group is metabelian if its commutator subgroup is abelian. For finitely generated metabelian groups, classical commutative algebra, algebraic geometry and geometric group theory, especially the latter two subjects, can be brought to bear…

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

We develop the theory of $H$-graded manifolds for any finitely generated abelian group, using tools from representation theory. Furthermore, we introduce and investigate the notion of $H$-graded coverings of supermanifolds in the case where…

We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is…

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian…

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…

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$…

Let $G$ be a finitely generated malabelian group, let $A\leq\mathrm{Out}(G)$ be a finitely generated subgroup, and let $\Gamma_{G,A}$ denote the preimage of $A$ in $\mathrm{Aut}(G)$. We give a general criterion for the linearity of…

If G and H are finitely generated, residually nilpotent metabelian groups, H is termed para-G if there is a homomorphism of G into H which induces an isomorphism between the corresponding terms of their lower central quotient groups. We…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

Let $C$ be an affine curve over an algebraically closed field $k$ of characteristic $p>0$. Given an embedding problem $(\beta:\Gamma\longrightarrow G, \alpha: \pi^{et}_1(C)\longrightarrow G)$ for $\pi_1^{et}(C)$ where $\beta$ is a…

In this paper, we explore the behaviour of the fixed subgroups of endomorphisms of free-abelian times free (FATF) groups. We exhibit an algorithm which, given a finitely generated subgroup $\mathcal{H}$ of a FATF group $\mathcal{G}$,…

For every $m\geq 2$ we produce an example of a non-hyperbolic finitely presented subgroup $H < G$ of a hyperbolic group $G$, which is the kernel of a surjective homomorphism $\phi: G\to \mathbb{Z}^m$. The examples we produce are of…

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…

We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for…