Related papers: Algorithms for arithmetic groups with the congruen…
We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…
Daniel Simon's 1994 discovery of an efficient quantum algorithm for solving the hidden subgroup problem (HSP) over Z_2^n provided one of the first algebraic problems for which quantum computers are exponentially faster than their classical…
This book provides a gentle introduction to the study of arithmetic subgroups of semisimple Lie groups. This means that the goal is to understand the group SL(n,Z) and certain of its subgroups. Among the major results discussed in the later…
We improve the central stability ranges for H2(Torelli subgroup of Aut(Fn)'s) as GL_n(Z)-representations, H2(Torelli subgroup of mapping class groups) as Sp_2g(Z)-representations, Hk(congruence subgroups of GL_n(R)'s) as…
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 study the limiting behavior of the discrete spectra associated to the principal congruence subgroups of a reductive group over a number field. While this problem is well understood in the cocompact case (i.e., when the group is…
We consider what some authors call 'parabolic M\"obius subgroups' of matrices over Z, Q, and R and focus on the membership problem in these subgroups and complexity of relevant algorithms.
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
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…
In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…
Let $G$ be a finite group, $N$ a nilpotent normal subgroup of $G$ and let $\mathrm{V}(\mathbb{\Z} G, N)$ denote the group formed by the units of the integral group ring $\mathbb{\Z} G$ of $G$ which map to the identity under the natural…
The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…
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…
We compute conjugacy classes in maximal parabolic subgroups of the general linear group. This computation proceeds by reducing to a ``matrix problem''. Such problems involve finding normal forms for matrices under a specified set of row and…
Let G be an arithmetic lattice in a semisimple algebraic group over a number field. We show that if G has the congruence subgroup property, then the number of n-dimensional irreducible representations of G grows like n^a, where a is a…
In two previous papers [AGM1, AGM2] we computed cohomology groups H^5(\Gamma_0 (N); \C) for a range of levels N, where \Gamma_0 (N) is the congruence subgroup of SL_4 (\Z) consisting of all matrices with bottom row congruent to (0,0,0,*)…
Let $G$ be a finite group. The aim of this paper is to study the number of solutions $S\subseteq G$ of the equation $\mho^{\{n\}}(S)=L$, where $L$ is a non-empty subset of $G$, $n$ is a positive integer and $\mho^{\{n\}}(S)=\{ s^n \ | \…
We describe the $\mathbb{F}_p$-cohomology of the congruence subgroups $SL_n(\mathbb{Z}, p^m)$ in degrees $* < p-1$, for all large enough $n$, establishing a formula proposed by F. Calegari. Along the way, we also establish a formula for the…
The absolute Galois group Gal$(\overline{\mathbb{Q}}/\mathbb{Q})$ of the field $\mathbb{Q}$ of rational numbers can be presented as a highly computable object, under the notion of type-2 Turing computation. We formalize such a presentation…
If a (cusped) surface S admits an ideal triangulation T with no shears, we show an efficient algorithm to give S as a quotient of hypebolic plane by a subgroup of PSL(2, Z). The algorithm runs in time O(n log n), where n is the number of…