Related papers: Recognition and constructive membership for discre…

We give a computationally effective criterion for determining whether a finite-index subgroup of SL(2, Z) is a congruence subgroup, extending earlier work of Hsu for subgroups of PSL(2, Z).

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 develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$,…

We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

Let $G$ be a connected semisimple real algebraic group and $\Gamma<G$ be its Zariski dense discrete subgroup. We prove that if $\Gamma\backslash G$ admits any finite Bowen-Margulis-Sullivan measure, then $\Gamma$ is virtually a product of…

A group $\Gamma$ is said to be periodic if for any $g$ in $\Gamma$ there is a positive integer $n$ with $g^n=id$. We first prove that a finitely generated periodic group acting on the 2-sphere $\SS^2$ by $C^1$-diffeomorphisms with a finite…

Let $G$ be a finite group given as input by its multiplication table. For a subset $S$ of $G$ and an element $g\in G$ the Cayley Group Membership Problem (denoted CGM) is to check if $g$ belongs to the subgroup generated by $S$. While this…

A group $G$ is said to have dense solitary subgroups if each non-empty open interval in its subgroup lattice $L(G)$ contains a solitary subgroup. In this short note, we find all finite groups satisfying this property.

We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…

There is a procedure, due to Dani and Levcovitz, for taking a finite simplicial graph (\Gamma) and a subgraph (\Lambda) of its complement, checking some conditions, and, if satisfied, producing a graph (\Delta) such that the right-angled…

This essay advocates the view that any problem that has a meaningful empirical content, can be formulated in constructive, more definitely, finite terms. We consider combinatorial models of dynamical systems and approaches to statistical…

We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie…

Multi-material design optimization problems can, after discretization, be solved by the iterative solution of simpler sub-problems which approximate the original problem at an expansion point to first order. In particular, models…

Let $G$ be a finitely generated group of isometries of $\HH^m$, hyperbolic $m$-space, for some positive integer $m$. %or equivalently elements of $PSL(2,\CC)$. The discreteness problem is to determine whether or not $G$ is discrete. Even in…

We define a partition of a reductive group into finitely many subsets, refining the partition of the group into strata. We state some conjectural properties of these subsets (called substrata) and verify them in some examples.

By an $\ell$-group $G$ we mean a lattice-ordered abelian group. This paper is concerned with the category $\FP$ of finitely presented {\it unital} $\ell$-groups, those $\ell$-groups having a distinguished order-unit $u$. Using the duality…

In the 1980's Stallings showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse…

We prove that a discrete subgroup generated by two lattices in opposite minimal horospherical subgroups of $SL(3,\mathbb{C})$ is arithmetic and thus by a Borel and Harish-Chandra also a lattice. We follow the method and ideas used by Oh in…

In this note, we investigate how different fundamental groups of presentations of a fixed algebra $A$ can be. For finitely many finitely presented groups $G_i$, we construct an algebra $A$ such that all $G_i$ appear as fundamental groups of…