Algorithms for arithmetic groups with the congruence subgroup property (original) (raw)
Related papers
Zariski Density and Computing in Arithmetic Groups
arXiv (Cornell University), 2016
For n > 2, let Γn denote either SL(n, Z) or Sp(n, Z). We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group H ≤ Γn. This forms the main component of our methods for computing with such arithmetic groups H. More generally, we provide algorithms for computing with Zariski dense groups in Γn. We use our GAP implementation of the algorithms to solve problems that have emerged recently for important classes of linear groups.
International Journal of Group Theory, 2013
Let FFF be a finite extension of BbbQBbb QBbbQ, ${Bbb Q}_p$ or a global field of positive characteristic, and let E/FE/FE/F be a Galois extension. We study the realization fields of finite subgroups GGG of GLn(E)GL_n(E)GLn(E) stable under the natural operation of the Galois group of E/FE/FE/F. Though for sufficiently large nnn and a fixed algebraic number field FFF every its finite extension EEE is realizable via adjoining to FFF the entries of all matrices ginGgin GginG for some finite Galois stable subgroup GGG of GLn(BbbC)GL_n(Bbb C)GLn(BbbC), there is only a finite number of possible realization field extensions of FFF if GsubsetGLn(OE)Gsubset GL_n(O_E)GsubsetGLn(OE) over the ring OEO_EOE of integers of EEE. After an exposition of earlier results we give their refinements for the realization fields E/FE/FE/F. We consider some applications to quadratic lattices, arithmetic algebraic geometry and Galois cohomology of related arithmetic groups.
Action of G and M on Q(√m) and Algorithmic Implementation for Group Actions
2012
This paper calls for a relationship among the actions of groups G and M on Q( p m). It characterized several signicant elements of G in terms of generators of M and vice versa. In this way we cultivate a correlation between the rudiments of these two modular groups. This will help us in discovering various G and M-Subsets of Q( p m). We have also generated an algorithm by using Visual Basic for calculating the congruence classes of dierent Moduli and manipulating the group actions.
An L(1/3) algorithm for ideal class group and regulator computation in certain number fields
Computing Research Repository, 2009
We analyse the complexity of the computation of the class group structure, regulator, and a system of fundamental units of a certain class of number fields. Our approach differs from Buchmann's, who proved a complexity bound of L(1/2, O(1)) when the discriminant tends to infinity with fixed degree. We achieve a subexponential complexity in O(L(1/3, O(1))) when both the discriminant and the degree of the extension tend to infinity by using techniques due to Enge and Gaudry in the context of algebraic curves over finite fields.
Computing in arithmetic groups with Voronoï's algorithm
Journal of Algebra, 2015
We describe an algorithm, meant to be very general, to compute a presentation of the group of units of an order in a (semi)simple algebra over Q. Our method is based on a generalisation of Voronoï's algorithm for computing perfect forms, combined with Bass-Serre theory. It differs essentially from previously known methods to deal with such questions, e.g. for units in quaternion algebras. We illustrate this new algorithm by a series of examples where the computations are carried out completely.
Modular Group Action on Quadratic Field by Linear Congruence
2012
This paper illustrates the Mobius groups M and Mon Q( √ m), where M ' = ⟨xy;yx⟩ is a subgroup of M. The system of lin- ear congruence is used to discover classes (a;b;c)(mod12) of elements of Q ∗ ( √ n) and then by means of these classes, we explored several M ' - subsets of Q ''' ( √ n) which assist in nding more
Sains Humanika, 2017
This research is focused on two types of finite abelian groups which are the group of integers under addition modulo , and the group of integers under multiplication modulo , where is any positive integer at most 200. The computations of some properties of the group including the order of the group, the order and inverse of each element, the cyclic subgroups, the generators of the group, and the lattice diagrams get more complicated and time consuming as n increases. Therefore, a special program is needed in the computation of these properties. Thus in this research, a program has been developed by using Microsoft Visual C++ Programming. This program enables the user to enter any positive integer at most 200 to generate answers for the properties of the groups.