Add to ORKGArithmetic Kleinian groups are arithmetic lattices in PSL_2(C). We present an algorithm which, given such a group Gamma, returns a fundamental domain and a finite presentation for Gamma with a computable isomorphism.Algorithmic Number Theory in Computer Scienc
For n > 2, let Gamma(n) denote either SL( n, Z) or Sp( n, Z). We give a practical algorithm t...
AbstractWe present the main ideas for an algorithm to calculate the group of automorphisms of a Eucl...
Les algèbres centrales simples ont de nombreuses applications en théorie des nombres, mais leur algo...
We present an algorithm which, given an arithmetic Kleinian group Γ, returns a fundamental domain an...
International audienceArithmetic Kleinian groups are arithmetic lattices in PSL_2(C). We present an ...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX84080 / BLDSC - British Library Do...
Abstract. We give an arithmetic criterion which is sufficient to imply the discreteness of various t...
Available from British Library Document Supply Centre- DSC:D183967 / BLDSC - British Library Documen...
© 2014 Elsevier Inc. We develop practical techniques to compute with arithmetic groups H≤SL(n,Q) for...
© 2014 Elsevier Inc. We develop practical techniques to compute with arithmetic groups H≤SL(n,Q) for...
This book describes the basic algorithmic ideas behind accepted methods for computing with finitely ...
I I n t roduct ion Let G be a subgroup of PSL(2, C). The discreteness problem for G is the problem o...
This paper forms part of the program to identify all the 2-generator arithmetic Kleinian groups. Her...
This paper forms part of the program to identify all the 2-generator arithmetic Kleinian groups. Her...
For n > 2, let Gamma(n) denote either SL( n, Z) or Sp( n, Z). We give a practical algorithm t...
For n > 2, let Gamma(n) denote either SL( n, Z) or Sp( n, Z). We give a practical algorithm t...
AbstractWe present the main ideas for an algorithm to calculate the group of automorphisms of a Eucl...
Les algèbres centrales simples ont de nombreuses applications en théorie des nombres, mais leur algo...
We present an algorithm which, given an arithmetic Kleinian group Γ, returns a fundamental domain an...
International audienceArithmetic Kleinian groups are arithmetic lattices in PSL_2(C). We present an ...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX84080 / BLDSC - British Library Do...
Abstract. We give an arithmetic criterion which is sufficient to imply the discreteness of various t...
Available from British Library Document Supply Centre- DSC:D183967 / BLDSC - British Library Documen...
© 2014 Elsevier Inc. We develop practical techniques to compute with arithmetic groups H≤SL(n,Q) for...
© 2014 Elsevier Inc. We develop practical techniques to compute with arithmetic groups H≤SL(n,Q) for...
This book describes the basic algorithmic ideas behind accepted methods for computing with finitely ...
I I n t roduct ion Let G be a subgroup of PSL(2, C). The discreteness problem for G is the problem o...
This paper forms part of the program to identify all the 2-generator arithmetic Kleinian groups. Her...
This paper forms part of the program to identify all the 2-generator arithmetic Kleinian groups. Her...
For n > 2, let Gamma(n) denote either SL( n, Z) or Sp( n, Z). We give a practical algorithm t...
For n > 2, let Gamma(n) denote either SL( n, Z) or Sp( n, Z). We give a practical algorithm t...
AbstractWe present the main ideas for an algorithm to calculate the group of automorphisms of a Eucl...
Les algèbres centrales simples ont de nombreuses applications en théorie des nombres, mais leur algo...