相关论文: On computing finite index subgroups of PSL(2,Z)

We count the finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$. More precisely: each such subgroup $H$ can be represented by its Stallings graph $\Gamma(H)$, we consider the number of vertices of $\Gamma(H)$ to…

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…

Let $G$ denote the projective special linear group $\text{PSL}(2,q)$, for a prime power $q$. It is shown that a finite 2-subgroup of the group $V(\mathbb{Z}G)$ of augmentation 1 units in the integral group ring $\mathbb{Z}G$ of $G$ is…

We show how to count and randomly generate finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for…

Let $n \ge 3$. We positively answer a question of Lubotzky and prove that every finite index subgroup of SL(n, Z) contains a finite index subgroup which is generated by two elements.

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).

For a number field K, we show that any S-arithmetic subgroup of SL_2(K) contains a subgroup of finite index generated by three elements if card(S)> 1.

In the late 19th century, Klein inaugurated a program for describing the finite subgroups of $PGL_2(k)$ by treating the case in which the field $k$ is the complex numbers. Gierster and Moore extended Klein's arguments to deal with finite…

Finite index subgroups of the modular group are of great arithmetic importance. Farey symbols, introduced by Ravi Kulkarni in 1991, are a tool for working with these groups. Given such a group $\Gamma$, a Farey symbol for $\Gamma$ is a…

We reduce the computation of Poisson traces on quotients of symplectic vector spaces by finite subgroups of symplectic automorphisms to a finite one, by proving several results which bound the degrees of such traces as well as the dimension…

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…

We use recurrence relations to derive explicit formulas for counting the number of subgroups of given order (or index) in rank 3 finite abelian p-groups and use these to derive similar formulas in few cases for rank 4. As a consequence, we…

We classify, up to conjugacy, the finite subgroups of PGL(2,K) of order prime to char(K).

We complete the description of automorphism groups of all nonsplit extensions of elementary abelian $2$-groups by $PSL_2(q)$, with $q$ odd, for an irreducible induced action. An application of this result to the theory of $\pi$-submaximal…

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…

In this paper we characterize the elements of PSL(2,Z), as a subgroup of Thompson group T, in the language of reduced tree pair diagrams and in terms of piecewise linear maps as well. Actually, we construct the reduced tree pair diagram for…

We provide an effective classification of postcritically finite polynomials as dynamical systems by means of Hubbard Trees. This can be viewed as an application of the results developed in part 1 (Stony Brook IMS 1993/5).

We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…

Let $G$ be a finite group and let $H$ be a proper subgroup of $G$ of minimal index. By applying an old result of Y. Berkovich, we provide a polynomial algorithm for computing $|G : H|$ for a permutation group $G$. Moreover, we find $H$…

In this article we investigate the number of subrings of $\Z^d$ using subring zeta functions and $p$-adic integration.