Let p be an odd prime and n a positive integer and let k be a field of Ž . r p and let r denote the largest integer between 0 and n such that K l k s p Ž . r r r k , where denotes a primitive p th root of unity. The extension Krk is p p separable, but not necessarily normal and, by Greither and Pa
On the Computation of the Trace Form of Some Galois Extensions
✍ Scribed by Christof Drees; Martin Epkenhans; Martin Krüskemper
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 346 KB
- Volume
- 192
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
✦ Synopsis
We investigate the trace form tr :
In particular, we study 2-extensions of degree F 16. Using some reduction theorems, these results yield a classification of nearly all trace forms of Galois extensions of degree F 31. Finally, we study the trace form of a cyclotomic extension and of its maximal real subfield.
📜 SIMILAR VOLUMES
asked if every Abelian variety A defined over a number field k with dim A > 0 has infinite rank over the maximal Abelian extension k ab of k. We verify this for the Jacobians of cyclic covers of P 1 , with no hypothesis on the Weierstrass points or on the base field. We also derive an infinite rank
## Communicated by J. Tate Let \ be a two-dimensional semisimple odd representation of Gal(Q ÂQ) over a finite field of characteristic 5 which is unramified outside 5. Assuming the GRH, we show in accordance with a conjecture by Serre that \=/ a 5 Ä / b 5 , where a+b is odd.
Let k be a Galois extension of Q with [k : Q]=d 2. The purpose of this paper is to give an upper bound for the least prime which does not split completely in k in terms of the degree d and the discriminant 2 k . Our estimate improves on the bound given by Lagarias et al. [3]. We note, however, that
We provide a setting for analyzing the efficiency of algorithms that compute the integral closure of affine rings. It gives quadratic (cubic in the non-homogeneous case) multiplicity-based but dimension-independent bounds for the number of passes the basic construction will make. An approach that do