Академический Документы
Профессиональный Документы
Культура Документы
Jes
us Guillera
(a + x)
,
(a)
(0)0 = 1.
= jn
,
j n
j
j n!
n
Jes
us Guillera
1 3
X
1 2 n
16
(42n + 5) = ,
6n
3
2 (1)n
n=0
1
1
3
X 1
9801 2
2 n 4 n 4 n
(26390n + 1103) =
,
994n
(1)3n
4
n=0
!8n
1 3
h
i 32
X
51
2 n 1
(42
5
+
30)n
+
(5
5
1)
= .
(1)3n 26n
2
n=0
Jes
us Guillera
X
n=0
1
2 n
(s)n (1 s)n n
1
z (a + bn) = ,
3
(1)n
Jes
us Guillera
1
X
(1)n 2 n 6 n 6 n 545140134n + 13591409
10005
=
,
533603n
(1)3n
426880
n=0
1
1 + 163
2i
z e
=
.
, for =
533603
2
z(q) =
a = a(q),
b = b(q),
7,
and f (q),
1 3n
2 n
r (2(q)
(1)3n
n=0
1)n +[(q)
oh
in 1
r (q)] 4(q)(1 (q)) = .
For example, to obtain the series with r = 7 use the known identity
1 (e
and substitute q =
e / r
) = (e /
),
n
o1 n
o1
8
8
(q)(q 7 ) + (1 (q))(1 (q 7 ))
= 1,
due to C. Guetzlaff in 1834 and rediscovered by Ramanujan.
Jes
us Guillera
X
n=0
n z n+x
1
k
+ 0 x x 2 + O(x 3 ),
Jes
us Guillera
The WZ-method
Let G (n, k) be hypergeometric in its two symbols. The proof of
n=0
F (0, k) = 0,
(WZpair ).
Chains of WZ pairs
s Z {0},
t Z,
then Fs,t (n, k) and Gs,t (n, k) are also the functions of WZ-pairs
satisfying Fs,t (0, k) = 0 and in addition, we have
X
n=0
Gs,t (n, k) =
G (n, k) = Constant.
n=0
Jes
us Guillera
Zeilbergers algorithm
Let K be the operator KG (n, k) = G (n, k + 1). The output of
Zeilberger(G(n,k),k,n,K)[1];
Zeilberger(G(n,k),k,n,K)[2];
is of the form
P0 (k) + P1 (k)K + Pm (k)K m ,
F (n, k),
where the functions Pj (k) are polynomials and the function F (n, k)
is the companion. This means that G (n, k) satisfies the recurrence
(P0 (k)+P1 (k)K + +Pm (k)K m ) G (n, k) = F (n +1, k)F (n, k).
If we sum for n 0, and call g (k) the sum of G (n, k), we see that
P0 (k)g (k) + P1 (k)g (k + 1) + + Pm (k)g (k + m) = F (0, k).
Jes
us Guillera
Problem 1
1
X
1 2 n 4 n
32n
(1)3n
n=0
and
X
n=0
1
2 n
1
4 n
(1)3n
3
4 n
3
4 n
2 3
(8n + 1) =
,
(1)n
16 3
.
(28n + 3) =
48n
3
Jes
us Guillera
Let
1
H(n, k) = 2n
3
1
2
+k
and
g (k) =
1
k2 n 34
n 4
(1)2n (1 + k)n
k
2 n
H(n, k).
n=0
Jes
us Guillera
1
X
1 2 +k n 4 2 n 4 2 n
2 3 4 k (1)k
,
(8n+2k+1) =
1
32n
(1)2n (1 + k)n
3
2 k
n=0
Jes
us Guillera
X
(1)n
n=0
1
2
24n 3n
1
4
2
(1)n
+
1
k
3
k
1
2 n 4 + 2 n 2
+ k2 n 12 + k2 n
+k
n
k
(28n + 3)(2n + 1) + 4k(9n + k + 2)
16 3
4
(1)k
.
1
2n + k + 1
3
3
2 k
Finally, take k = 0.
Jes
us Guillera
Problem 2
1 1 2
X
1 n 2 n 3 n 3 n
12 3
(51n + 7) =
,
16
(1)3n
n=0
due to Chan, Liaw and Tan, who proved it in 2003 using modular
equations.
Jes
us Guillera
Jes
us Guillera
1
16
n
1
1
1
2
2 n 2 + 2k n 3 + k n 3 + k n
,
1
k
k
2 + 2 n 1 + 2 n (1 + k)n (1)n
X
n=0
(1)2k
.
1
3
4 k
4 k
q = 36,
Jes
us Guillera
r = 37.
X
Y (si )n
1
n
(a + bn + cn2 ) = 2 ,
z
(1)n
n=0
i=0
Jes
us Guillera
1 3
2 n
(1)3n
n=0
(1)n j
n,
2kn
and look for integer relations among f (0), f (1), f (2) and 1/ 2 .
Jes
us Guillera
1 5
n
X
2 n (1)
(20n2 + 8n + 1) =
(1)5n 22n
n=0
3 1 3
1
X
2 n 4 n 4 n 1
(120n2 + 34n + 3) =
(1)5n
24n
n=0
1 5
n
X
2 n (1)
(820n2 + 180n + 13) =
(1)5n 210n
n=0
3 1 2 3n
1
X
3
2 n 3 n 3 n
(74n2 + 27n + 3) =
(1)5n
4
n=0
8
,
2
32
,
2
128
,
2
48
.
2
Problem 1
X
(1)n
22n
X
n=0
and
1
24n
n=0
3
1 3 1
2 n 4 n 4 n
(120n2
(1)5n
1 5
2 n
(1)5n
n=0
1 5
2 n
(20n2
(1)5n
+ 8n + 1) =
8
,
2
+ 34n + 3) =
32
,
2
(1)n
128
(820n2 + 180n + 13) = 2 .
10n
2
Jes
us Guillera
Proof of Problem 1
We have
X
(1)n
n=0
1 5
2 n
8 (1)4k
,
2 1 4
2 k
and
X
1
24n
n=0
3 k
1 3 1
k
2 n 42 n 42 n
(120n2 +84kn+34n+10k+3) =
(1)3n (1 + k)2n
32 (1)2k
.
2 1 2
2 k
Jes
us Guillera
Problem 2
X
n=0
1 3
2 n
1
3 n
(1)5n
2
3 n
3n
48
3
(74n2 + 27n + 3) = 2 .
4
Jes
us Guillera
Proof of Problem 2
We have
1 3
X
2 n
n=0
1
3
2
k
k
3 n 3 + 3 n
(1)3n (1 + k)3n
1+
k
3 n
3n
3
4
48 (1)2k
,
2 1 2
2 k
Then, taking k = 0.
Jes
us Guillera
Conjectured formulas
By the PSLQ algorithm we discovered the formulas
1 2 1 3
1
n
X
2 n 3 n 3 n 4 n 4 n (1)
(252n2 + 63n + 5) =
(1)5n
48n
n=0
1 3 5 7
1
X
2 n 8 n 8 n 8 n 8 n 1
(1920n2 + 304n + 15) =
(1)5n
74n
n=0
1 3 1 5
1
n
X
2 n 4 n 4 n 6 n 6 n (1)
(1640n2 + 278n + 15) =
(1)5n
210n
n=0
1 2 1 5
1
n
X
2 n 3 n 3 n 6 n 6 n (1)
(5418n2 + 693n + 29) =
(1)5n
803n
n=0
48
,
2
56 7
,
2
256 3
,
2
128 5
.
2
Jes
us Guillera
Conjecture
Let 0 < z < 1 and = 1 (series of positive terms) or = 1
(alternating series). The expansion
X
n=0
"
n n+x
4
Y
(si )n+x
i=0
(1)n+x
#
[a + b(n + x) + c(n + x)2 ]
1
j
k
+ 0 x x 2 + 0 x 3 + 2 x 4 + O(x 5 ),
2
2
24
Jes
us Guillera
1
X
384
2 n 3 n 3 n 6 n 6 n
n 3
(1936n2 + 549n + 45) = 2 ,
(1)
(1)5n
4
n=0
6n
1
1
2
1
5
X
375
3
2 n 3 n 3 n 6 n 6 n
(532n2 + 126n + 9) = 2 ,
(1)5n
5
n=0
2 3n
1 3 1
X
216 2
162
30
3
2 n 3 n 3 n 3
(32
)n +(18
)n+(3 ) = 2 ,
5
(1)n
n=0
where is the fifth power of the golden ratio. This formula is the
unique irrational example that I have found for 1/ 2 .
The second formula is joint with G. Almkvist.
Jes
us Guillera
Calabi-Yau n-folds
Calabi-Yau onefolds are elliptic curves. The periods
Z
dz
f (z) =
,
y
1
of the family y 2 = x(x 1)(x z) satisfy
z
(1 z)2 f z f f = 0,
4
=z
d
.
dz
zn
#
" 4
Y (si )n
n=0
i=0
(1)n
g1 = a0 ln z + a1 ,
g2 = a0
ln2 z
+ a1 ln z + a2 ,
2
ln3 z
ln2 z
+ a1
+ a2 ln z + a3 ,
6
2
ln4 z
ln3 z
ln2 z
g 4 = a0
+ a1
+ a2
+ a3 ln z + a4 .
24
6
2
g 3 = a0
Jes
us Guillera
The pullback
The five solutions g0 , g1 , g2 , g3 , g4 can be recovered from the four
fundamental solutions y0 , y1 , y2 , y3 of a Calabi-Yau diff. eq.
4 y = e3 (z)3 y + e2 (z)2 y + e1 (z)y + e0 (z) by means of :
y0 y2
y0 y1
1 y1 y3
, g3 =
,
, g1 =
g0 =
y0 y2
y0 y1
2 y1 y3
y
1 y
y3 y1 y2
y3
.
=
g4 = 2
, g2 = 0
y0 y3 y1 y2
2 y2 y3
The following relations hold:
2g0 g4 2g1 g3 + g22 = 0,
2(g0 )(g4 ) 2(g1 )(g3 ) + (g2 )2 = 0,
2(2 g0 )(2 g4 ) 2(2 g1 )(2 g3 ) + (2 g2 )2 = exp2
Jes
us Guillera
Z
e3 (z)
dz .
2z
y2
),
y0
q = q
d
.
dq
Jes
us Guillera
p
e3 (z)
dz=c(q) 1 z(q) (hyperg. cases).
2z
ln q
3
1
dk
(q) = (q ln q) ,
2
dq
where
h=
4
X
(3, si ).
i=0
In addition, we have
2 =
j k 2 5k
+ + +1+(cot2 s1 )(cot2 s2 )+(1+k)(cot2 s1 +cot2 s2 ).
12 4
3
1
210
= + 320 + 68000q + 12646400q 2 + 2251836880q 3
z(q)
q
+ 396687233024q 4 + 69974001492480q 5 +
Jes
us Guillera
Thank you
Jes
us Guillera