On the Computation of a Table of Complex Cubic Fields with Discriminant D > -106
نویسندگان
چکیده
A method for finding all the nonisomorphic complex cubic fields with discriminant D > -10 is described. Three different methods were used to find the class number of each of these fields. The speed of these techniques is discussed and several tables illustrating the computational results are presented. These include tables of the distribution of the fields and the class numbers and the class group structures of these fields.
منابع مشابه
Imprimitive Ninth-degree Number Fields with Small Discriminants
We present tables of ninth-degree nonprimitive (i.e., containing a cubic subfield) number fields. Each table corresponds to one signature, except for fields with signature (3,3), for which we give two dilferent tables depending on the signature of the cubic subfield. Details related to the computation of the tables are given, as well as information about the CPU time used, the number of polynom...
متن کاملComputing quadratic function fields with high 3-rank via cubic field tabulation
We present recent results on the computation of quadratic function fields with high 3-rank. Using a generalization of a method of Belabas on cubic field tabulation and a theorem of Hasse, we compute quadratic function fields with 3-rank ≥ 1, of imaginary or unusual discriminant D, for a fixed |D| = q. We present numerical data for quadratic function fields over F5, F7, F11 and F13 with deg(D) ≤...
متن کاملOn Totally Real Cubic Fields with Discriminant D < 107
The authors have constructed a table of the 592923 nonconjugate totally real cubic number fields of discriminant D < 107, thereby extending the existing table of fields with D < 5 x 105 constructed by Ennola and Turunen [4]. Each field is given by its discriminant and the coefficients of a generating polynomial. The method used is an improved version of the method developed in [8]. The article ...
متن کاملResearch Statement and Plan
My main research interest is number theory, in particular algebraic and computational number theory. Specifically, I am interested in computational aspects of number fields and function fields, in particular field tabulation and efficient computation of invariants associated with number fields and function fields. Many problems in this area have been explored extensively in the case of number f...
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010