Calculating formula and divisibility for relative class numbers of abelian function fields

In this paper abelian function fields are restricted to the subfields of cyclotomic function fields. For any abelian function field K/k with conductor an irreducible polynomial over a finite field of odd characteristic, we give a calculating formula of the relative divisor class number of K. And using the given calculating formula we obtain a criterion for checking whether or not the relative divisor class number is divisible by the characteristic of k.     

Explicit bounds and heuristics on class numbers in hyperelliptic function fields

In this paper, we provide tight estimates for the divisor class number of hyperelliptic function fields. We extend the existing methods to any hyperelliptic function field and improve the previous bounds by a factor proportional to with the help of new results. We thus obtain a faster method of computing regulators and class numbers. Furthermore, we provide experimental data and heuristics on the distribution of the class number within the bounds on the class number. These heuristics are based on recent results by Katz and Sarnak. Our numerical results and the heuristics imply that our approximation is in general far better than the bounds suggest.

     

On class numbers of quadratic extensions¶over function fields

We consider class numbers of quadratic extensions over a fixed function field. We will show that there exist infinitely many quadratic extensions which have class numbers not being divisible by 3 and satisfy prescribed ramification conditions. Received: 24 October 1997 / Revised version: 26 February 1998     

On the class numbers of certain Hilbert class fields

LetL/k be a finite Galois extension with Galois groupG, and a group extension. We study the existence of the Galois extensionM/L/k such that the canonical projection Gal(M/k)→Gal(L/k) coincides with the given homomorphismj:E→G and thatM/L is unramified.     

On the class numbers of cyclotomic fields

Let g_n denote the first factor of the class number of the nth cyclotomic field. It is proved that if n runs through a sequence of prime powers p^r tending to infinity, then

$\text{log}\text{g}{}_{\mathrm{n}}\text{～}\text{1}\text{4}\text{[1 ? (}\text{1}\text{p}\text{)]n}\text{log}\text{n}$

.     

On the class numbers of cyclotomic fields

The finiteness of the number of cyclotomic fields whose relative class numbers have bounded odd parts will be verified and then all the cyclotomic fields with relative class numbers non-trivial 2-powers will be determined.This research was supported in part by Grant-in-Aid for Science (No. 01740051), Ministry of Education, Science, and Culture of Japan     

On class numbers of pure quartic fields

The Ramanujan Journal - Let p be a prime. The 2-primary part of the class group of the pure quartic field $${mathbb {Q}}(root 4 of {p})$$ has been determined by Parry and Lemmermeyer when $$p...     

Maximal class numbers of CM number fields

Fix a totally real number field F of degree at least 2. Under the assumptions of the generalized Riemann hypothesis and Artin's conjecture on the entirety of Artin L-functions, we derive an upper bound (in terms of the discriminant) on the class number of any CM number field with maximal real subfield F. This bound is a refinement of a bound established by Duke in 2001. Under the same hypotheses, we go on to prove that there exist infinitely many CM-extensions of F whose class numbers essentially meet this improved bound and whose Galois groups are as large as possible.     

Class numbers of cyclotomic function fields

Let be a prime power and let be the finite field with elements. For each polynomial in , one could use the Carlitz module to construct an abelian extension of , called a Carlitz cyclotomic extension. Carlitz cyclotomic extensions play a fundamental role in the study of abelian extensions of , similar to the role played by cyclotomic number fields for abelian extensions of . We are interested in the tower of Carlitz cyclotomic extensions corresponding to the powers of a fixed irreducible polynomial in . Two types of properties are obtained for the -parts of the class numbers of the fields in this tower, for a fixed prime number . One gives congruence relations between the -parts of these class numbers. The other gives lower bound for the -parts of these class numbers.

     

Dirichlet convolution of cotangent numbers and relative class number formulas

Letn be the conductor of an abelian number fieldK. The numbersicot (k/n), (k, n)=1, belong to, then-th cyclotomic field; theirK-traces form an additive group whose index in the imaginary part of the ringO _K involves the relative class numberh _K ^– ofK. This was shown previously. In the present paperh _K ^– is decomposed into branch factors, each of which is shown to be the index of an additive group of modified cotangent numbers. Put together in the right way, the said numbers yield formulas forh _K ^– simpler than the previous ones. The different types of cotangent numbers are mutually connected by Dirichlet convolution, whose meaning in the construction of cyclotomic numbers is studied. Finally, our results are rephrased in terms of Stickelberger ideals.     

Parametrization of the quadratic function fields whose divisor class numbers are divisible by three

A parametrization of quadratic function fields whose divisor class numbers are divisible by 3 is obtained by using free parameters when the characteristics of the fields are not 3.     

Divisibility of class numbers of imaginary quadratic function fields by a fixed odd number

In this paper we find a new lower bound on the number of imaginary quadratic extensions of the function field $\mathbb{F}_{q}(x)$ whose class groups have elements of a fixed odd order. More precisely, for q, a power of an odd prime, and g a fixed odd positive integer ≥?3, we show that for every ε?>?0, there are $\gg q^{L(\frac{1}{2}+\frac{3}{2(g+1)}-\epsilon)}$ polynomials $f \in \mathbb{F}_{q}[x]$ with $\deg f=L$ , for which the class group of the quadratic extension $\mathbb{F}_{q}(x, \sqrt{f})$ has an element of order g. This sharpens the previous lower bound $q^{L(\frac{1}{2}+\frac{1}{g})}$ of Ram Murty. Our result is a function field analogue which is similar to a result of Soundararajan for number fields.     

On the class numbers of arithmetically equivalent fields

Two algebraic number fields are arithmetically equivalent when their zeta functions coincide. This paper provides a method for comparing the ideal class groups of arithmetically equivalent fields K, K′. In particular, bounds are obtained for the variance of the class numbers h_K, h_K′.     

Congruence properties of class numbers of quadratic fields

The authors prove that the class number of the quadratic field Q(√?g) is divisible by 3 if g is a prime of the form 27n² + 4.     

Computation of class numbers of quadratic number fields

We explain how one can dispense with the numerical computation of approximations to the transcendental integral functions involved when computing class numbers of quadratic number fields. We therefore end up with a simpler and faster method for computing class numbers of quadratic number fields. We also explain how to end up with a simpler and faster method for computing relative class numbers of imaginary abelian number fields.

     

Computations of class numbers of real quadratic fields

In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field is presented, which computes the class number in expected time . The algorithm is a random version of Shanks' algorithm. One of the main steps in algorithms to compute the class number is the approximation of . Previous algorithms with the above running time , obtain an approximation for by assuming an appropriate extension of the Riemann Hypothesis. Our algorithm finds an appoximation for without assuming the Riemann Hypothesis, by using a new technique that we call the `Random Summation Technique'. As a result, we are able to compute the regulator deterministically in expected time . However, our estimate of on the running time of our algorithm to compute the class number is not effective.