Spelling suggestions: "subject:"bnormal closure"" "subject:"bnormal elosure""
1 |
On the Computation of Invariants in non-Normal, non-Pure Cubic Fields and in Their Normal ClosuresCline, Danny O. 03 December 2004 (has links)
Let K=Q(theta) be the algebraic number field formed by adjoining theta to the rationals where theta is a real root of an irreducible monic cubic polynomial f(x) in Z[x]. If theta is not the cube root of a rational integer, we call the field K a non-pure cubic field, and if K doesn't contain the conjugates of theta, we call K a non-normal cubic field. A method described by Martinet and Payan allows us to construct such fields from elements of a quadratic field. In this work, we examine such non-normal, non-pure cubic fields and their normal closures, using algorithms in Mathematica to compute various invariants of these fields. In addition, we prove general results relating the ranks of the ideal class groups of the rings of integers of these cubic fields to those of their normal closures. / Ph. D.
|
2 |
On the Units and the Structure of the 3-Sylow Subgroups of the Ideal Class Groups of Pure Bicubic Fields and their Normal ClosuresChalmeta, A. Pablo 20 November 2006 (has links)
If we adjoin the cube root of a cube free rational integer <i>m</i> to the rational numbers we construct a cubic field. If we adjoin the cube roots of distinct cube free rational integers <i>m</i> and <i>n</i> to the rational numbers we construct a bicubic field. The number theoretic invariants for the cubic fields and their normal closures are well known. Some work has been done on the units, classnumbers and other invariants of the bicubic fields and their normal closures by Parry but no method is available for calculating those invariants. This dissertation provides an algorithm for calculating the number theoretic invariants of the bicubic fields and their normal closure. Among these invariants are the discriminant, an integral basis, a set of fundamental units, the class number and the rank of the 3-class group. / Ph. D.
|
Page generated in 0.0426 seconds