1. Introduction
Monogenity and power integral bases is a classical topic in algebraic number theory, which is intensively studied even today. See [
1] for classical results and [
2,
3] for more recent results.
A number field
K of degree
n with ring of integers
is called
monogenic (cf. [
2]) if there exists
such that
is an integral basis, called
power integral basis. We call
the
generator of this power integral basis.
An irreducible polynomial is called monogenic if a root of generates a power integral basis in . If is monogenic, then K is also monogenic, but the converse is not true.
For
(generating
K over
) the module index
is called the
index of
. The element
generates a power integral basis in
K if and only if
. Searching for elements of
, generating power integral bases, leads to a Diophantine equation, called an
index form equation (cf. [
2]).
There are certain algorithms to determine “all solutions” of these equations, that is, all generators of power integral bases. This “complete resolution” very often requires excessive CPU time. On the other hand, there are some very fast methods for determining generators of power integral bases with “small” coefficients, for example, being <
in absolute value, with respect to an integral basis. All our experiences show that generators of power integral bases have very small coefficients in the integral basis; therefore, these “small” solutions cover all solutions with high probability, and certainly all generators that can be used in practice for further calculations. It is also usual to apply such algorithms if we need to solve a large number of equations (cf. [
2]).
In this paper we consider sextic number fields. Monogenity in various types of sextic fields has been considered by several authors; as examples, we refer to [
4,
5,
6,
7]. Járási [
8] gave an algorithm to determine generators of power integral bases in sextic fields with a cubic subfield.
In sextic fields with a quadratic subfield, we developed some efficient methods for calculating “small” solutions of the index form equation; see [
9]. For simplicity, in this and some related results, we assumed that the basis of the sextic field is of special type
where
is an integral basis of the quadratic subfield. This implicitly yields that the sextic field a priori has a relative power integral basis over the quadratic subfield. In the present paper we extend this special case to the general case, when the relative integral basis is of arbitrary form.
This paper was initiated by the recent work of Harrington and Jones [
10], where they consider sextic trinomials of the form
. Considering the sextic fields in [
10], generated by a root of such a trinomial, we find that in most cases the root of the polynomial does not generate a power integral basis over the quadratic subfield. In the present paper we intend to give a fast algorithm to calculate “small” solutions of the index form equation in such sextic fields. We shall see that some crucial ingredients of the method are similar to the formerly considered simpler cases; however, several complications occur that make it worthwhile to provide a description in the general case. In other words, we describe how the previous algorithms can be extended to the general case. Also, note that the present method can be easily transformed to a process to calculate “all” solutions.
2. Sextic Fields with a Quadratic Subfield
Let M be a quadratic number field with integral basis , and let be the relative defining polynomial of over M, with . For sextic fields with a quadratic subfield a crucial step, the reduction, only works for complex quadratic subfields; therefore, we assume that M is complex.
We are going to determine generators of power integral bases of K.
To present our formulas explicitly, we write the relative integral basis of
K over
M in the form
where
,
. Note that if
K is (absolutely) monogenic, then it is also relatively monogenic over
M, implying that
K has a relative integer basis over
M.
Using the relative integral basis (
1) we can represent any
in the form
with unknown
. Our purpose is to construct a fast algorithm to determine all tuples
with
with, for example,
, such that
generates a power integral basis in
K (the index of
is independent from
).
We have
where
are not necessarily integer elements in
M.
Let be the conjugates of any , corresponding to . We denote by the roots of . The conjugates of any corresponding to will also be denoted by .
For
we have
where
,
being the quadratic coefficient of the relative defining polynomial
of
over
M, and
.
By the representation (
1) of the relative integral basis of
K over
M, for the relative discriminant
we have
Therefore, we obtain
As it is known (see [
2], Chapter 1, Theorem 1.6), if
, then both
where
3. Elementary Estimates
By
, (
5) implies
where
Using an algebraic number theory package like Magma or Kash, we can determine a complete set of non-associated elements
of norm
. Let
be one of the finitely many units in
M. We confer
with certain possible values of
. In complex quadratic fields the conjugated elements have equal absolute values; therefore, (
9) implies
Denote by
the conjugate with
Then
with
, and for
we have
with
, if
. Small coordinates of
, not satisfying this inequality, are tested separately.
We set
with
and let
Note that to find all suitable
satisfying (
3), in view of (
4) and (
8), we have to consider all
with
(
11) implies
if
(small coordinates of
are tested separately). Here
is the size
(the maximum absolute values of its conjugates). Similarly,
; therefore,
By (
10) and (
12), we obtain
with
whence
4. Reduction
The reduction procedure is based on inequality (
14). The bound in (
13) is reduced in several consecutive steps. We start with
,
being the bound in (
13). We assign a suitable large constant
H and perform the following reduction step, which produces a new bound for
A. We set this new bound in place of
and continue the reduction until the reduced bound is smaller than the original one.
Consider the lattice generated by the columns of the matrix
Denote by
the first vector of the LLL reduced basis of this lattice. According to Lemma 5.3 of [
2] (which statement is based on (
14)), if
and
H is large enough to have
then
For a certain
the suitable
H is of magnitude
. A typical sequence of reduced bounds staring from
was the following:
| A | | | | |
| H | | | | |
| | | | |
| A | | | 8663 | 1553 |
| H | | | | |
| | 8663 | 1553 | 622 |
| A | 622 | 394 | 313 | 280 |
| H | | | | |
| 394 | 313 | 280 | 264 |
If, in a certain step, H was not sufficiently large, we replaced it with .
The reduction procedure was executed with 250 digits accuracy and took only a few seconds. It has to be performed for all possible values of , and the final reduced bound for A is the maximum of the reduced bounds obtained for .
5. Enumeration, Test
The reduced bound obtained in the previous section gives an upper bound among others for
, and hence we can enumerate all possible
. Further, for all possible
, Equation (
9) gives a cubic equation for
. Testing the roots of this cubic equation in
we can determine all
corresponding to
.
From (
8) and (
4) we can determine
and then the coordinates
and
of
, corresponding to
. Finally, we use (
6) to determine
in the representation (
2) of
(the index of
is independent of
). Substituting the possible tuples
into
, we obtain a polynomial
in
of degree 9, such that
For the roots
of absolute value >1 we have
We test the possible integer values of
and obtain the solutions. Note that
and
are usually small values, and therefore the bound for
is also reasonably small.
6. Example
We developed and tested our method by taking the trinomial
with Galois group
from the paper [
10] of Harrington and Jones. These trinomials have several interesting features, which may be the topic of a separate paper. This polynomial is not monogenic, but the number field
K generated by a root
of it is monogenic.
The quadratic subfield of
K is determined by the equation
. Its root is
, and therefore
. We set
, then
and
. A relative integers basis of
over
is given by
We have
with
Moreover,
,
and
with
, whence
Taking
we have to reduce
A from
. The reduction procedure gives a bound 250 for the absolute values of the coordinates
. In our case
is also integer, and hence
are divisible by 3, which considerably reduces the number of possible pairs
.
We used Magma to calculate the elements in
of norm
. It turned out that up to associates the only such element is
. We set
and used
to determine the possible values of
, corresponding to
. Finally, we calculated
, then
and substituted the coordinates of
into
to determine the appropriate values of
. We obtained that up to sign the solutions are as follows:
That is, up to sign and translation by
all generators of power integral bases of
K are given by
with the above-listed tuples
.
All calculations were performed in Maple and took just a few seconds.
7. Conclusions
There are several results on monogenity or non-monogenity of wide classes of number fields even for high degrees. However, to determine explicitly all generators of power integral bases in a specific number field turns out to be a much more complicated problem. We try to extend the methods of existing algorithms to some more general cases. In this paper, it is performed for sextic fields with a quadratic subfield, without the previous assumption of having a special type of relative integral basis.
We emphasize that, for our algorithm, it is crucial to choose the involved constants as accurately as possible. Also, an optimal choice of the H values in the reduction part produces a better reduced bound.
Note also that the same method can be applied for determining relative power integral bases in relative cubic and relative quartic extensions, in case the initial relative integral basis is not a power basis.