Polynomial Pell equations with D(x) = x6 + ax2 + b

In this paper, we give a full characterization of solvability in [Formula: see text] of the polynomial Pell equations [Formula: see text] where [Formula: see text] and [Formula: see text] are rational, and we provide explicit formulae for all solutions. In particular, we prove that these equations have a nontrivial solution [Formula: see text] if and only if [Formula: see text] or [Formula: see text] or [Formula: see text] or [Formula: see text] where [Formula: see text]. We also show that if [Formula: see text] and [Formula: see text] are integers then the title equations have a nontrivial solution in [Formula: see text] if and only if [Formula: see text] or [Formula: see text]. It is worth noting that, to our knowledge, such full characterizations have so far been known only for polynomials [Formula: see text] of degree no greater than four. If [Formula: see text] has no repeated roots then these equations are connected with the arithmetic of the hyperelliptic curves.

Authors

Publication Details

Journal
International Journal of Number Theory
Published
2026-04-21
DOI
https://doi.org/10.1142/s1793042126500909
Primary Topic
Algebraic Geometry and Number Theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Polynomial Pell equations with D(x) = x6 + ax2 + b

Tomasz Jędrzejak, Maciej Mionskowski
International Journal of Number Theory
Algebraic Geometry and Number Theory
article

Polynomial Pell equations with D(x) = x6 + ax2 + b

Tomasz Jędrzejak, Maciej Mionskowski
article en

Abstract

In this paper, we give a full characterization of solvability in [Formula: see text] of the polynomial Pell equations [Formula: see text] where [Formula: see text] and [Formula: see text] are rational, and we provide explicit formulae for all solutions. In particular, we prove that these equations have a nontrivial solution [Formula: see text] if and only if [Formula: see text] or [Formula: see text] or [Formula: see text] or [Formula: see text] where [Formula: see text]. We also show that if [Formula: see text] and [Formula: see text] are integers then the title equations have a nontrivial solution in [Formula: see text] if and only if [Formula: see text] or [Formula: see text]. It is worth noting that, to our knowledge, such full characterizations have so far been known only for polynomials [Formula: see text] of degree no greater than four. If [Formula: see text] has no repeated roots then these equations are connected with the arithmetic of the hyperelliptic curves.

International Journal of Number Theory
Openalex Percentile: Top 5%
Algebraic Geometry and Number Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.