A practical version of the generalized Lagrange algorithm.
Buchmann, Johannes, Jüntgen, Max, Pohst, Michael (1994)
Experimental Mathematics
Similarity:
Displaying similar documents to “Euclid's algorithm in algebraic function fields, II”
A practical version of the generalized Lagrange algorithm.
Normal orders for certain functions associated with factorizations in number fields
W. Narkiewicz, J. Śliwa (1978)
Colloquium Mathematicae
Similarity:
On relations between units of normal algebraic number fields and their subfields
Joseph Liang (1972)
Acta Arithmetica
Similarity:
On algebraic number fields with non-unique factorization, II
W. Narkiewicz (1966)
Colloquium Mathematicae
Similarity:
A simple, (almost) non-inductive proof for the existence of composite fields and algebraic closures.
Dress, Andreas W.M. (1997)
Beiträge zur Algebra und Geometrie
Similarity:
Thue equations over algebraic function fields
Günter Lettl (2005)
Acta Arithmetica
Similarity:
Note about the parallel projection method for solution of system of linear algebraic equations
Fridrich Sloboda (1974)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Representability by certain norm forms over algebraic number fields
John Smith (1975)
Acta Arithmetica
Similarity:
A computer algorithm for finding new euclidean number fields
Roland Quême (1998)
Journal de théorie des nombres de Bordeaux
Similarity:
This article describes a computer algorithm which exhibits a sufficient condition for a number field to be euclidean for the norm. In the survey [3] p 405, Franz Lemmermeyer pointed out that 743 number fields where known (march 1994) to be euclidean (the first one, , discovered by Euclid, three centuries B.C.!). In the first months of 1997, we found more than 1200 new euclidean number fields of degree 4, 5 and 6 with a computer algorithm involving classical lattice properties of the...
A sixteenth-order polylogarithm ladder.
Cohen, Henri, Lewin, Leonard, Zagier, Don (1992)
Experimental Mathematics
Similarity: