WorksMathematics
Irreducibility of the Cuboid Polynomial via the Rank-One Chabauty-Coleman Method
Abstract
Let be Sharipov's even monic degree- second cuboid polynomial, with coprime positive integers . We prove that is irreducible over , and hence over . More generally, the normalized associated quintic and its composition are irreducible over for every . The proof reduces linear and quadratic factors to rational points and horizontal conjugate pairs on one fixed genus- curve. A certified rank upper bound for its Jacobian, together with an exact divisor calculation, gives a rank-one annihilating differential at the prime . For the quadratic-factor case, the symmetric coordinates of a horizontal pair lie on an explicit double cover of an elliptic quartic. All rational affine points on this model are -adically integral and reduce to six smooth residue classes. The pulled-back differential is a unit in each class, proving that six displayed points form the complete list. Their coordinates exclude every admissible parameter. A negative real root of the irreducible quintic then supplies the additional degree argument required for irreducibility of the degree- polynomial. The rank computation and all exact arithmetic certificates are specified explicitly for reproduction.
Introduction
The perfect cuboid problem asks for a rectangular box with positive integer edges whose three face diagonals and space diagonal are integers. In Sharipov’s polynomial formulation [1, 2], one encounters explicit even polynomials depending on integer parameters. The second cuboid polynomial has degree 10 and is conjectured to be irreducible for coprime positive integers .
Goal. We prove this irreducibility statement. The intermediate result is stronger than required by the original parametrization: the associated normalized quintic is irreducible for every , without assuming that is a rational square.
Method. A reducible quintic has an irreducible factor of degree at most two. An explicit transformation sends a root of to a fixed genus-2 curve , with second coordinate . A rational root gives a rational point of . An irreducible quadratic factor gives a conjugate pair on whose two points have the same second coordinate. Thus both cases are controlled by the same Jacobian.
We use the rank-one form of the Chabauty–Coleman method [3, 4]. The treatment of conjugate pairs is related to symmetric-power methods [5], but only a one-dimensional locus of horizontal pairs is needed here. We construct its model directly and prove the required local uniqueness rather than invoke a rational-point theorem for the entire symmetric square. A rank bound for the genus-2 Jacobian is obtained computationally, in the setting of explicit descent [6], using Magma [7]. All subsequent steps use a small exact divisor calculation, power series over , and enumeration over . In particular, the proof does not assume completeness of a bounded search for rational points.
The article is organized as follows. Section 2 states the normalization and the main theorem. Sections 3–4 establish the rank-one differential. Section 5 excludes linear factors. Sections 6–7 determine the horizontal-pair obstruction and exclude quadratic factors. Section 8 completes the degree-10 argument. The appendix records the computational inputs and reproducible verification code.
The second cuboid polynomial and normalization
Let be coprime and . Sharipov’s second cuboid polynomial is
It is weighted-homogeneous of weight 20 for and .
Definition 1 (Normalized second cuboid quintic). For , define
Lemma 1 (Normalization). With , one has
Proof. Set and substitute , into (1). Factoring out and setting gives .
Theorem 1. For every , the quintic is irreducible over . Consequently, for coprime positive integers , the polynomial is irreducible over and over .
The last implication requires a separate argument: irreducibility of alone does not automatically give irreducibility of . That argument will be supplied in Section 8.
A fixed genus-two curve and a rank bound
Put
Let denote the smooth projective curve associated with
and write . The discriminant of is
Hence has genus 2 and good reduction at 3. It has a unique rational point at infinity. We also use the rational Weierstrass point . A basis of holomorphic differentials is
Both are integral differentials at the prime 3.
Lemma 2 (Computational rank bound). The Mordell–Weil rank of is at most one.
Computer-assisted proof. Consider the genus-2 model
The substitution
satisfies
Its inverse is , on the corresponding affine open sets. Thus it extends to an isomorphism of smooth projective curves over , and hence of their Jacobians. Let . A certified computation in Magma gives
The class-group calculations use full Minkowski bounds, so this upper bound is unconditional and does not rely on the generalized Riemann hypothesis. The complete computation and its output are recorded in Appendix § 9. Since (10) induces an isomorphism over , their Mordell–Weil ranks are equal, proving the assertion.
Remark 1. Lemma 2 is the computational input to the proof. We do not need a complete Mordell–Weil basis or a saturation calculation. An explicit divisor below will have nonzero 3-adic logarithm, proving that the rank is exactly one and determining its annihilating differential to the required precision.
An exact rank-one differential at the prime three
For a holomorphic differential , let denote its Abelian logarithm on ; see [8] for the integration framework. On a residue disk this logarithm is obtained by integrating the corresponding local power series. The logarithm kills torsion and is additive on divisor classes. Its compatibility with pullback will also be used for the horizontal-pair model.
Lemma 3 (A local uniqueness criterion). Let a residue disk have a parameter , centered at . Suppose a differential on it is , where and . Then the primitive vanishing at has no other zero in this disk.
Proof. Write . For , its primitive divided by is
For each , one has . Thus this expression is a unit, proving the claim.
We represent divisor classes by Mumford coordinates : here is monic, , and . The corresponding class is the effective divisor supported on , , minus . Such coordinates allow exact addition by Cantor’s algorithm [9].
Lemma 4 (Annihilating differential). There exists a differential annihilating of the form
Proof. Let
Exact divisor addition gives the following small certificate:
Appendix § 9 specifies checks for both the divisor-class equality and the divisibility . The latter condition alone would not certify that the class is .
Let , , be the two geometric points represented by (12). Since , their trace and norm are obtained directly from :
Write and . Then
The nonleading coefficients of have valuations and . Its Newton polygon therefore gives . From it follows that . Both geometric points lie in the disk of over a finite extension of .
Near , the coordinate is a uniformizer and the equation has inverse series
The integrality follows by formal inversion, because . Since , the class is -torsion and . Consequently, with , the logarithms of are sums of integrals from :
These formulas result by differentiating (15), substituting in (8), and integrating term by term. Both local integrals are computed in a finite extension containing the two support points, with . Since the unintegrated coefficients are integral and , a term of degree in either primitive has valuation at least , which tends to infinity. Thus the individual series converge in and may be added term by term to obtain the expressions in .
We make the precision bounds explicit. The power sums satisfy , , and
For , each monomial in the expression for in terms of contains at least factors, so
Moreover,
All unintegrated power-series coefficients are integral; integration introduces only the denominator in the term involving . In (16), the term therefore has valuation at least , and every subsequent term also has valuation at least . In (17), all terms after have valuation at least , since
The valuations tend to infinity, so these estimates also justify passage to the infinite sums. It follows that
In particular, , so has infinite order. By Lemma 2, the group has rank exactly one. Its logarithmic image spans the same -line as .
Set . This gives an annihilating differential for every rational divisor class. The congruences above imply and
Thus , as required. The argument only uses a nonzero vector in the rank-one logarithmic image; no assertion that generates the full Mordell–Weil group is needed.
Rational points and exclusion of linear factors
Proposition 1 (Rational points on ). The full rational-point set is
Proof. Enumeration over gives
Every rational point reduces to one of these six points by properness of the smooth model. At each of the four finite points with nonzero first coordinate, the reduction of is the nonzero differential . It is also nonzero at infinity. Indeed, the local parameter at infinity shows that has unit leading coefficient, whereas vanishes there. Each of these five disks contains exactly one of the displayed rational points. The Abelian integral of between rational points vanishes, so Lemma 3 gives uniqueness in each disk.
It remains to examine the disk of , where the reduced differential vanishes. Use as parameter and put
From (15) one obtains, for ,
For the remainder bound, the terms remaining after division by have degree , , and their coefficients belong to . For use to obtain the stated valuation bound.
If , write with . Using gives
If , the term on the right of (23) has valuation one, whereas every other term has larger valuation. Hence whenever . Since the integral must vanish at any rational point in this disk, is its only rational point. This completes the list.
We now connect this fixed curve to the parameter-dependent quintic. For , define the reciprocal polynomial
Its leading coefficient is one. Put
A direct polynomial identity is
Both sides become polynomials in after clearing the displayed substitution; Appendix A includes its exact verification.
The transformation can also be motivated by inversion invariants. With , set and . The quotient parameter
gives , in agreement with (10). For the proof itself, the identity (26) is sufficient.
Lemma 5 (Roots give points of ). For , every root of gives a point on , defined over . Its first coordinate is finite and nonzero.
Proof. The relevant exceptional values are
They are nonzero under the stated assumptions. Thus is defined and nonzero at every root. The identity (26) now gives .
Corollary 1 (No linear factor). For , the polynomial has no rational root.
Proof. A rational root would give a rational point of whose second coordinate is . But and , whereas Proposition 1 permits only second coordinates at finite rational points.
Quadratic factors and horizontal conjugate pairs
We first check that distinct roots of cannot coalesce under the map . This matters because dividing a difference of curve equations by the difference of their first coordinates will be essential.
Lemma 6 (No collision of root images). For , two distinct roots of have distinct images under .
Proof. Coefficient comparison in (2) and (24) gives
Thus cannot have both and as roots. Indeed, such an would be a common root of , forcing or , and neither is a root. On the other hand,
All denominators are nonzero by (27). Equality of the images would therefore force , contrary to the preceding observation.
Suppose has a quadratic divisor over . By Corollary 1 this divisor is irreducible, so its roots are distinct quadratic conjugates. By Lemmas 5 and 6, their images
are distinct conjugate points. Their common second coordinate makes this a horizontal conjugate pair. Write
All four quantities are rational. Since , division by gives
After completing the square in , this becomes the quartic
The smooth projective completion of this nonsingular quartic, with the rational point chosen as origin, is an elliptic curve.
To recover the common value of , reduce it modulo . Using (31), the remainder is constant and equals
where in the second line. Since , the horizontal pair gives a rational point of the affine model
with . Thus the quadratic-factor problem has become a rational-point problem on a fixed curve.
Lemma 7 (Divisor map and pulled-back differentials). For a point of , put
The two roots of define an effective degree-two divisor
on , with multiplicities when the roots coincide. The class is rational at rational points of . On the locus , the pullbacks of (8) are
Proof. The reduction calculation above gives . By (34), it follows that , so the indicated horizontal divisor lies on . Its definition is Galois invariant when are rational. The map to the Jacobian is given by its degree-zero divisor class.
For distinct roots of , the pullback of a differential to this class is the sum of its values on the two points. Since and ,
Now , which gives (35). The formulas are symmetric in the roots and extend across coincident roots wherever .
The differential
is the pullback of the annihilator in Lemma 4. For rational points of in a common smooth residue disk on which these expressions are integral, its local integral satisfies
In the disks used below, and are units and all denominators are units at 3. The divisor construction and the displayed differentials are therefore defined integrally on each disk.
Six residue disks determine the obstruction points
Proposition 2 (Complete affine rational-point list). The rational affine points of (34) are exactly
Proof. First, every rational affine point is integral at 3. If , divide (32) by :
The right side is a unit with reduction 2 in , which cannot be the reduction of a square in . Hence . The two equations of then give . Consequently every rational affine point has a reduction in this affine model.
Enumerating the equations over yields precisely
At all six points both and are nonzero. The derivatives of the two equations with respect to form an invertible triangular matrix, with diagonal entries and . Thus all six points are smooth, and is a local parameter in the disk of any chosen lift . Each disk contains one of the six rational points in (38); direct substitution gives at those points.
By Lemma 4, , so reduces to . Differentiating (32) gives
Therefore
The numerator reduces to 1 at either point with , and to 2 at . Since is a unit, the coefficient of is a unit in every disk in (39).
Fix the known rational point in one of these disks. Any other rational point in the disk satisfies (37). Lemma 3, applied with parameter , forces . Every rational affine point belongs to one of the six disks, so the displayed list is complete.
Corollary 2 (No quadratic factor). For , the polynomial has no quadratic divisor over .
Proof. The construction of § 6 sends any such divisor to a rational affine point of with . For positive this satisfies . Proposition 2 gives at every rational affine point of , a contradiction.
Remark 2. The integrality argument is essential: it ensures that the six affine residue disks cover every rational point required in the factorization argument. No bound on the numerator or denominator of is used. The uniqueness in each disk then proves completeness, rather than merely confirming a list found by search.
Completion of the irreducibility proof
Proof of Theorem 1. A reducible polynomial of degree five over a field has an irreducible factor of degree at most two. Indeed, if every irreducible factor had degree at least three, two nonconstant factors would already have total degree at least six. Corollaries 1 and 2 therefore prove irreducibility of over .
We next establish irreducibility after composition with a square. By (27),
Thus has a real root . Its irreducibility gives . View as the subfield of defined by this negative real root. A square in this real field is nonnegative, so is not a square in . The polynomial is consequently irreducible over .
If , then and
Since is a root of the monic degree-10 polynomial , that polynomial is irreducible over . For , the invertible rational change of variable and the nonzero scalar factor in (3) preserve irreducibility. Hence is irreducible over . Finally, it is monic with integer coefficients, so Gauss’s lemma gives irreducibility over .
Corollary 3 (Classification of rational parameters). For , both and are irreducible over if and only if .
Proof. For , the proofs of Lemmas 5 and 6 apply unchanged: all exceptional values and denominators used there remain nonzero. Moreover, . Propositions 1 and 2 therefore exclude linear and quadratic factors of , proving its irreducibility.
For , irreducibility of follows from the degree argument above. For , we have and as , so a negative real root exists and the same argument applies. Finally,
which proves reducibility in all exceptional cases, also after substituting .
Magma scripts and transcripts
The only rank computation used in the proof is the upper bound in Lemma 2. Except for the auxiliary genus-two rational-point verification, the remaining computational checks use exact rational polynomial arithmetic or finite enumeration over . The code below is arranged to keep these two roles separate. Its rank target is 1; the remaining assertions check the isomorphism of curve models, the root-map and reciprocal identities, the divisor certificate, its trace and norm, and the residue-class calculations. The analytic uniqueness arguments are proved in the main text and do not depend on a rational-point search.
Script: Complete exact verification
The script was executed with Magma V2.29-10. The two class-group bound maps are both set to the Minkowski bound, so the rank calculation is unconditional. The additional Chabauty call independently reproduces the genus-two rational-point list; the proofs in the main text require only the rank upper bound and the exact local certificate. The identities and finite-field checks are assertions, so an unsuccessful check must be resolved before treating the run as a certificate.
In the final part of the script, the variables e,f,w denote the symmetric coordinates . They are related to the coordinates of the main text by
the auxiliary variable V in that part equals . This change of coordinates is invertible over . Consequently, the printed rational lifts and residue classes give exactly the lists in (38) and (39), respectively, in symmetric coordinates. The nonvanishing checks use these same coordinates and verify the unit condition for the pulled-back differential.
Code.
Q := Rationals();
Rt<t> := PolynomialRing(Q);
F0 := t^5+21*t^4+26*t^3+10*t^2+5*t+1;
C0 := HyperellipticCurve(F0);
J0 := Jacobian(C0);
proof_bound := map<PowerStructure(RngOrd) -> Integers() |
O :-> MinkowskiBound(O)>;
SetClassGroupBoundMaps(proof_bound, proof_bound);
upper := RankBound(J0);
print "Unconditional rank upper bound:", upper;
assert upper eq 1;
// Independent exact verification of the genus-two rational-point list.
B0 := J0![C0![0,1,1], C0![1,0,0]];
assert Order(B0) eq 0;
points0 := Chabauty(B0);
expected0 := {C0![1,0,0], C0![-1,0,1], C0![0,1,1],
C0![0,-1,1], C0![1,8,1], C0![1,-8,1]};
assert #points0 eq 6;
assert &and[p in points0 : p in expected0];
print "Complete genus-two rational-point list:", points0;
Rz<z> := PolynomialRing(Q);
F := -16*z^5+48*z^4-48*z^3+16*z^2+z;
assert Discriminant(F) eq -2^16*43;
Kz := FieldOfFractions(Rz);
assert Kz!F eq Evaluate(F0, 1/(Kz!z)-1)*(Kz!z)^6;
C := HyperellipticCurve(F);
J := Jacobian(C);
// Exact 11A certificate; A denotes [(1/2,1)-infinity].
A := J![C![1/2,1,1], C![1,0,0]];
M := 11*A;
u := z^2-(69/196)*z-9/392;
v := -(4085/2058)*z-233/1372;
assert M[1] eq u and M[2] eq v and M[3] eq 2;
assert (F-v^2) mod u eq 0;
trace_y := -Coefficient(u,1)*Coefficient(v,1)+2*Coefficient(v,0);
norm_y := Coefficient(v,0)^2
-Coefficient(u,1)*Coefficient(v,0)*Coefficient(v,1)
+Coefficient(u,0)*Coefficient(v,1)^2;
assert trace_y eq -139623/134456;
assert norm_y eq 7671/134456;
assert Valuation(trace_y,3) eq 1 and Valuation(norm_y,3) eq 1;
trace_y3 := trace_y^3-3*norm_y*trace_y;
assert Valuation(trace_y3,3) eq 3;
function Residue(q,n)
R := Integers(n);
return (R!Numerator(q))/(R!Denominator(q));
end function;
assert [Residue(Coefficient(u,i),81) : i in [2,1,0]] eq [1,48,63];
assert [Residue(3*Coefficient(v,i),81) : i in [1,0]] eq [14,75];
assert Residue(trace_y/3,3) eq 2;
assert Residue(norm_y/3,3) eq 2;
assert Residue(trace_y3/27,3) eq 1;
print "Exact 11A Mumford certificate:", M;
print "Trace and norm:", trace_y, norm_y;
print "Scaled residues S/3, N/3, Tr(y^3)/27 modulo 3:",
Residue(trace_y/3,3), Residue(norm_y/3,3), Residue(trace_y3/27,3);
// First terms of the integral formal inverse and local primitives.
RY<Y> := PolynomialRing(Q);
inverse_z := Y^2-16*Y^4+560*Y^6;
assert (Evaluate(F,inverse_z)-Y^2) mod Y^8 eq 0;
omega0 := RY!(Derivative(inverse_z)/(2*Y));
omega1 := (inverse_z*omega0) mod Y^6;
assert Derivative(Y-(32/3)*Y^3+336*Y^5) eq omega0;
assert Derivative((1/3)*Y^3-(48/5)*Y^5) eq omega1;
assert -Residue(trace_y3/27,3)/Residue(trace_y/3,3) eq 1;
// Symbolic polynomial/root-map identities over Q(s).
Ks<s> := FunctionField(Q);
Rx<x> := PolynomialRing(Ks);
P := x^5+(2+s)*(3-2*s)*x^4
+(1+10*s+4*s^2-14*s^3+s^4)*x^3
-s*(1-14*s+4*s^2+10*s^3+s^4)*x^2
-s^3*(1+2*s)*(-2+3*s)*x-s^5;
Kx := FieldOfFractions(Rx);
X := Kx!x;
den := (X+1)*(X+s^2);
Z := X*(s-1)^2/den;
W0 := (s-1)/(s+1);
Pstar := Rx!(-X^5*Evaluate(P,s^2/X)/s^5);
assert (Evaluate(F,Z)-W0^2)*den^5*(s+1)^2
eq -(s-1)^2*(Kx!P)*(Kx!Pstar);
assert Evaluate(P,-1) eq 4*(s-1)^4*(s+1);
assert Evaluate(P,-s^2) eq -4*s^5*(s-1)^4*(s+1);
assert Evaluate(P,0) eq -s^5;
assert P-Pstar eq 8*(1-s^2)*x*(x+s)^3;
assert Evaluate(P,-s) eq -2*s^3*(s-1)^4;
// Distinct roots have the same Z-image only if their product is s^2.
// The reciprocal identities above exclude that case.
Rpair<xx,yy> := PolynomialRing(Ks,2);
assert xx*(yy+1)*(yy+s^2)-yy*(xx+1)*(xx+s^2)
eq (xx-yy)*(s^2-xx*yy);
// The equal-y divisor curve and its elliptic quotient.
B<e,f,w> := PolynomialRing(Q,3);
H := 16*f^2-48*(e-1)^2*f+16*e*(e-1)^3-1;
G := w^2-16*f*((e-1)^3-(2*e-3)*f);
KB := FieldOfFractions(B);
Rzz<zz> := PolynomialRing(KB);
remainder := Evaluate(F,zz) mod (zz^2-e*zz+f);
assert Coefficient(remainder,1) eq -KB!H;
assert Coefficient(remainder,0)-(KB!w)^2 eq -KB!G;
V := 2*f-3*(e-1)^2;
assert V^2-((e-1)^3*(5*e-9)+1/4) eq H/4;
// Exact known rational lifts, and all six affine F_3 residue classes.
lifts := [<Q!3/2,Q!1/2,Q!1>, <Q!3/2,Q!1/2,Q!-1>,
<Q!1,Q!1/4,Q!1>, <Q!1,Q!1/4,Q!-1>,
<Q!1,Q!-1/4,Q!1>, <Q!1,Q!-1/4,Q!-1>];
for p in lifts do
assert Evaluate(H,[p[1],p[2],p[3]]) eq 0;
assert Evaluate(G,[p[1],p[2],p[3]]) eq 0;
end for;
assert F-1 eq -(z-1)*(2*z-1)^2*(4*z^2-4*z-1);
F3 := GF(3);
B3<e3,f3,w3> := PolynomialRing(F3,3);
H3 := 16*f3^2-48*(e3-1)^2*f3+16*e3*(e3-1)^3-1;
G3 := w3^2-16*f3*((e3-1)^3-(2*e3-3)*f3);
points3 := {<ee,ff,ww> : ee,ff,ww in F3 |
Evaluate(H3,[ee,ff,ww]) eq 0 and Evaluate(G3,[ee,ff,ww]) eq 0};
expected3 := {<F3!0,F3!2,F3!1>, <F3!0,F3!2,F3!2>,
<F3!1,F3!1,F3!1>, <F3!1,F3!1,F3!2>,
<F3!1,F3!2,F3!1>, <F3!1,F3!2,F3!2>};
assert points3 eq expected3;
assert {<F3!p[1],F3!p[2],F3!p[3]> : p in lifts} eq points3;
He := Derivative(H3,1);
Hf := Derivative(H3,2);
for p in points3 do
he := Evaluate(He,[p[1],p[2],p[3]]);
hf := Evaluate(Hf,[p[1],p[2],p[3]]);
assert hf ne 0 and p[3] ne 0;
assert p[1]+he/hf ne 0;
end for;
print "Six residue classes on the equal-y divisor curve:", points3;
print "Six rational lifts:", lifts;
print "Nonvanishing differential checks: passed in all six disks.";
print "ALL STANDALONE CERTIFICATE ASSERTIONS PASSED.";
Transcript
Unconditional rank upper bound: 1
Complete genus-two rational-point list: { (1 : -8 : 1), (0 : -1 : 1), (1 : 8 :
1), (-1 : 0 : 1), (0 : 1 : 1), (1 : 0 : 0) }
Exact 11A Mumford certificate: (x^2 - 69/196*x - 9/392, -4085/2058*x - 233/1372,
2)
Trace and norm: -139623/134456 7671/134456
Scaled residues S/3, N/3, Tr(y^3)/27 modulo 3: 2 2 1
Six residue classes on the equal-y divisor curve: { <0, 2, 1>, <1, 2, 2>, <0, 2,
2>, <1, 1, 1>, <1, 2, 1>, <1, 1, 2> }
Six rational lifts: [ <3/2, 1/2, 1>, <3/2, 1/2, -1>, <1, 1/4, 1>, <1, 1/4, -1>,
<1, -1/4, 1>, <1, -1/4, -1> ]
Nonvanishing differential checks: passed in all six disks.
ALL STANDALONE CERTIFICATE ASSERTIONS PASSED.
The auxiliary primitive calculations in the script use the same normalization and as the main text. The power-series assertions check their first coefficients; the all-orders precision estimates are proved in Lemma 4 and Proposition 1.
AI Assistance
OpenAI GPT-6.1 Sol assisted with the development of the argument, symbolic calculations, verification code, and the preparation of the exposition. The author is responsible for the mathematical content and the final presentation.
References
- [1]R. A. Sharipov, Perfect cuboids and irreducible polynomials, Ufa Math. J. 4 (2012), no. 1, 153–160.arxiv.org/abs/1108.5348
- [2]R. A. Sharipov, A note on the second cuboid conjecture. Part I, arXiv:1201.1229 [math.NT] (2012).arxiv.org/abs/1201.1229
- [3]C. Chabauty, Sur les points rationnels des courbes algébriques de genre supérieur à l’unité, C. R. Acad. Sci. Paris 212 (1941), 882–885.
- [4]R. F. Coleman, Effective Chabauty, Duke Math. J. 52 (1985), no. 3, 765–770.DOI
- [5]S. Siksek, Chabauty for symmetric powers of curves, Algebra Number Theory 3 (2009), no. 2, 209–236.DOI
- [6]M. Stoll, Implementing 2-descent for Jacobians of hyperelliptic curves, Acta Arith. 98 (2001), no. 3, 245–277.DOI
- [7]W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997), nos. 3–4, 235–265.DOI
- [8]R. F. Coleman, Torsion points on curves and p-adic Abelian integrals, Ann. of Math. (2) 121 (1985), no. 1, 111–168.DOI
- [9]D. G. Cantor, Computing in the Jacobian of a hyperelliptic curve, Math. Comp. 48 (1987), no. 177, 95–101.