Related papers: Coset enumeration for certain infinitely presented…

We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…

We consider two decision problems in infinite groups. The first problem is Subgroup Intersection: given two finitely generated subgroups $\langle \mathcal{G} \rangle, \langle \mathcal{H} \rangle$ of a group $G$, decide whether the…

We give a simple algorithm that enables us to determine whether a subgroup of finite index of the Hecke group is normal.

We study two group theoretic problems, GROUP INTERSECTION and DOUBLE COSET MEMBERSHIP, in the setting of black-box groups, where DOUBLE COSET MEMBERSHIP generalizes a set of problems, including GROUP MEMBERSHIP, GROUP FACTORIZATION, and…

This paper presents some algorithms in linear algebraic groups. These algorithms solve the word problem and compute the spinor norm for orthogonal groups. This gives us an algorithmic definition of the spinor norm. We compute the double…

In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…

In this paper, we obtain classification of the topological holonomy groups in $SO(3)$. Such a group is given by one of the following: a finite group (such groups are classified by Klein); a commutative infinite group which is generated by…

In this note we present an algorithm for the construction of the unit group of the Burnside ring $\Omega(G)$ of a finite group $G$ from a list of representatives of the conjugacy classes of subgroups of G.

In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.

The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…

In this paper, we survey some of the recent advances on embeddings into finitely generated (left-orderable) simple group such that the overgroup preserves algorithmic, geometric, or algebraic information about the embedded group. We discuss…

We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…

A subgroup H of a group G is called inert if for each $g\in G$ the index of $H\cap H^g$ in $H$ is finite. We give a classification of soluble-by-finite groups $G$ in which subnormal subgroups are inert in the cases where $G$ has no…

We study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the complexity of the other, but this is not the case sometimes. J.…

Let $G$ be a classical algebraic group, $X$ a maximal rank reductive subgroup and $P$ a parabolic subgroup. This paper classifies when $X\G/P$ is finite. Finiteness is proven using geometric arguments about the action of $X$ on subspaces of…

We study the subgroup structure of the infinite torsion $p$-groups defined by Gupta and Sidki in 1983. In particular, following results of Grigorchuk and Wilson for the first Grigorchuk group, we show that all infinite finitely generated…

We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define…

We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…

Stallings folding theory is modified, using double coset representatives, and to applied to the study of subgroups of amalgamated products of finite rank free groups. As a first application the subgroup membership problem for such groups is…

We prove that any non-cocompact irreducible lattice in a higher rank semi-simple Lie group contains a subgroup of finite index, which has three generators.