On a problem of Peth\H{o}
Szabolcs Tengely, Maciej Ulas

TL;DR
This paper investigates a specific algebraic number problem related to quartic algebraic integers and their associated quadratic algebraic numbers, proving the infinitude of such cases and characterizing all solutions.
Contribution
It introduces new results on the existence and classification of quartic algebraic integers linked to quadratic algebraic numbers, expanding understanding of this algebraic problem.
Findings
Infinitely many quartic algebraic integers produce quadratic algebraic numbers.
Complete description of quartic numbers leading to quadratic algebraic numbers.
Analysis of rational solutions to related Diophantine systems.
Abstract
In this paper we deal with a problem of Peth\H{o} related to existence of quartic algebraic integer for which is a quadratic algebraic number. By studying rational solutions of certain Diophantine system we prove that there are infinitely many 's such that the corresponding is quadratic. Moreover, we present a description of all quartic numbers such that is quadratic real number.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Algebraic Geometry and Number Theory · Analytic Number Theory Research
\new@environment
NoHyper
On a problem of Pethő
Sz. Tengely
Institute of Mathematics
University of Debrecen
P.O.Box 12
4010 Debrecen
Hungary
and
M. Ulas
Jagiellonian University
Faculty of Mathematics and Computer Science
Institute of Mathematics
Łojasiewicza 6
30-348 Kraków
Poland
Abstract.
In this paper we deal with a problem of Pethő related to existence of quartic algebraic integer for which
[TABLE]
is a quadratic algebraic number. By studying rational solutions of certain Diophantine system we prove that there are infinitely many ’s such that the corresponding is quadratic. Moreover, we present a description of quartic numbers such that the corresponding is a quadratic real number.
Key words and phrases:
Diophantine equations
2010 Mathematics Subject Classification:
Primary 11D61; Secondary 11Y50
Research supported in part by the OTKA grants K115479 and NK104208.
1. introduction
Buchmann and Pethő [5] found an interesting unit in the number field with it is as follows
[TABLE]
That is the coordinates of a solution of the norm form equation form an arithmetic progression. In [1] Bérczes and Pethő considered norm form equations
[TABLE]
where is an algebraic number field of degree and is a given integer such that are consecutive terms in an arithmetic progression. They proved that (1) has only finitely many solutions if neither of the following two cases hold:
- •
has minimal polynomial of the form
[TABLE]
with
- •
is a real quadratic number.
In 2006 Bérczes, Pethő and Ziegler [3] studied norm form equations related to Thomas polynomials such that the solutions are coprime integers in arithmetic progression. Bérczes and Pethő [2] considered (1) with and is a root of They proved that the norm form equation has no solution in integers which are consecutive elements in an arithmetic progression. In 2010 Pethő [6] collected 15 problems in number theory, Problem 6 is based on the results given in [1].
Problem** (Problem 6 in [6]).**
Does there exist infinitely many quartic algebraic integers such that
[TABLE]
is a quadratic algebraic number?
The only example mentioned is such that the corresponding element is a real quadratic number (that is a root of ). Moreover, Bérczes, Pethő in [1] remarks that there are many solutions if we drop assumption of integrality of . However, it is not quite clear whether we can find infinitely many such examples and whether we can find precise description of such algebraic numbers. As we will see the problem is equivalent with the study of existence of rational zeros of family of four polynomials in six variables. With the help of Gröbner bases approach we reduce our problem to the study of rational zeros of only one (reducible) polynomial. A careful analysis of the corresponding variety allow us to get 2 infinite families of quartic polynomials defining quartic algebraic integers such that the algebraic number is quadratic. Unfortunately, in this case we get real quadratic number only in finitely many cases. However, with different look we are able to show that the set of quartic algebraic numbers such that the algebraic number is quadratic, is contained in a certain set given by (explicit) system of algebraic inequalities.
In particular the following is true:
Theorem 1.1**.**
There are infinitely many quartic algebraic integers defined by for which
[TABLE]
is a quadratic algebraic number. Moreover, there are infinitely many quartic algebraic numbers such that is real quadratic.
2. Auxiliary results
We provide two infinite families of quartic polynomials, now we prove that among these polynomials there are infinitely many irreducible ones.
Lemma 2.1**.**
Let The polynomials defined by
[TABLE]
are irreducible if
Proof.
If there is a linear factor of then there is an integral root. Hence we have that
[TABLE]
By comparing coefficients one gets that It remains to deal with the system of equations
[TABLE]
The resultant of the two polynomials with respect to is quadratic in The discriminant of this quadratic polynomial is
[TABLE]
If then we obtain that In this case is reducible. If then This equations has no rational solution since for all If there are two quadratic factors, then
[TABLE]
As in the previous case we compare coefficients to obtain a system of equations
[TABLE]
The resultant of the above equations with respect to is
[TABLE]
If then we have a quadratic polynomial in with discriminant It is non-negative if If then or Earlier we handled the case with if then we have If then the discriminant with respect to is
[TABLE]
It remains to determine the rational points on the genus 2 curve
[TABLE]
In order to do that let us note that there is a rational map , where
[TABLE]
and
[TABLE]
Using MAGMA we obtain that the rank of Mordell-Weil group is 0 with . These torsion points yield affine rational points on the curve of the following form
[TABLE]
Thus and it follows that a case considered above.
∎
Lemma 2.2**.**
Let The polynomials defined by
[TABLE]
are irreducible if
Proof.
The approach we apply here is similar to that used in the proof of the previous lemma, therefore here we only indicate the main steps. First we try to determine linear factors, that we write
[TABLE]
We have that and it remains to deal with the system of equations
[TABLE]
The resultant of the two polynomials with respect to is quadratic in The discriminant of this quadratic polynomial is
[TABLE]
This expression is negative for all rational hence there exists no rational solution in
If there are two quadratic factors, then
[TABLE]
As in the previous case we compare coefficients to obtain a system of equations
[TABLE]
The latter equation can be written as
[TABLE]
If then The discriminant of this equation with respect to is Hence If then If then Consider the case We get that Thus we obtain a polynomial equation only in and given by
[TABLE]
The discriminant with respect to factors as follows
[TABLE]
The latter expression is a square only if or so we do not get new reducible polynomials. ∎
3. proof of theorem 1.1
Proof.
Let with and with Assume that is a root of and is a root of From we get a degree 6 polynomial for which is a root. Therefore it is divisible by Computing the reminder we obtain a cubic polynomial which has to be zero. In SageMath [8] we may compute it as follows
var(’X,u,v’) P.<d,p,q,a,b,c>=PolynomialRing(QQ,6,order=’lex’) Px.<x>=PolynomialRing(P) w=4X^4/(X^4-1)-X/(X-1) W=(w^2+pw+q).numerator() Wrem=Px(W(X=x))%(x^4+ax^3+bx^2+c*x+d) Wcoeff=Wrem.coefficients()
We obtain the following coefficients
[TABLE]
The Gröbner basis for contains 19 polynomials, one of these factors as follows
[TABLE]
Let us consider the case Denote by the polynomials obtained by substituting into and Let us denote by the Gröbner basis for and compute the ideal , i.e., we eliminate the variables . We get that
[TABLE]
The equation defines the curve, say , defined over of genus 0 (in the plane ). The standard method allows us to find the parametrization of in the following form
[TABLE]
However, with given above and the corresponding we get
[TABLE]
a reducible polynomial.
Let us consider the second factor that is
[TABLE]
First we compute the polynomial for some small fixed values of . It turns out that is a reducible polynomial given by
[TABLE]
Let us study this special case when . Consider the equation . It follows that . The only integral solutions correspond with or . If , then and . We obtain the reducible polynomial . If , then and , the example from Pethő’s paper. The set of rational solutions of can be easily parametrized with
[TABLE]
With and given above we easily compute the values
[TABLE]
With given above one can easily check that the discriminant of is positive for all (and thus for all ).
Consider the other possibility, that is the equation We have
[TABLE]
Let and We get that and Thus
[TABLE]
where Let us denote by and the corresponding polynomials and after the substitution . Let be the Gröbner basis of the ideal with respect to the variables over polynomial ring . We get that
[TABLE]
and thus or .
If then and is reducible , a contradiction. If , then we have an infinite family of solutions of Pethő’s question given by
[TABLE]
It follows from Lemma 2.1 that there are infinitely many irreducible polynomial in this family. By computing the discriminant of the polynomial we observe that it has two real roots for satisfying .
We computed all integral solutions of the equation with If then we have all solutions provided by the above formulas and we also obtain and The corresponding polynomial is reducible, it is The remaining solutions are contained in Table 1.
[TABLE]
Table 1. Integral solutions of the equation with .
All these solutions can be described by the formulas
[TABLE]
It follows from Lemma 2.2 that there are infinitely many irreducible polynomial in this family. By computing the discriminant of the polynomial we observe that it has two real roots for satisfying .
∎
Remark 3.1**.**
We extended the search of the solutions of up to and found no additional solutions. **
Remark 3.2**.**
One can prove that the polynomial with
[TABLE]
has no rational roots for all . However, if , where , then
[TABLE]
Let be the set of prime numbers, , and recall that a rational number , is called -integral if the set of prime factors of is a subset of . The set of -integers is denoted by .
Although we were unable to prove that there are infinitely many quartic algebraic integers such that the number is real quadratic, from our result we can deduce the following:
Corollary 3.3**.**
Let . Then there are infinitely many such that for one of the roots of , say , the number is real quadratic.
Proof.
In order to get the result it is enough to use the parametrization (3) by taking satisfying the condition . Because there are infinitely many such ’s we get the result.
∎
Remark 3.4**.**
Let us note that the equation , where is given by (3), defines (an affine) quartic surface, say . The existence of the parametric solution presented above leads to the generic point (by taking ):
[TABLE]
lying on . This suggests to look on as on a quartic curve defined over the rational function field . We call this curve . A quick computation in MAGMA [4] reveals that the genus of is 0. This implies that is -rational curve. Moreover, the existence of -rational point on given by allows us to compute rational parametrization which is defined over as follows
[TABLE]
where and are given by
[TABLE]
and are as follows
[TABLE]
and are given by
[TABLE]
The above parametrizations yield formulas for and as well, we have
[TABLE]
where and are as follows
[TABLE]
[TABLE]
finally, the formulas for and
[TABLE]
[TABLE]
The reader interested in the details of mathematics behind the computation of parametrizations of rational curves can consult the excellent book of Rafael Sendra, Winkler and Pérez-Díaz [7]. Let us also note that for given above the discriminant of takes the form
[TABLE]
where is the rational function, is the polynomial of degree 2 (with respect to the variable ) with negative discriminant for and
[TABLE]
We thus see that the polynomial will have two real roots iff and . We observe that if then is always negative and we get no solutions. Indeed, if then need to be positive. However, and and thus for all . If and there are solutions but the analytic expressions are quite complicated. Instead, in Figure 1, we present a plot of the solutions of the system satisfying . In particular, if and we get solutions we are interested in. Unfortunately, we were no able to characterize all pairs such that the corresponding polynomial is irreducible. It seems that this is rather difficult question.
Finally, if then we get and the polynomial has complex roots.
We were trying to use the obtained parametrization to find other integer points on the surface but without success. If is not an algebraic integer, then using the above parametrizations we may obtain real quadratic algebraic numbers. Indeed, if is a root of the polynomial then write . As an example let us consider the case . The above formulas provide that is a root of the polynomial
[TABLE]
then is a root of the following polynomial having two real roots
[TABLE]
We can also notice ”near misses” solutions of Pethő’s problem, where among the numbers only one is genuine rational. All these solutions correspond to . More precisely, if is solution of
[TABLE]
then is root of the polynomial
[TABLE]
Similarly, if is a root of
[TABLE]
then is a root of
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Bérczes and A. Pethő. On norm form equations with solutions forming arithmetic progressions. Publ. Math. Debrecen , 65(3-4):281–290, 2004.
- 2[2] A. Bérczes and A. Pethő. Computational experiences on norm form equations with solutions forming arithmetic progressions. Glas. Mat. Ser. III , 41(61)(1):1–8, 2006.
- 3[3] A. Bérczes, A. Pethő, and V. Ziegler. Parameterized norm form equations with arithmetic progressions. J. Symbolic Comput. , 41(7):790–810, 2006.
- 4[4] W. Bosma, J. Cannon, and C. Playoust. The Magma algebra system. I. The user language. J. Symbolic Comput. , 24(3-4):235–265, 1997. Computational algebra and number theory (London, 1993).
- 5[5] J. Buchmann and A. Pethő. Computation of independent units in number fields by Dirichlet’s method. Math. Comp. , 52(185):149–159, S 1–S 14, 1989.
- 6[6] A. Pethő. Fifteen problems in number theory. Acta Univ. Sapientiae Math. , 2(1):72–83, 2010.
- 7[7] Winkler F. Pérez-Díaz S. Rafael Sendra, J. R. Rational Algebraic Curves, A Computer Algebra Approach . Algorihms and Computation in Mathematics, Volume 22. Springer-Verlag Berlin Heidelberg, 2008.
- 8[8] W. A. Stein et al. Sage Mathematics Software (Version 7.5) . The Sage Development Team, 2017. http://www.sagemath.org .
