Preprint
Article

This version is not peer-reviewed.

Calculating Generators of Power Integral Bases in Sextic Fields with a Quadratic Subfield: The General Case

Submitted:

05 November 2025

Posted:

06 November 2025

You are already at the latest version

Abstract
In some previous works we gave algorithms for determining generators of power integral basis in sextic fields with a quadratic subfield, under certain restrictions. The purpose of the present paper is to extend those methods to the general case, when the relative integral basis of the sextic field over the quadratic subfield is of general form. This raises several technical difficulties, that we consider here.
Keywords: 
;  ;  ;  ;  ;  

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 Z K is called monogenic (cf. [2]) if there exists ξ Z K such that ( 1 , ξ , , ξ n 1 ) is an integral basis, called power integral basis. We call ξ the generator of this power integral basis.
An irreducible polynomial f ( x ) Z [ x ] is called monogenic, if a root ξ of f ( x ) generates a power integral basis in K = Q ( ξ ) . If f ( x ) is monogenic, then K is also monogenic, but the converse is not true.
For α Z K (generating K over Q ) the module index
I ( α ) = ( Z K : Z [ α ] )
is called the index of α . The element α generates a power integral basis in K if and only if I ( α ) = 1 . Searching for elements of Z K , 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 < 10 100 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
( 1 , α , α 2 , ω , ω α , ω α 2 ) ,
where ( 1 , ω ) 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 f ( x ) = x 6 + a x 3 + b . 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 ( 1 , ω ) , and let f ( x ) = x 3 + C 2 x 2 + C 1 x + C 0 Z M [ x ] be the relative defining polynomial of α over M, with K = M ( α ) . 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
1 , A α + B k , C α 2 + D α + E l ,
where A , B , C , D , E Z M , 0 < k , l Z . 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 γ Z K in the form
γ = X 0 + X 1 A α + B k + X 2 C α 2 + D α + E l ,
with unknown X i = x i 1 + ω x i 2 Z M ( i = 0 , 1 , 2 ) . Our purpose is to construct a fast algorithm to determine all tuples ( x 02 , x 11 , x 12 , x 21 , x 22 ) Z 5 with
max ( | x 02 | , | x 11 | , | x 12 | , | x 21 | , | x 22 | ) < C ,
with say, C = 10 100 , such that γ generates a power integral basis in K (the index of γ is independent from x 01 ).
We have
γ = Y 0 + Y 1 α + Y 2 α 2 ,
where
Y 0 = X 0 + X 1 B k + X 2 E l , Y 1 = X 1 A k + X 2 D l , Y 2 = X 2 C l ,
are not necessarily integer elements in M.
Let μ ( i ) be the conjugates of any μ M , corresponding to ω ( i ) , ( i = 1 , 2 ) . We denote by α ( i , j ) the roots of f ( i ) ( x ) = x 3 + C 2 ( i ) x 2 + C 1 ( i ) x + C 0 ( i ) , ( i = 1 , 2 , j = 1 , 2 , 3 ) . The conjugates of any μ K corresponding to α ( i , j ) will also be denoted by μ ( i , j ) .
For i = 1 , 2 , 1 j 1 , j 2 3 , j 1 j 2 we have
γ ( i , j 1 ) γ ( i , j 2 ) α ( i , j 1 ) α ( i , j 2 ) = Y 1 + ( α ( i , j 1 ) + α ( i , j 2 ) ) Y 2 = Y 1 δ ( i , j 3 ) Y 2 ,
where δ ( i , j 3 ) = α ( i , j 1 ) + α ( i , j 2 ) = C 2 ( i ) α ( i , j 3 ) , C 2 Z M being the quadratic coefficient of the relative defining polynomial f ( x ) of α over M, and { j 3 } = { 1 , 2 , 3 } { j 1 , j 2 } .
By the representation (1) of the relative integral basis of K over M, for the relative discriminant D K / M we have
N M / Q ( D K / M ) = N M / Q ( d K / M ( α ) ) ( k l ) 2 = 1 ( k l ) 2 i = 1 2 1 j 1 < j 2 3 α ( i , j 1 ) α ( i , j 2 ) 2 .
Therefore we obtain
I K / M ( γ ) = 1 | N M / Q ( D K / M ) | i = 1 2 1 j 1 < j 2 3 γ ( i , j 1 ) γ ( i , j 2 )
= ( k l ) i = 1 2 j = 1 3 Y 1 ( i ) δ ( i , j ) Y 2 ( i ) = ( k l ) | N M / Q ( N K / M ( Y 1 δ Y 2 ) ) | .
As it is known (see [2], Chapter 1, Theorem 1.6), if I ( γ ) = 1 , then both
I K / M ( γ ) = 1 , and J ( γ ) = 1 ,
where
J ( γ ) = 1 ( | D M | ) 3 j 1 = 1 3 j 2 = 1 3 γ ( 1 , j 1 ) γ ( 2 , j 2 ) .

3. Elementary Estimates

By I K / M ( γ ) = 1 , (5) implies
N M / Q ( N K / M ( Z 1 δ Z 2 ) ) = ± ( k l ) 5 ,
where
Z 1 = ( k l ) Y 1 , Z 2 = ( k l ) Y 2 Z M .
Using an algebraic number theory package like Magma or Kash we can determine a complete set of non-associated elements μ Z M of norm ± ( k l ) 5 . Let ε be one of the finitely many units in M. We confer
N K / M ( Z 1 δ Z 2 ) = ε μ ,
with certain possible values of μ , ε . In complex quadratic fields the conjugated elements have equal absolute values, therefore (9) implies
j = 1 3 Z 1 ( 1 ) δ ( 1 , j ) Z 2 ( 1 ) = | k l | 5 / 2 .
Denote by j 0 the conjugate with
Z 1 ( 1 ) δ ( 1 , j 0 ) Z 2 ( 1 ) = min 1 j 3 Z 1 ( 1 ) δ ( 1 , j ) Z 2 ( 1 ) .
Then
Z 1 ( 1 ) δ ( 1 , j 0 ) Z 2 ( 1 ) c 1
with c 1 = | k l | 5 / 6 , and for j j 0 we have
Z 1 ( 1 ) δ ( 1 , j ) Z 2 ( 1 ) δ ( 1 , j ) δ ( 1 , j 0 ) | Z 2 ( 1 ) | c 1 c 2 | Z 2 ( 1 ) | ,
with c 2 = 0.9 · min j j 0 | δ ( 1 , j ) δ ( 1 , j 0 ) | , if | Z 2 ( 1 ) | > 10 c 1 / min j j 0 | δ ( 1 , j ) δ ( 1 , j 0 ) | . Small coordinates of Z 2 , not satisfying this inequality are tested separately.
We set Z 1 = z 11 + ω z 12 , Z 2 = z 21 + ω z 22 with z 11 , z 12 , z 21 , z 22 Z and let
A = max ( | z 11 | , | z 12 | , | z 21 | , | z 22 | ) .
Note that to find all suitable ( x 02 , x 11 , x 12 , x 21 , x 22 ) Z 5 satisfying (3), in view of (4), (8) we have to consider all ( z 11 , z 12 , z 21 , z 22 ) with
A 6 ( k l ) C ( 1 + | ω | ¯ ) max 1 , B k , E l , A k , D l , C l .
(11) implies
max ( | z 11 | , | z 12 | ) 2 | Z 1 ( 1 ) | 2 ( c 1 + | δ | ¯ | Z 2 ( 1 ) | ) 2 ( 0.1 + | δ | ¯ ) | Z 2 ( 1 ) | ,
if 0.1 | Z 2 ( 1 ) | > c 1 (small coordinates of Z 2 are tested separately). Here | δ | ¯ is the size δ (the maximum absolute values of its conjugates). Similary max ( | z 21 | , | z 22 | ) 2 | Z 2 ( 1 ) | , therefore
A 2 ( 0.1 + | δ | ¯ ) | Z 2 ( 1 ) | .
By (10) and (12) we obtain
Z 1 ( 1 ) δ ( 1 , j 0 ) Z 2 ( 1 ) ( k l ) 5 / 2 c 2 2 | Z 2 ( 1 ) | 2 c 4 A 2 ,
with
c 4 = ( k l ) 5 / 2 4 c 2 2 ( 0.1 + | δ | ¯ ) 2 ,
whence
z 11 + ω ( 1 ) z 12 δ ( 1 , j 0 ) z 21 δ ( 1 , j 0 ) ω ( 1 ) z 22 c 4 A 2 .

4. Reduction

The reduction procedure is based on inequality (14). The bound in (13) is reduced in several consecutive steps. We start with A 0 = A max , A max 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 A 0 and continue the reduction until the reduced bound is smaller than the original one.
Consider the lattice generated by the columns of the matrix
1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 H H ( ω ( 1 ) ) ( δ ( 1 , j 0 ) ) H ( δ ( 1 , j 0 ) ω ( 1 ) ) 0 H ( ω ( 1 ) ) H ( δ ( 1 , j 0 ) ) H ( δ ( 1 , j 0 ) ω ( 1 ) ) .
Denote by b 1 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 A A 0 and H is large enough to have
| b 1 | 40 · A 0 ,
then
A c 4 · H A 0 1 / 2 .
For a certain A 0 the suitable H is of magnitude A 0 2 . A typical sequence of reduced bounds staring from A 0 = 10 100 was the following:
A 10 100 1.5805 · 10 51 6.2833 · 10 26 1.2528 · 10 15 H 10 202 2.4979 · 10 104 3.9481 · 10 55 1.5695 · 10 32 new A 1.5805 · 10 51 6.2833 · 10 26 1.2528 · 10 15 5.5942 · 10 8
A 5.5942 · 10 8 3.7382 · 10 5 8663 1553 H 3.1295 · 10 19 1.3974 · 10 13 9.3381 · 10 9 2.4139 · 10 8 new A 3.7382 · 10 5 8663 1553 622
A 622 394 313 280 H 3.8810 · 10 7 1.5562 · 10 7 9.8543 · 10 6 7.8416 · 10 6 new A 394 313 280 264
If in a certain step H was not sufficiently large, we replaced it by 10 H .
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 j 0 , and the final reduced bound for A is the maximum of the reduced bounds obtained for j 0 = 1 , 2 , 3 .

5. Enumeration, Test

The reduced bound obtained in the previous section gives an upper bound among others for | z 11 | , | z 12 | , hence we can enumerate all possible Z 1 . Further, for all possible ε , μ , equation (9) gives a cubic equation for Z 2 Z M . Testing the roots of this cubic equation in Z 2 we can determine all Z 2 Z M corresponding to Z 1 .
From (8) and (4) we can determine Y 1 , Y 2 and then the coordinates x 11 , x 12 and x 21 , x 22 of X 1 , X 2 , corresponding to Z 1 , Z 2 . Finally, we use (6) to determine x 02 in the representation (2) of γ (the index of γ is independent of x 01 ). Substituting the possible tuples x 11 , x 12 , x 21 , x 22 into J ( γ ) we obtain a polynomial F ( x ) = a 9 x 9 + + a 1 x + a 0 in x 02 of degree 9, such that
| F ( x 02 ) | = 1 .
For the roots x 02 of absolute value >1 we have
| x 02 | | a 8 | + | a 1 | + | a 0 | + 1 | a 9 | .
We test the possible integer values of x 02 and obtain the solutions. Note that x 11 , x 12 and x 21 , x 22 are usually small values, therefore the bound for | x 02 | is also reasonably small.

6. Example

We developed and tested our method by taking the trinomial
f ( x ) = x 6 + 3 x 3 + 9
with Galois group C 3 × S 3 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 x 2 + 3 x + 9 = 0 . It’s root is β = ( 3 + 3 i 3 ) / 2 , therefore M = Q ( i 3 ) . We set ω = ( 1 + i 3 ) / 2 , then β = 3 ω 3 and α = β 3 . A relative integers basis of K = Q ( α ) over Q is given by
1 , α , α 2 ( 1 + ω ) 3 .
We have
γ = X 0 + X 1 α + X 2 α 2 ( 1 + ω ) 3 = Y 0 + Y 1 α + Y 2 α 2 ,
with
Y 0 = X 0 , Y 1 = X 1 , Y 2 = X 2 1 + ω 3 .
Moreover, δ = α , k = 1 , l = 3 ,
3 · N M / Q ( N K / M ( Y 1 δ Y 2 ) ) = ± 1 ,
and
N M / Q ( N K / M ( Z 1 δ Z 2 ) ) = ± 3 5
with Z 1 = 3 Y 1 , Z 2 = 3 Y 2 , whence
| Z 1 3 β Z 2 3 | = | N K / M ( Z 1 δ Z 2 ) ) | = 3 5 / 2 .
Taking C = 10 100 we have to reduce A from 24 C . The reduction procedure gives a bound 250 for the absolute values of the coordinates z 11 , z 12 , z 21 , z 22 . In our case Y 1 is also integer, hence z 11 , z 12 are divisible by 3, which considerably reduces the number of possible pairs z 11 , z 12 .
We used Magma to calculate the elements in Z M of norm ± 3 5 . It turned out that up to associates the only such element is 9 18 ω . We set ε = ± 1 , ± 1 ± i 3 2 and used
Z 1 3 β Z 2 3 = ε μ
to determine the possible values of Z 1 , corresponding to Z 2 . Finally, we calculate Y 1 , Y 2 , then X 1 , X 2 and substituted the coordinates of X 1 , X 2 into J ( γ ) = 1 to determine the appropriate values of x 02 . We obtained that up to sign the solutions are:
x 02 x 11 x 12 x 21 x 22 1 0 1 0 1 1 1 0 1 1 0 0 0 1 1 0 0 0 0 1 0 0 0 1 0 1 1 1 1 0
That is, up to sign and translation by x 01 all generators of power integral bases of K are given by
γ = ω x 02 + ( x 11 + ω x 12 ) α + ( x 21 + ω x 22 ) α 2 ( 1 + ω ) 3 ,
with the above listed tuples ( x 02 , x 11 , x 12 , x 21 , x 22 ) .
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

  1. W. Narkiewicz, Elementary and analytic theory of algebraic numbers, Third Edition, Springer, 2004.
  2. I. Gaál, Diophantine equations and power integral bases. Theory and algorithms, 2nd edition, Birkhäuser, Boston, 2019.
  3. I. Gaál, Monogenity and Power Integral Bases: Recent Developments, Axioms, 13(7) (2024), 429. 16pp. [CrossRef]
  4. 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.
  5. 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.
  6. 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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated