Related papers: Recognition and constructive membership for discre…

We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…

This thesis contains a collection of algorithms for working with the twisted groups of Lie type known as Suzuki groups, and small and large Ree groups. The two main problems under consideration are constructive recognition and constructive…

Motivated by a question of A. Rapinchuk concerning general reductive groups, we are investigating the following question: Given a finitely generated integral domain $R$ with field of fractions $F$, is there a \emph{finitely generated…

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…

We describe algorithms and heuristics that allow us to express arbitrary elements of SLn (Z) and Sp2n (Z) as products of generators in particular "standard" generating sets. For elements obtained experimentally as random products, it…

We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n,…

The problem of enumeration of conjugacy classes of finite abelian subgroups of the mapping class group $\mathcal{M}_{\sigma}$ of a compact closed surface $X$ of genus $\sigma$ is considered. A complete method of enumeration is achieved for…

We consider a class of finite Markov moment problems with arbitrary number of positive and negative branches. We show criteria for the existence and uniqueness of solutions, and we characterize in detail the non-unique solution families.…

We present an algorithm to decide whether or not a finitely generated subgroup of the isometry group of a locally finite simplicial tree is both discrete and free. The correctness of this algorithm relies on the following conjecture: every…

Operators acting on the discrete random chaos yield signed multiplicative systems, extending the notion of spin matrices and quaternions. We investigate signed groups through the associated sign matrices, focusing on generators and their…

We address two questions of Simon Thomas. First, we show that for any n>2 one can find a four generated free subgroup of SLn(Z) which is profinitely dense. More generally, we show that an arithmetic group \Gamma which admits the congruence…

We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the…

We construct the finite-dimensional continuous complex representations of $\mathrm{SL}_2$ over compact discrete valuation rings of even residual characteristic. We also prove that the complex group algebras of $\mathrm{SL}_2$ over finite…

We show how to efficiently count and generate uniformly at random finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. The method to achieve these results relies on a natural map of…

In the first part of this work we have established an efficient method to obtain a topological classification of locally discrete, finitely generated, virtually free subgroups of real-analytic circle diffeomorphisms. In this second part we…

Let f be an arbitrary positive integer valued function. The goal of this note is to show that one can construct a finitely generated group in which the discrete log problem is polynomially equivalent to computing the function f. In…

We initiate a new, computational approach to a classical problem: certifying non-freeness of ($2$-generator, parabolic) M\"{o}bius subgroups of $\mathrm{SL}(2,\mathbb{Q})$. The main tools used are algorithms for Zariski dense groups and…

We prove a factorization theorem for Fuchsian groups similar to those proved by Agol and Liu for 3-manifold groups. As an application, we build Makanin-Razborov diagrams, which parametrize the collection of all discrete representations from…

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

Let $G$ be a real Lie group and $\Gamma < G$ be a discrete subgroup of $G$. Is $\Gamma$ residually finite? This paper describes known positive and negative results then poses some questions whose answers will lead to a fairly complete…