Dedication

Dedicated to Professor Hari M Srivastava

1 Introduction

In the paper [1], Fairlie and Veselov obtained a relation of the Bernoulli polynomials with the theory of the Korteweg-de Vries (KdV) equation

u t 6u u x + u x x x =0.

This equation has infinitely many conservation laws (that is, certain laws, which show that a particular measurable property of an isolated physical system, like mass, energy, momentum, etc., does not change as the system evolves) of the form

I m [u]= P m (u, u x , u x x ,, u m )dx,

where P m are some polynomials of the function u and its x-derivatives up to order m, see [2]. For example,

I 1 [u]= udx, I 0 [u]= u 2 dx, I 1 [u]= ( u x 2 + 2 u 3 ) dx

and

I 2 [u]= ( u x x 2 + 10 u u x 2 + 5 u 4 ) dx.

The KdV equation possesses a remarkable family of so-called n-soliton solutions corresponding to the initial profile u n (x,0)=2n(n+1) sech 2 x. For some recent generalizations and applications of the Korteweg-de Vries equation, we refer to [3, 4] and [5] and the references given therein.

Using the spectral theory of Schrödinger operators, see [6], Fairlie and Veselov [1] proved that there is a strong connection between the improver integrals related to the functions u n (x,0) above and the well-known discrete sums of power values, namely,

I k [ u n ]= ( 1 ) k 4 k + 2 2 k + 3 i = 1 n i 2 k + 3

for k=1,0,1, .

Now, let kl be fixed integers with k,l{1,0,1,2,}, and suppose that

| I k [ u n ]|=| I l [ u m ]|.

One can ask how often can these integrals be equal for given k and l? In other words, what is the cardinality of the set of solutions m, n to the equation

4 k 2 k + 3 i = 1 n i 2 k + 3 = 4 l 2 l + 3 i = 1 m i 2 l + 3 ,
(1)

where k and l are fixed distinct integers? Of course, one can consider the much more general problem, when k and l are also unknown integers; however, in this case, the solution of the corresponding equation seems beyond the reach of current techniques.

Applying some recent results by Rakaczki, see [7] and [8], it is not too hard to give some ineffective and effective finiteness statements for the solutions m and n to equation (1). However, the purpose of this note is to resolve (1) for certain values of m and n, including an infinite family of the parameters.

Theorem 1 For k=1 and l{0,1,2,3}, equation (1) has only one solution, namely, (l,m,n)=(0,24,5).

Theorem 2 Assume that k=0 and l is a positive integer such that 2l+3 is prime. Then (1) has no solution in positive integers m and n.

2 Auxiliary results

In our first lemma, we summarize some classical properties of Bernoulli polynomials. For the proofs of these results, we refer to [9].

Lemma 1 Let B j (X) denote the jth Bernoulli polynomial and B j = B j (0), j=1,2, . Further, let D j be the denominator of B j . Then we have

  1. (A)

    B j (X)= X n + i = 1 j ( j i ) B i X j i ,

  2. (B)

    S j (x)= 1 j + 2 j ++ ( x 1 ) j = 1 j + 1 ( B j + 1 (x) B j + 1 ),

  3. (C)

    B 1 = 1 2 , B 2 j + 1 =0, j=1,2, ,

  4. (D)

    (von Staudt-Clausen) D 2 j = p 1 | 2 j , p prime p,

  5. (E)

    X 2 ( X 1 ) 2 | B 2 j (X) B 2 j (in Q[X]),

  6. (F)

    B j (X)= ( 1 ) j B j (1X).

Consider the hyperelliptic curve

C: y 2 =F(x):= x 5 + b 4 x 4 + b 3 x 3 + b 2 x 2 + b 1 x+ b 0 ,
(2)

where b i Z. Let α be a root of F, and let J(Q) be the Jacobian of the curve . We have that

xα=κ ξ 2 ,

where κ,ξK=Q(α) and κ comes from a finite set. By knowing the Mordell-Weil group of the curve , it is possible to provide a method to compute such a finite set. To each coset representative i = 1 m ( P i ) of J(Q)/2J(Q), we associate

κ= i = 1 m ( γ i α d i 2 ) ,

where the set { P 1 ,, P m } is stable under the action of Galois, all y( P i ) are non-zero and x( P i )= γ i / d i 2 , where γ i is an algebraic integer and d i Z 1 . If P i , P j are conjugate, then we may suppose that d i = d j , and so, γ i , γ j are conjugate. We have the following lemma (Lemma 3.1 in [10]).

Lemma 2 Let be a set of κ values, associated as above to a complete set of coset representatives of J(Q)/2J(Q). Then is a finite subset of O K , and if (x,y) is an integral point on the curve (2), then xα=κ ξ 2 for some κK and ξK.

As an application of his theory of lower bounds for linear forms in logarithms, Baker [11] gave an explicit upper bound for the size of integral solutions of hyperelliptic curves. This result has been improved by many authors (see, e.g., [1218] and [19]).

In [10], an improved completely explicit upper bound were proved combining ideas from [15, 1925]. Now we will state the theorem, which gives the improved bound. We introduce some notation. Let K be a number field of degree d, and let r be its unit rank, and let R be its regulator. For αK, we denote by h(α) the logarithmic height of the element α. Let

K ={ log 2 d if  d = 1 , 2 , 1 4 ( log log d log d ) 3 if  d 3 ,

and let

K = ( 1 + π 2 K 2 ) 1 / 2 .

Define the constants

c 1 ( K ) = ( r ! ) 2 2 r 1 d r , c 2 ( K ) = c 1 ( K ) ( d K ) r 1 , c 3 ( K ) = c 1 ( K ) d r K , c 4 ( K ) = r d c 3 ( K ) , c 5 ( K ) = r r + 1 2 K r 1 .

Let

L / K =max { [ L : Q ] , [ K : Q ] K , 0.16 [ K : Q ] K } ,

where KL are number fields. Define

C(K,n):=3 30 n + 4 ( n + 1 ) 5.5 d 2 (1+logd).

The following result will be used to get an upper bound for the size of the integral solutions of our equations. It is Theorem 3 in [10].

Lemma 3 Let α be an algebraic integer of degree at least 3, and let κ be an integer belonging to K. Denote by α 1 , α 2 , α 3 distinct conjugates of α and by κ 1 , κ 2 , κ 3 the corresponding conjugates of κ. Let

K 1 =Q( α 1 , α 2 , κ 1 κ 2 ), K 2 =Q( α 1 , α 3 , κ 1 κ 3 ), K 3 =Q( α 2 , α 3 , κ 2 κ 3 )

and

L=Q( α 1 , α 2 , α 3 , κ 1 κ 2 , κ 1 κ 3 ).

In what follows R stands for an upper bound for the regulators of K 1 , K 2 and K 3 , and r denotes the maximum of the unit ranks of K 1 , K 2 , K 3 . Let

c j = max 1 i 3 c j ( K i ),

and let

N= max 1 i , j 3 | Norm Q ( α i , α j ) / Q ( κ i ( α i α j ) ) | 2 ,

and let

H = c 5 R+ log N min 1 i 3 [ K i : Q ] +h(κ).

Define

A 1 =2 H C(L,2r+1) ( c 1 ) 2 L / L ( max 1 i 3 L / K i ) 2 r R 2

and

A 2 =2 H + A 1 + A 1 log { ( 2 r + 1 ) max { c 4 , 1 } } .

If xZ{0} satisfies xα=κ ξ 2 for some ξK then

log|x|8 A 1 log ( 4 A 1 ) +8 A 2 + H +20log2+13h(κ)+19h(α).

To obtain a lower bound for the possible unknown integer solutions, we are going to use the so-called Mordell-Weil sieve. The Mordell-Weil sieve has been successfully applied to prove the non-existence of rational points on curves (see, e.g., [2628] and [29]).

Let C/Q be a smooth projective curve (in our case a hyperelliptic curve) of genus g2. Let J be its Jacobian. We assume the knowledge of some rational point on C, so let D be a fixed rational point on C, and let ȷ be the corresponding Abel-Jacobi map

ȷ:CJ,P[PD].

Let W be the image in J of the known rational points on C and D 1 ,, D r generators for the free part of J(Q). By using the Mordell-Weil sieve, we are going to obtain a very large and smooth integer B such that

ȷ ( C ( Q ) ) W+BJ(Q).

Let

ϕ: Z r J(Q),ϕ( a 1 ,, a r )= a i D i ,

so that the image of ϕ is the free part of J(Q). The variant of the Mordell-Weil sieve explained in [10] provides a method to obtain a very long decreasing sequence of lattices in Z r

B Z r = L 0 L 1 L 2 L k

such that

ȷ ( C ( Q ) ) W+ϕ( L j )

for j=1,,k.

The next lemma [[10], Lemma 12.1] gives a lower bound for the size of rational points, whose images are not in the set W.

Lemma 4 Let W be a finite subset of J(Q), and let L be a sublattice of Z r . Suppose that ȷ(C(Q))W+ϕ(L). Let μ 1 be a lower bound for h h ˆ and

μ 2 =max { h ˆ ( w ) : w W } .

Denote by M the height-pairing matrix for the Mordell-Weil basis D 1 ,, D r , and let λ 1 ,, λ r be its eigenvalues. Let

μ 3 =min{ λ j :j=1,,r},

and let m(L) be the Euclidean norm of the shortest non-zero vector of L. Then, for any PC(Q), either ȷ(P)W or

h ( ȷ ( P ) ) ( μ 3 m ( L ) μ 2 ) 2 + μ 1 .

The following lemma plays a crucial role in the proof of Theorem 1.

Lemma 5 The integral solutions of the equation

C: Y 2 =X ( X + 20 ) 2 ( X 2 + 10 X + 400 ) +140,625
(3)

are

(X,Y) { ( 0 , ± 375 ) , ( 20 , ± 375 ) } .

Proof of Lemma 5 Let J(Q) be the Jacobian of the genus two curve (3). Using MAGMA, we determine a Mordell-Weil basis, which is given by

D 1 = ( 0 , 375 ) , D 2 = ( 20 , 375 ) .

Let f=x ( x + 20 ) 2 ( x 2 +10x+400)+140,625, and let α be a root of f. We will choose for coset representatives of J(Q)/2J(Q) the linear combinations i = 1 2 n i D i , where n i {0,1}. Then

xα=κ ξ 2 ,

where κK, and is constructed as described in Lemma 2. We have that K={1,α,20α,α(α+20)}. By local arguments, it is possible to restrict the set further (see, e.g., [26, 30]). In our case, one can eliminate

α(α+20)

by local computations in Q 3 . We apply Lemma 3 to get a large upper bound for log|x| in the remaining cases. A MAGMA code was written to obtain the bounds that appeared in [10]; they can be found at http://www.warwick.ac.uk/~maseap/progs/intpoint/bounds.m. We obtain that these bounds are as in Table 1.

Table 1 Bounds

The set of known rational points on the curve (3) is {,(0,±375),(20,±375)}. Let W be the image of this set in J(Q). Applying the Mordell-Weil sieve, implemented by Bruin and Stoll and explained in [10], we obtain that ȷ(C(Q))W+BJ(Q), where

B= 2 8 5 3 7 2 11 2 13 2 17 2 1931374143535971798389

that is

B=46,128,223,306,000,188,203,435,897,312,000.

Now, we use an extension of the Mordell-Weil sieve due to Samir Siksek to obtain a very long decreasing sequence of lattices in Z 2 . After that, we apply Lemma 4 to obtain a lower bound for possible unknown rational points. We get that if (x,y) is an unknown integral point, then

log|x|2.216448× 10 782 .

This contradicts the bound for log|x| that we obtained by Baker’s method. □

3 Proofs of the theorems

Proof of Theorem 1 For k=1 and l{0,1,2,3}, we have the Diophantine equations

n ( n + 1 ) 2 = m 2 ( m + 1 ) 2 3 ,
(4)
n ( n + 1 ) 8 = 1 15 z 2 (2z1)with z=m(m+1),
(5)
n ( n + 1 ) 8 = 2 21 z 2 ( 3 z 2 4 z + 2 ) with z=m(m+1)
(6)

and

1 4 i = 1 n i= 64 9 i = 1 m i 9 ,
(7)

respectively. One can see that the first three equations are elliptic Diophantine equations, thus using the program package MAGMA, subroutines IntegralPoints or IntegralQuarticPoints are just a straightforward calculation to solve them. In these cases, the unique solution is (l,m,n)=(0,24,5). The forth equation can be written as follows

( 2 n + 1 ) 2 = 128 45 ( m 2 + m 1 ) ( m 2 + m ) 2 ( 2 m 4 + 4 m 3 m 2 3 m + 3 ) +1.

So, we easily obtain a hyperelliptic curve

Y 2 =X ( X + 20 ) 2 ( X 2 + 10 X + 400 ) +140,625,

where Y=375(2n+1) and X=20 m 2 +20m20. By Lemma 5, we have that X=0 or 20. Therefore, we have that m{1,0}, a contradiction and there is no solution in positive integers of (7). □

Proof of Theorem 2 Now k=0 and p=2l+33 is a prime. From (1), we get

p n 2 ( n + 1 ) 2 =3 4 l + 1 ( 1 p + 2 p + + m p ) .

Let m and n be an arbitrary but fixed solution. An elementary number theoretical argument and Lemma 1 yield that p|m(m+1) and

ord p ( 1 p + 2 p + + m p m 2 ( m + 1 ) 2 ) = ord p B p + 1 ( m + 1 ) B p + 1 m 2 ( m + 1 ) 2 0.

Suppose that p|m, and let d be the smallest positive integer such that B p + 1 (m+1) B p + 1 = 1 d f(m) m 2 ( m + 1 ) 2 , and let f(X)Z[X]. Since ( p + 1 k ) is divisible by p for k=2,,p1 and B 1 =1/2, we have that p is not a divisor of d. The constant term of the polynomial f(X) is d ( p + 1 p 1 ) B p 1 , and, by von Staudt-Clausen theorem, it is not divisible by p. On the other hand, p is a divisor of m and f(m), we have a contradiction. If p|m+1, then we can repeat the previous argument using the fact f(X)=f(X1), cf. Lemma 1. □