Solvability of norm equations over cyclic number fields of prime degree
Open Access
- 1 October 1996
- journal article
- research article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 65 (216) , 1663-1674
Abstract
Let L = Q [ α ] L={\mathbb {Q}} [\alpha ] be an abelian number field of prime degree q q , and let a a be a nonzero rational number. We describe an algorithm which takes as input a a and the minimal polynomial of α \alpha over Q {\mathbb {Q}} , and determines if a a is a norm of an element of L L . We show that, if we ignore the time needed to obtain a complete factorization of a a and a complete factorization of the discriminant of α \alpha , then the algorithm runs in time polynomial in the size of the input. As an application, we give an algorithm to test if a cyclic algebra A = ( E , σ , a ) A=( E, \sigma , a ) over Q {\mathbb {Q}} is a division algebra.Keywords
This publication has 12 references indexed in Scilit:
- Algebraic Number Fields1995
- Finding maximal orders in semisimple algebras over Qcomputational complexity, 1993
- A Course in Computational Algebraic Number Theory1993
- Algorithmic properties of maximal orders in simple algebras over Qcomputational complexity, 1992
- Algorithms in algebraic number theoryBulletin of the American Mathematical Society, 1992
- Algorithmic Algebraic Number Theory1989
- p-adic Numbers, p-adic Analysis, and Zeta-Functions1984
- Associative Algebras1982
- An inequality for the discriminant of a polynomial.The Michigan Mathematical Journal, 1964
- Structure of Algebras. By A. A. Albert. Pp. xi, 210. $4. 1939. American Mathematical Society Colloquium Publications, 24. (American Mathematical Society)The Mathematical Gazette, 1940