Implementing the Round Four maximal order algorithm

David Ford; Pascal Letard

Journal de théorie des nombres de Bordeaux (1994)

  • Volume: 6, Issue: 1, page 39-80
  • ISSN: 1246-7405

How to cite

top

Ford, David, and Letard, Pascal. "Implementing the Round Four maximal order algorithm." Journal de théorie des nombres de Bordeaux 6.1 (1994): 39-80. <http://eudml.org/doc/247534>.

@article{Ford1994,
author = {Ford, David, Letard, Pascal},
journal = {Journal de théorie des nombres de Bordeaux},
keywords = {round four algorithm; monic separable polynomial; integral -adic coefficients; factorization algorithm; explicit programs},
language = {eng},
number = {1},
pages = {39-80},
publisher = {Université Bordeaux I},
title = {Implementing the Round Four maximal order algorithm},
url = {http://eudml.org/doc/247534},
volume = {6},
year = {1994},
}

TY - JOUR
AU - Ford, David
AU - Letard, Pascal
TI - Implementing the Round Four maximal order algorithm
JO - Journal de théorie des nombres de Bordeaux
PY - 1994
PB - Université Bordeaux I
VL - 6
IS - 1
SP - 39
EP - 80
LA - eng
KW - round four algorithm; monic separable polynomial; integral -adic coefficients; factorization algorithm; explicit programs
UR - http://eudml.org/doc/247534
ER -

References

top
  1. 1 A. Ash, R. Pinch, R. Taylor, An Â4 extension of Q attached to a non-selfdual autormorphic form on GL(3), Mathennatische Annalen291 (1991), 753-766. Zbl0713.11036MR1135542
  2. 2 R. Böffgen, Der Algorithmus von Ford/Zassenhaus zur Benechnung von Genzheitsbasen. in Polynomalgebren, Annales Universitatis Saraviensis, Series Mathematicae1 (1987), no. 3, 60-129. Zbl0613.12011MR880225
  3. 3 R. Böffgen, M.A. Reichert, Computing the Decomposition of Primes p and p-adic Absolute Values in Semi-simple Algebras over Q, Journal of Symbolic Computation4 (1987), 3-10. Zbl0624.12001MR908407
  4. 4 R.J. Bradford, On the Computation of Iritegnal Bases and Defects of Integrity, PhD Dissertation, University of Bath, 1988. 
  5. 5 B.W. Char, K.O. Geddes, G.H. Gonnet, B.L. Leong, M.B. Monagan, S.M. Watt, Maple V Language Reference Manual, Springer-Verlag, New York, 1991. Zbl0758.68038
  6. 6 H. Cohen, A Course in Computational Algebraic Number Theory, Springer-Verlag, New York, 1993. Zbl0786.11071MR1228206
  7. 7 D. Ford, On the Computation of the Maximal Order in a Dedekind Domain, PhD Dissertation, Ohio State University, 1978. 
  8. 8 D. Ford, The Construction of Maximal Orders over a Dedekind Domain, Journal of Symbolic Computation4 (1987), 69-75. Zbl0632.13003MR908413
  9. 9 M. Pohst, H. Zassenhaus, Algorithmic Algebraic Number Theory, Cambridge University Press, Cambridge, 1989. Zbl0685.12001MR1033013
  10. 10 O. Zariski, P. Samuel, Commutative Algebra, Vol I, Van Nostrand, Princeton, New Jersey, 1958. Zbl0081.26501MR90581
  11. 11 H. Zassenhaus, On Hensel Factorization II, Symposia Mathematica. XV (1975), Academic Press, London, 499-513. Zbl0337.12014MR389870
  12. 12 H. Zimmer, Computational Problems, Methods and Results in Algebraic Number Theory, Lecture Notes in Mathematics262, Springer-Verlag, 1972. Zbl0231.12001MR323751

NotesEmbed ?

top

You must be logged in to post comments.