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, [
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
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" requires very often too long CPU time. On the other hand there are some very fast methods for determining generators of power integral bases with "small" coefficients, say, 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, certainly all generators that can be used in practice for further calculations. It is usual to apply such algorithms also if we need to solve a large number of equation (cf. [
2]).
In sextic fields with a quadratic subfield we developed some efficient methods for calculating "small" solutions of the index form equation, see [
4,
5]. For simplicity, in these 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 apriori 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 [
6], where they consider sextic trinomials of the form
. Considering the sextic fields in [
6], 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 worthy 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 (absolute) monogenic, then it is also relative 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 say,
, 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
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), (
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). Similary
, 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, 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 bases 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:
If in a certain step H was not sufficiently large, we replaced it by .
The reduction procedure was executed with 250 digits accuracy and took only a few seconds. It has to be performed for each 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
, 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, 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 [
6] 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
. It’s root is
, 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, 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 calculate
, then
and substituted the coordinates of
into
to determine the appropriate values of
. We obtained that up to sign the solutions are:
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 done for sextic fields with a quadratic subfield, without the previous assumption of having a special type of relative integral basis.
Conflicts of Interest
The author has no competing interests to declare that are relevant to the content of this article.
References
- W. Narkiewicz, Elementary and analytic theory of algebraic numbers, Third Edition, Springer, 2004.
- I. Gaál, Diophantine equations and power integral bases. Theory and algorithms, 2nd edition, Birkhäuser, Boston, 2019.
- I. Gaál, Monogenity and Power Integral Bases: Recent Developments, Axioms, 13(7) (2024), 429. 16pp. [CrossRef]
- I. Gaál, L. Remete and T. Szabó, Calculating power integral bases by solving relative Thue equations, Tatra Mt. Math. Publ., 59(2014), 79-92.
- I. Gaál, Calculating generators of power integral bases: sextic fields with a quadratic subfield, revisited, JP Journal of Algebra, Number Theory and Applications, 64(2025), No 3, 289-306.
- J. Harrington and L. Jones, Monogenic sextic trinomials x6+ax3+b and their Galois groups, arXiv:2507.17021v1.
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).