Combinatorics, Modular Functions, and Computer Algebra
|
|
- Albert Bradley
- 5 years ago
- Views:
Transcription
1 Combinatorics, Modular Functions, and Computer Algebra / 1 Combinatorics and Computer Algebra (CoCoA 2015) Colorado State Univ., Fort Collins, July 19-25, 2015 Combinatorics, Modular Functions, and Computer Algebra Peter Paule (joint work with: G.E. Andrews, S. Radu) Johannes Kepler University Linz Research Institute for Symbolic Computation (RISC)
2 Combinatorics, Modular Functions, and Computer Algebra / Numbers 2 Numbers
3 Combinatorics, Modular Functions, and Computer Algebra / Numbers
4 Combinatorics, Modular Functions, and Computer Algebra / Numbers 4 Example: p(4) = 5: 4, 3 + 1, 2 + 2, ,
5 Combinatorics, Modular Functions, and Computer Algebra / Numbers 4 Example: p(4) = 5: 4, 3 + 1, 2 + 2, , EULER. The generating function of the partition numbers is E(q) := p(n)q n = n=0 n=1 1 1 q n = (1 + q 1 + q q ) (1 + q 2 + q q ) (1 + q 3 + q q ) etc. = + q
6 Combinatorics, Modular Functions, and Computer Algebra / Numbers 5 Back to p(n): ANY PATTERNS? 3,313, 3,325, and 3,362 of the first 10,000 entries are congruent respectively to 0, 1, and 2 modulo 3. [Ahlgren & Ono] BUT:
7 Combinatorics, Modular Functions, and Computer Algebra / Numbers 5 Back to p(n): ANY PATTERNS? 3,313, 3,325, and 3,362 of the first 10,000 entries are congruent respectively to 0, 1, and 2 modulo 3. [Ahlgren & Ono] BUT: 3,611 (many more than the expected one-fifth) of the first 10,000 values of p(n) are divisible by 5. [Ahlgren & Ono]
8 Combinatorics, Modular Functions, and Computer Algebra / Numbers 5 Back to p(n): ANY PATTERNS? 3,313, 3,325, and 3,362 of the first 10,000 entries are congruent respectively to 0, 1, and 2 modulo 3. [Ahlgren & Ono] BUT: 3,611 (many more than the expected one-fifth) of the first 10,000 values of p(n) are divisible by 5. [Ahlgren & Ono] WHY? Let s look again at our table:
9 Combinatorics, Modular Functions, and Computer Algebra / Numbers
10 Combinatorics, Modular Functions, and Computer Algebra / Numbers 7 Ramanujan s famous congruences p(5n + 4) 0 (mod 5), p(7n + 5) 0 (mod 7), p(11n + 6) 0 (mod 11)
11 Combinatorics, Modular Functions, and Computer Algebra / Numbers 8 Proof. The first congruence is implied by p(5n + 4)q n = 5 n=0 j=1 (1 q 5j ) 5 (1 q j ) 6
12 Combinatorics, Modular Functions, and Computer Algebra / Numbers 8 Proof. The first congruence is implied by p(5n + 4)q n = 5 n=0 j=1 (1 q 5j ) 5 (1 q j ) 6 It would be difficult to find more beautiful formulae than the Rogers-Ramanujan identities... ; but here Ramanujan must take second place to Prof. Rogers; and, if I had to select one formula from all Ramanujan s work, I would agree with Major MacMahon in selecting... [G.H. Hardy]
13 Combinatorics, Modular Functions, and Computer Algebra / Numbers 9 Ramanujan [1919] found also an identity for the 7-case: p(7n + 5)q n n=0 = 7 j=1 (1 q 7j ) 3 (1 q j ) q j=1 (1 q 7j ) 7 (1 q j ) 8. What about the case p(11n + 6)?
14 Combinatorics, Modular Functions, and Computer Algebra / Numbers 9 Ramanujan [1919] found also an identity for the 7-case: p(7n + 5)q n n=0 = 7 j=1 (1 q 7j ) 3 (1 q j ) q j=1 (1 q 7j ) 7 (1 q j ) 8. What about the case p(11n + 6)? No such identity has been known, until recently...
15 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 10 Modular Functions
16 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 11 Recall E(q) := (1 q n ). n=1 We move from formal power (resp. Laurent) series to complex functions by defining where here and in the following q := q(τ) := exp(2πiτ)(= e 2πiτ ), τ H := {z C : Im(z) > 0}. MODULAR SYMMETRY.
17 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 11 Recall E(q) := (1 q n ). n=1 We move from formal power (resp. Laurent) series to complex functions by defining where here and in the following q := q(τ) := exp(2πiτ)(= e 2πiτ ), τ H := {z C : Im(z) > 0}. MODULAR SYMMETRY. If g(τ) := q(τ) E (q(τ)) 24 then ( ) ( ) aτ + b g = (cτ + d) 12 a b g(τ) for all SL cτ + d c d 2 (Z).
18 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 12 We also need subgroups where N N \ {0}: {( ) } a b Γ 0 (N) := SL c d 2 (Z) : N c.
19 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 12 We also need subgroups where N N \ {0}: {( ) } a b Γ 0 (N) := SL c d 2 (Z) : N c. Def. A holomorphic function f(τ) is a modular function for Γ 0 (N), in short: f M(N), if ( ) ( ) aτ + b a b f = f(τ) for all Γ cτ + d c d 0 (N) and
20 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 12 We also need subgroups where N N \ {0}: {( ) } a b Γ 0 (N) := SL c d 2 (Z) : N c. Def. A holomorphic function f(τ) is a modular function for Γ 0 (N), in short: f M(N), if ( ) ( ) aτ + b a b f = f(τ) for all Γ cτ + d c d 0 (N) and for all p/q Q { }: lim f(τ) R 0 { }. τ p/q
21 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 13 Examples. Eta quotients like q E(q5 ) 6 E(q) 6 = j=1 (1 q 5j ) 6 (1 q j ) 6 M(5), q E(q7 ) 4 E(q) 4 = j=1 (1 q 7j ) 4 (1 q j ) 4 M(7); functions like q E(q 5 ) p(5n + 4)q n M(5), n=0 or the celebrated modular j-function (Klein invariant), j(τ) = 1 q q q q 3 + M(1). NOTE. Γ 0 (1) = SL 2 (Z).
22 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 13 Zero recognition of functions in M(N)? The action ( ) a b Γ 0 (N) H H, τ := aτ + b c d cτ + d induces the action Γ 0 (N) HoloFus(H) HoloFus(H), (f γ)(τ) := f(γτ).
23 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 13 Zero recognition of functions in M(N)? The action ( ) a b Γ 0 (N) H H, τ := aτ + b c d cτ + d induces the action Γ 0 (N) HoloFus(H) HoloFus(H), (f γ)(τ) := f(γτ). The modular functions in M(N) HoloFus(H) are those which are constant on the orbits of the first action. It is crucial to extend this action as follows:
24 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 13 Zero recognition of functions in M(N)? The action ( ) a b Γ 0 (N) H H, τ := aτ + b c d cτ + d induces the action Γ 0 (N) HoloFus(H) HoloFus(H), (f γ)(τ) := f(γτ). The modular functions in M(N) HoloFus(H) are those which are constant on the orbits of the first action. It is crucial to extend this action as follows: ( ) a b Γ 0 (N) H Q { } H Q { }, c d τ := aτ + b cτ + d.
25 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 13 Zero recognition of functions in M(N)? The action ( ) a b Γ 0 (N) H H, τ := aτ + b c d cτ + d induces the action Γ 0 (N) HoloFus(H) HoloFus(H), (f γ)(τ) := f(γτ). The modular functions in M(N) HoloFus(H) are those which are constant on the orbits of the first action. It is crucial to extend this action as follows: ( ) a b Γ 0 (N) H Q { } H Q { }, c d τ := aτ + b cτ + d. X 0 (N) := {[τ] : τ H Q { }} (set of orbits).
26 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 14 The set of orbits X 0 (N) := {[τ] : τ H Q { }} can be turned into a COMPACT Riemann surface.
27 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 14 The set of orbits X 0 (N) := {[τ] : τ H Q { }} can be turned into a COMPACT Riemann surface. Each (holomorphic) f M(N) has a meromorphic extension f : X 0 (N) C {0}. ZERO RECOGNITION.
28 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 14 The set of orbits X 0 (N) := {[τ] : τ H Q { }} can be turned into a COMPACT Riemann surface. Each (holomorphic) f M(N) has a meromorphic extension f : X 0 (N) C {0}. ZERO RECOGNITION. f holomorphic f constant f constant.
29 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 14 The set of orbits X 0 (N) := {[τ] : τ H Q { }} can be turned into a COMPACT Riemann surface. Each (holomorphic) f M(N) has a meromorphic extension f : X 0 (N) C {0}. ZERO RECOGNITION. f holomorphic f constant f constant. In our context we can restrict to good subalgebras of M(N):
30 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 15 To prove (and to find!) Ramanujan s identities automatically, we can restrict to consider M (N) := {f M(N) : f has a pole at [ ]}.
31 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 15 To prove (and to find!) Ramanujan s identities automatically, we can restrict to consider M (N) := {f M(N) : f has a pole at [ ]}. Our goal is to present a given f M (N) in the form E(q a 1 ) α 1 E(q a 2 ) α2 E(q u1 ) µ1 E(q u2 ) µ2 f = c 1 E(q b 1 ) β 1E(q b 2) β c m E(q v 1 ) ν 1E(q v 2) ν 2 with coefficients c j C and the Eta quotients in M (N).
32 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 15 To prove (and to find!) Ramanujan s identities automatically, we can restrict to consider M (N) := {f M(N) : f has a pole at [ ]}. Our goal is to present a given f M (N) in the form E(q a 1 ) α 1 E(q a 2 ) α2 E(q u1 ) µ1 E(q u2 ) µ2 f = c 1 E(q b 1 ) β 1E(q b 2) β c m E(q v 1 ) ν 1E(q v 2) ν 2 with coefficients c j C and the Eta quotients in M (N). All Eta quotients in M (N) form a multiplicative monoid denoted by E (N) := {f M (N) : f is an Eta quotient}
33 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 16 NOTE 1. This monoid is finitely generated, E (N) = f 1,..., f n = {f l f n ln : l i N}; the generators f 1,..., f n E (N) for fixed N can be determined algorithmically (e.g., with partition analysis).
34 Combinatorics, Modular Functions, and Computer Algebra / Modular Functions 16 NOTE 1. This monoid is finitely generated, E (N) = f 1,..., f n = {f l f n ln : l i N}; the generators f 1,..., f n E (N) for fixed N can be determined algorithmically (e.g., with partition analysis). NOTE 2. In view of E(q a 1 ) α 1 E(q a 2 ) α2 E(q u1 ) µ1 E(q u2 ) µ2 f = c 1 E(q b 1 ) β 1E(q b 2) β c m E(q v 1 ) ν 1E(q v 2) ν 2 our task is to constructively decide subalgebra membership f? C[f 1,..., f n ] M (N).
35 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 17 Monoids & Subalgebras
36 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 18 McNuggets Partitions GIVEN TASK: buy exactly 43 nuggets.
37 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 18 McNuggets Partitions GIVEN TASK: buy exactly 43 nuggets. IMPOSSIBLE!
38 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 18 McNuggets Partitions GIVEN TASK: buy exactly 43 nuggets. IMPOSSIBLE! See: How to order 43 Chicken McNuggets - Numberphile
39 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 19 Generators of (additive) submonoids of N M:= 6, 9, 20 N = {0, 1,... } [M] i := {x M : x i (mod 6)}
40 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 19 Generators of (additive) submonoids of N M:= 6, 9, 20 N = {0, 1,... } [M] i := {x M : x i (mod 6)} [M] 0 = {0, 6, 12,... }, [M] 1 = { 1, 7, 13, 19, 25, 31, 37, 43, 49, 54,... }, [M] 2 = { 2, 8, 14, 20, 26,... }, [M] 3 = { 3, 9, 15,... }, [M] 4 = { 4, 10, 16, 22, 28, 34, 40, 46,... }, [M] 5 = { 5, 11, 17, 23, 29, 35,... }.
41 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 19 Generators of (additive) submonoids of N M:= 6, 9, 20 N = {0, 1,... } [M] i := {x M : x i (mod 6)} [M] 0 = {0, 6, 12,... }, [M] 1 = { 1, 7, 13, 19, 25, 31, 37, 43, 49, 54,... }, [M] 2 = { 2, 8, 14, 20, 26,... }, [M] 3 = { 3, 9, 15,... }, [M] 4 = { 4, 10, 16, 22, 28, 34, 40, 46,... }, [M] 5 = { 5, 11, 17, 23, 29, 35,... }. M = 6, 9, 20 = 6, 49, 20, 9, 40, 29 and {u 1, u 2, u 3, u 4, u 5 }:={49, 20, 9, 40, 29} {1, 2, 3, 4, 5} (mod 6).
42 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 20 QUESTION. What happens if we add more generators? M + := 4, 6, 9, 20 N = {0, 1,... } [M + ] i := {x M : x i (mod 6)}
43 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 20 QUESTION. What happens if we add more generators? M + := 4, 6, 9, 20 N = {0, 1,... } [M + ] i := {x M : x i (mod 6)} [M + ] 0 = {0, 6, 12,... }, [M + ] 1 = { 1, 7, 13, 19,... }, [M + ] 2 = { 2, 8, 14,... }, [M + ] 3 = { 3, 9, 15,... }, [M + ] 4 = {4, 10,... }, [M + ] 5 = { 5, 11, 17, 23,... }.
44 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 20 QUESTION. What happens if we add more generators? M + := 4, 6, 9, 20 N = {0, 1,... } [M + ] i := {x M : x i (mod 6)} [M + ] 0 = {0, 6, 12,... }, [M + ] 1 = { 1, 7, 13, 19,... }, [M + ] 2 = { 2, 8, 14,... }, [M + ] 3 = { 3, 9, 15,... }, [M + ] 4 = {4, 10,... }, [M + ] 5 = { 5, 11, 17, 23,... }. NOTE. In contrast to the Frobenius number F (6, 9, 20) = 43, now F (4, 6, 9, 20) = 11 and 43 = = = [four more]. QUESTION. How to find presentations in terms of generators?
45 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 21 (a) Greedy Algorithm STRATEGY: Successive subtraction; begin with the largest generator, first taken a maximal number of times; iterate.
46 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 21 (a) Greedy Algorithm STRATEGY: Successive subtraction; begin with the largest generator, first taken a maximal number of times; iterate. EXAMPLE: x = 62 and M = 6, 9, = = 22, = = 13, = = = 42, = 6, = 0.
47 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 22 SOLUTION. 62 =
48 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 22 SOLUTION. 62 = Also, and 62 = =
49 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 22 SOLUTION. 62 = Also, and 62 = = PREVIEW. The Omega package computes In[2]:=OEqR[ OEqSum[x a y b z c, {6a + 9b + 20c = 62}, λ ]] Out[2]= ( x 7 + x 4 y 2 + xy 4) z.
50 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 23 (b) Algorithm based on the generators u 1,..., u 5 STRATEGY: Find a representation x = u i + l 6.
51 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 23 (b) Algorithm based on the generators u 1,..., u 5 STRATEGY: Find a representation x = u i + l 6. EXAMPLE: M = 6, u 1, u 2, u 3, u 4, u 5 = 6, 43, 20, 9, 40, 29. and x = 62.
52 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 23 (b) Algorithm based on the generators u 1,..., u 5 STRATEGY: Find a representation x = u i + l 6. EXAMPLE: M = 6, u 1, u 2, u 3, u 4, u 5 = 6, 43, 20, 9, 40, 29. and x = (mod 6); hence we recall that [M] 2 = { 2, 8, 14, 20, 26,... }; consequently, 62 = = u
53 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 24 Application: C-subalgebras of C[z] GIVEN: f 1, f 2, f 3 C[z] with t :=f 1 = z 6 + a z , FIND: g 1,..., g k C[z] such that f 2 = z 9 + b z , f 3 = z 20 + c z ; C[f 1, f 2, f 3 ] = g 1,..., g k C[t] = C[t] + C[t] g C[t] g k.
54 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 24 Application: C-subalgebras of C[z] GIVEN: f 1, f 2, f 3 C[z] with t :=f 1 = z 6 + a z , FIND: g 1,..., g k C[z] such that f 2 = z 9 + b z , f 3 = z 20 + c z ; C[f 1, f 2, f 3 ] = g 1,..., g k C[t] = C[t] + C[t] g C[t] g k. KEY IDEA: z n + = z u i+l 6 + = (z a i 9 +b i 20 + ) t l +.
55 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 25 DECISION PROCEDURE: C-subalgebra membership GIVEN: f and f 1,..., f n from C[z]; FIND: polynomials p 0, p 1,..., p k C[z] such that f = p 0 (t) + p 1 (t) g p k (t) g k 1, g 1,..., g k C[t] = C[f 1,..., f n ] APPLICATION.
56 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 25 DECISION PROCEDURE: C-subalgebra membership GIVEN: f and f 1,..., f n from C[z]; FIND: polynomials p 0, p 1,..., p k C[z] such that f = p 0 (t) + p 1 (t) g p k (t) g k 1, g 1,..., g k C[t] = C[f 1,..., f n ] APPLICATION. With this procedure the right hand sides of Ramanujan identities can be found automatically: just apply it to given f M (N) and f 1,..., f n E (N). In this context, z = 1 q because of possible poles sitting at [ ]; the f j can be treated as formal Laurent series like f 1 = a 6 q 6 + a 5 q 5 +, f 2 = b 9 q 9 + b 8 q 8 +, f 3 = c 20 q 20 + c 19 +, etc. q19
57 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 26 Example. Radu s Ramanujan-Kolberg package in STEP 1 computes that: 1 E(q)8 q E(q 7 ) 7 p(7n + 5)q n M (7). n=0
58 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 26 Example. Radu s Ramanujan-Kolberg package in STEP 1 computes that: 1 E(q)8 q E(q 7 ) 7 p(7n + 5)q n M (7). n=0 In STEP 2 Radu s package determines that the monoid is generated by one element (recall f 1 = t): E (7) = f 1 = q 1 E(q)4 E(q 7 ) 4.
59 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 26 Example. Radu s Ramanujan-Kolberg package in STEP 1 computes that: 1 E(q)8 q E(q 7 ) 7 p(7n + 5)q n M (7). n=0 In STEP 2 Radu s package determines that the monoid is generated by one element (recall f 1 = t): E 1 E(q)4 (7) = f 1 = q E(q 7 ) 4. In STEP 3 the package determines the module presentation C[f 1,..., f n ] = C[f 1 ] = 1, g 1,..., g k C[t] = 1 C[f1 ].
60 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 26 Example. Radu s Ramanujan-Kolberg package in STEP 1 computes that: 1 E(q)8 q E(q 7 ) 7 p(7n + 5)q n M (7). n=0 In STEP 2 Radu s package determines that the monoid is generated by one element (recall f 1 = t): E 1 E(q)4 (7) = f 1 = q E(q 7 ) 4. In STEP 3 the package determines the module presentation C[f 1,..., f n ] = C[f 1 ] = 1, g 1,..., g k C[t] = 1 C[f1 ]. In STEP 4 the package finds Ramanujan s identity: 1 E(q)8 q E(q 7 ) 7 p(7n + 5)q n = f 1. n=0
61 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 27 QUESTION. How to compute the u 1,..., u 5 from M = 6, 9, 20? ANSWER. To find u 1 = 49, we ask Omega to compute In[3]:=OEqR[ OEqSum[x a y b z c, { 6a + 9b + 20c = 1}, λ ]] Out[3]= x 8 yz 2 (1 x 3 y 2 )(1 x 10 z 3 ).
62 Combinatorics, Modular Functions, and Computer Algebra / Monoids & Subalgebras 28 Out[3] means that a,b,c 0 s.t. 6a+9b+20c=1 x a y b z c = x 8 yz 2 (1 x 3 y 2 ) (1 x 10 z 3 ) ; in other words, N 2 + N is the solution set of 6a + 9b + 20c = 1. For example, = = 49 = u 1. Analogously one computes u 2,..., u 5.
63 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 29 Partition Analysis
64 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 30 PROBLEM [Polya]. Consider triangles with sides of integer length such that 1 l m n; TASK: express the total number of such triangles in terms of n.
65 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 30 PROBLEM [Polya]. Consider triangles with sides of integer length such that 1 l m n; TASK: express the total number of such triangles in terms of n. EXAMPLE. n = 3
66 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 31 PROBLEM [folklore]. Consider triangles with sides of integer length such that 1 a b c; TASK: find the total number of all such triangles with perimeter n.
67 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 31 PROBLEM [folklore]. Consider triangles with sides of integer length such that 1 a b c; TASK: find the total number of all such triangles with perimeter n. EXAMPLE. n = 9
68 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 32 SOLUTION IDEA. Determine the generating function T (x, y, z; q) := x a y b z c q a+b+c. c b a 1, s.t. a+b>c Then all Polya triangles are given by the coefficient of z n in T (x, y, z; 1), and the total number of such triangles as the coefficient of z n in T (1, 1, z; 1).
69 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 33 SOLUTION IDEA. Determine the generating function T (x, y, z; q) := x a y b z c q a+b+c. c b a 1, s.t. a+b>c Then all triangles with given perimeter n are given by the coefficient of q n in T (x, y, z; q), and the total number of such triangles as the coefficient of q n in T (1, 1, 1; q).
70 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 34 HOW TO FIND A SUITABLE REPRESENTATION OF T (x, y, z; q) := x a y b z c q a+b+c? c b a 1, s.t. a+b>c Pick up the Omega package, freely available at and do the following:
71 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 34 HOW TO FIND A SUITABLE REPRESENTATION OF T (x, y, z; q) := x a y b z c q a+b+c? c b a 1, s.t. a+b>c Pick up the Omega package, freely available at and do the following: Omega Package by Axel Riese (in cooperation with George E. Andrews and Peter Paule) - c RISC, JKU Linz - V 2.47
72 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 34 HOW TO FIND A SUITABLE REPRESENTATION OF T (x, y, z; q) := x a y b z c q a+b+c? c b a 1, s.t. a+b>c Pick up the Omega package, freely available at and do the following: Omega Package by Axel Riese (in cooperation with George E. Andrews and Peter Paule) - c RISC, JKU Linz - V 2.47
73 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 35
74 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 35 WHAT STANDS BEHIND THIS?
75 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 35 WHAT STANDS BEHIND THIS? MacMahon s Partition Analysis
76 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 36 The no. of partitions of N of the form N = b b n satisfying b n n b n 1 n 1 b 2 2 b equals the no. of partitions of N into odd parts each 2n 1. This problem cried out for MacMahon s Partition Analysis,...
77 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 36 The no. of partitions of N of the form N = b b n satisfying b n n b n 1 n 1 b 2 2 b equals the no. of partitions of N into odd parts each 2n 1. This problem cried out for MacMahon s Partition Analysis,... Given that Partition Analysis is an algorithm for producing partition generating functions, I was able to convince Peter Paule and Axel Riese to join an effort to automate this algorithm.
78 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 37 How Zeilberger tells the story of partition analysis (and more):
79 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 38 MacMahon s Omega Calculus: T (x, y, z; q) := = Ω c b a 1, s.t. a+b>c a,b,c 1 x a y b z c q a+b+c l b a 1 l c b 2 l a+b 1 c 3 x a y b z c q a+b+c
80 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 38 MacMahon s Omega Calculus: T (x, y, z; q) := = Ω c b a 1, s.t. a+b>c a,b,c 1 x a y b z c q a+b+c l b a 1 l c b 2 l a+b 1 c 3 x a y b z c q a+b+c
81 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 39 The second step is the elimination of the slack variables:
82 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 39 The second step is the elimination of the slack variables: NOTE. To this end, MacMahon used elimination rules like Ω l k (1 A l) ( 1 B l ) = A k (1 A)(1 A B), k 0.
83 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 40 GENERAL THEME: linear Diophantine constraints Find b 1,... b n N such that c 1,1 c 1,n c 2,1 c 2,n..... c m,1 c m,n c 1 1 c 2 b.. b n c m
84 Combinatorics, Modular Functions, and Computer Algebra / Partition Analysis 40 GENERAL THEME: linear Diophantine constraints Find b 1,... b n N such that c 1,1 c 1,n c 2,1 c 2,n..... c m,1 c m,n c 1 1 c 2 b. =. b n c m New algorithm by F. Breuer & Z. Zafeirakopolous [arxiv: ] The new algorithm Polyhedral Omega solves linear Diophantine systems by combining methods from partition analysis with methods from polyhedral geometry as Brion decompositions and Barvinok s short rational function representations.
85 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 41 Omega Discovery
86 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 42 MacMahon s plane partitions, e.g., of n = 3: 3, 2 + 1, 2 + 1, , ,
87 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 42 MacMahon s plane partitions, e.g., of n = 3: 3, 2 + 1, 2 + 1, , , More generally, one can consider digraphs (resp. posets) like a 2 a 5 a 8 P = a 1 a 4 a 7 a 10 a 3 a 6 a 9.
88 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 42 MacMahon s plane partitions, e.g., of n = 3: 3, 2 + 1, 2 + 1, , , More generally, one can consider digraphs (resp. posets) like a 2 a 5 a 8 P = a 1 a 4 a 7 a 10 a 3 a 6 a 9 together with the associated generating functions; here: f(q) := q a 1+ +a 10. a 1,...,a 10 N s.t. P.
89 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 43 a 1 a 3 a 5 a 7 a 2k 1 a 2k a 2k a 2 a 4 a 6 a 2k a 2k 2 A k-elongated partition diamond of length 1 a 1 a a 2k+2 a 4k a 2 a 2k+1 a 2k+4 a 2k a 2k+3 a 4k+2 a 4k+1 a (2k+1)n a (2k+1)n 1 a (2k+1)n+1 A k-elongated partition diamond of length n
90 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 44 Generating function for k-elongated diamonds of length n: h n,k (q) = n 1 j=0 (1 + q(2k+1)j+2 )(1 + q (2k+1)j+4 ) (1 + q (2k+1)j+2k ) (2k+1)n+1 j=1 (1 q j ) Andrews great idea: delete the source:
91 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 44 Generating function for k-elongated diamonds of length n: h n,k (q) = n 1 j=0 (1 + q(2k+1)j+2 )(1 + q (2k+1)j+4 ) (1 + q (2k+1)j+2k ) (2k+1)n+1 j=1 (1 q j ) Andrews great idea: delete the source: h n,k (q) = n 1 j=0 (1 + q(2k+1)j+1 )(1 + q (2k+1)j+3 ) (1 + q (2k+1)j+2k 1 ) (2k+1)n j=1 (1 q j ) and glue the diamonds together:
92 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 44 Generating function for k-elongated diamonds of length n: h n,k (q) = n 1 j=0 (1 + q(2k+1)j+2 )(1 + q (2k+1)j+4 ) (1 + q (2k+1)j+2k ) (2k+1)n+1 j=1 (1 q j ) Andrews great idea: delete the source: h n,k (q) = n 1 j=0 (1 + q(2k+1)j+1 )(1 + q (2k+1)j+3 ) (1 + q (2k+1)j+2k 1 ) (2k+1)n j=1 (1 q j ) and glue the diamonds together: b (2k+1)n+1 b (2k+1)n b 2k+1 b 7 b b 2k b 6 b (2k+1)n 1 b 2k b 5 b 4 a 1 b 2 a a 2k+2... a (2k+1)n a 2 a 2k+1 a 2k a (2k+1)n a (2k+1)n 1 A broken k-diamond of length 2n
93 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 45 Consequently, m=0 k (m)q m := lim n h n,k(q) h n,k (q) = j=1 (1 q 2j )(1 q (2k+1)j ) (1 q j ) 3 (1 q (4k+2)j ) = E(q2 )E(q 2k+1 ) E(q) 3 E(q 4k+2 )
94 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 45 Consequently, m=0 k (m)q m := lim n h n,k(q) h n,k (q) = and think of Ramanujan! j=1 (1 q 2j )(1 q (2k+1)j ) (1 q j ) 3 (1 q (4k+2)j ) = E(q2 )E(q 2k+1 ) E(q) 3 E(q 4k+2 ) b (2k+1)n+1 b (2k+1)n b 2k+1 b 7 b b 2k b 6 b (2k+1)n 1 b 2k b 5 b 4 a 1 b 2 a a 2k+2... a (2k+1)n a 2 a 2k+1 a 2k a (2k+1)n a (2k+1)n 1 A broken k-diamond of length 2n
95 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 46
96 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 47 Theorem. For all n N, 1 (2n + 1) 0 (mod 3).
97 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 47 Theorem. For all n N, 1 (2n + 1) 0 (mod 3). Proof. Because of (1 q j ) 3 1 q 3j (mod 3), 1 (m)q m (1 q 2j )(1 q 3j ) = (1 q j ) 3 (1 q 6j ) m=0 j=1 j=1 (1 q 2j )(1 q 3j ) (1 q 3j )(1 q 6j ) (mod 3). Hence the coefficients of odd powers of q have to be zero.
98 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 48 Recall: Theorem. For all n N, 1 (2n + 1) 0 (mod 3). Algorithmic Proof [Radu 2014]:
99 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 48 Recall: Theorem. For all n N, 1 (2n + 1) 0 (mod 3). Algorithmic Proof [Radu 2014]: 1 (2n + 1)q n (1 q 2j ) 2 (1 q 6j ) 2 = 3 (1 q j ) 6 n=0 j=1
100 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 48 Recall: Theorem. For all n N, 1 (2n + 1) 0 (mod 3). Algorithmic Proof [Radu 2014]: 1 (2n + 1)q n (1 q 2j ) 2 (1 q 6j ) 2 = 3 (1 q j ) 6 n=0 j=1 NOTE. Human proof [Hirschhorn & Sellers, 2007]
101 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 49 NOTE. There is much more: many new families of combinatorial objects, q-series identities, and computer proofs and findings. Let us return to Ramanujan s congruence p(11n + 6) 0 (mod 11) :
102 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 50 Radu s Ramanujan-Kolberg package computes in M (22): E(q) 10 E(q 2 ) 2 E(q 11 ) 11 E(q 22 ) 22 p(11n + 6)q n with n=0 = q 14( 1078t t t t z 1 (187t t t 9581) +z 2 (11t t t 6754) )
103 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 50 Radu s Ramanujan-Kolberg package computes in M (22): E(q) 10 E(q 2 ) 2 E(q 11 ) 11 E(q 22 ) 22 p(11n + 6)q n with n=0 = q 14( 1078t t t t z 1 (187t t t 9581) +z 2 (11t t t 6754) ) t:= 3 88 w w w 3, z 1 := 5 88 w w w 3 3, z 2 := 1 44 w w w 3, where
104 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 50 Radu s Ramanujan-Kolberg package computes in M (22): E(q) 10 E(q 2 ) 2 E(q 11 ) 11 E(q 22 ) 22 p(11n + 6)q n with n=0 = q 14( 1078t t t t z 1 (187t t t 9581) +z 2 (11t t t 6754) ) t:= 3 88 w w w 3, z 1 := 5 88 w w w 3 3, z 2 := 1 44 w w w 3, where w 1 :=[ 3, 3, 7], w 2 :=[8, 4, 8], w 3 :=[1, 11, 11] E (22) and
105 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 50 Radu s Ramanujan-Kolberg package computes in M (22): E(q) 10 E(q 2 ) 2 E(q 11 ) 11 E(q 22 ) 22 p(11n + 6)q n with n=0 = q 14( 1078t t t t z 1 (187t t t 9581) +z 2 (11t t t 6754) ) t:= 3 88 w w w 3, z 1 := 5 88 w w w 3 3, z 2 := 1 44 w w w 3, where w 1 :=[ 3, 3, 7], w 2 :=[8, 4, 8], w 3 :=[1, 11, 11] E (22) and [a, b, c]:=q 5 E(q2 ) a E(q 11 ) b E(q 22 ) c E(q) a+b+c.
106 Combinatorics, Modular Functions, and Computer Algebra / Omega Discovery 51 References G.E. Andrews and P. Paule: MacMahon s Partition Analysis XI: Broken diamonds and modular forms. Acta Arithmetica 126 (2007), S. Radu: An Algorithmic Approach to Ramanujan-Kolberg Identities, Journal for Symbolic Computation 68 (2014), P. Paule and S. Radu: Partition Analysis, Modular Functions, and Computer Algebra. To appear in Recent Trends in Combinatorics, IMA Volume in Mathematics and its Applications, Springer, (Available at
107 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 52 RISC Software & Appls.
108 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 53 Software of the RISC Algorithmic Combinatorics Group Feel free to pick up packages!
109 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 54
110 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 55
111 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 56
112 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 57 Symbolic Summation in QFT JKU Collaboration with DESY (Berlin Zeuthen) (Deutsches Elektronen Synchrotron) Project leader: Partners: Carsten Schneider (RISC) Johannes Blümlein (DESY) Peter Paule (RISC)
113 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 58 Evaluation of Feynman diagrams Behavior of particles Φ(N, ɛ, x)dx Feynman integrals Evaluations required for the LHC experiment at CERN DESY processable by physicists simple sum expressions RISC (symbolic summation) f(n, ɛ, k) multi-sums
114 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 59 Challenges of the project About 1000 difficult Feynman diagrams have been treated so far Resources (some took 50 days of calculation time) About a million multi-sums have been simplified (most were double and triple sums) 9 full time employed researchers at RISC/DESY: J. Ablinger, A. Behring, J. Blümlein, A. Hasselhuhn, A. de Freitas, C. Raab, M. Round, C. Schneider, F. Wissbrock 4 up-to-date mainframe DESY computers at RISC + exploiting DESY s computer farms New computer algebra/special functions technologies (new/tuned algorithms, efficient implementations,...)
115 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 60 = F 3 (N)ε 3 + F 2 (N)ε 2 + F 1 (N)ε 1 + F 0 (N) Simplify N 3 j=0 j k=0 k (j+1 k+1)( k l)( N 1 [ j+n 3 l+n q 3 l+n q s 3 ( 1) j+k l+n q 3 l=0 q=0 s=1 r=0 j+2 )( j+n 3 q )( l+n q 3 s ) ( l+n q s 3 r )r!( l+n q r s 3)!(s 1)! ( l+n q 2)!( j+n 1)(N q r s 2)(q+s+1) 4S 1 ( j + N 1) 4S 1 ( j + N 2) 2S 1 (k) (S 1 ( l + N q 2) + S 1 ( l + N q r s 3) 2S 1 (r + s)) ] + 2S 1 (s 1) 2S 1 (r + s) + 3 further 6 fold sums
116 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 61 F 0 (N) = (using Sigma.m, EvaluateMultiSums.m and J. Ablinger s HarmonicSums.m package) 7 12 S 1(N) 4 + (17N + 5)S 1(N) 3 + ( 35N 2 2N 5 3N(N + 1) 2N 2 (N + 1) S 2(N) + 5( 1)N ) S1 2 2N 2 (N) 2 + ( 4(13N + 5) N 2 (N + 1) 2 + ( 4( 1)N (2N + 1) 13 ) S2 (N) + ( 29 N(N + 1) N 3 ) ( 1)N S 3 (N) + ( 2 + 2( 1) N ) S 2,1 (N) 28S 2,1 (N) + 20( 1)N ) S1 N 2 (N) + ( 3 (N + 1) 4 + ) ( 1)N S 2 (N) 2 2( 1) N S 2 (N) 2 ( 2(3N 5) + S 3 (N) N(N + 1) + ( ( 1) N ) S 1 (N) + 4( 1)N N + 1 ) S2 2N 2 (N) + S 2 (N) ( 10S 1 (N) 2 + ( 8( 1)N (2N + 1) N(N + 1) + ( ( 1)N (5 3N) 2N 2 5 (N + 1) 4(3N 1) ) + S1 (N) + 8( 1)N (3N + 1) N(N + 1) N(N + 1) 2 + ( ( 1) N ) 16 ) S 2 (N) N(N + 1) + ( ( 1)N (9N + 5) 29 ) S3 (N) + ( 19 N(N + 1) 3N 2 ) 2( 1)N S 4 (N) + ( 6 + 5( 1) N ) S 4 (N) + ( 2( 1)N (9N + 5) 2 N(N + 1) N 8( 1)N (2N + 1) + 4(9N + 1) N(N + 1) + 32S 2,1,1 (N) + ) S2,1 (N) + ( ( 1) N ) S 2, 2 (N) + ( ( 1) N ) S 3,1 S 2,1 (N) ( ( 1) N ) S 3,1 (N) + ( 3 5( 1) N ) S 2,1, ) ( 3 2 S 1(N) 2 3S 1(N) + 3 N 2 ( 1)N S 2 (N) ζ(2) )
117 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 61 F 0 (N) = (using Sigma.m, EvaluateMultiSums.m and J. Ablinger s HarmonicSums.m package) 7 12 S 1(N) 4 + (17N + 5)S 1(N) 3 + ( 35N 2 2N 5 3N(N + 1) 2N 2 (N + 1) S 2(N) + 5( 1)N ) S1 2 2N 2 (N) 2 + ( 4(13N + 5) N 2 (N + 1) 2 + ( 4( 1)N (2N + 1) 13 ) S2 (N) + ( 29 N(N + 1) N 3 ) ( 1)N S 3 (N) + ( 2 + 2( 1) N ) S 2,1 (N) 28S 2,1 (N) + 20( 1)N ) S1 N 2 (N) + ( 3 (N + 1) 4 + ) ( 1)N S 2 (N) 2 2( 1) N S 2 (N) 2 ( 2(3N 5) + S 3 (N) N(N + 1) + ( j ( 1) N ) S 1 (N) + 4( 1)N ) 1 N ( ( 1)N (5 3N) 2N 2 5 ) i S2 (N + 1) 2N 2 (N) + S 2 (N) ( k 10S 1 (N) 2 + ( 8( 1)N (2N + 1) ( 1) N(N + 1) 4(3N 1) ) N i k=1 1 ζ(2) = j k 2 + S1 + 8( 1)N (3N + 1) j=1 N(N + 1) N(N + 1) 2 + ( ( 1) N ) 16k=1) S 2,1,1 (N) = S 2 (N) N(N + 1) + ( ( 1)N (9N + 5) N(N + 1) 29 3N + ( 2( 1)N (9N + 5) 2 N(N + 1) N 8( 1)N (2N + 1) + 4(9N + 1) N(N + 1) + 32S 2,1,1 (N) + i 2 ) i=1 S3 (N) + ( 19 2 ) 2( 1)N S 4 (N) + ( 6 + 5( 1) N ) S 4 (N) ) S2,1 (N) + ( ( 1) N ) S 2, 2 (N) + ( ( 1) N ) S 3,1 S 2,1 (N) ( ( 1) N ) S 3,1 (N) + ( 3 5( 1) N ) S 2,1, ) ( 3 2 S 1(N) 2 3S 1(N) + 3 N 2 ( 1)N S 2 (N) ζ(2)
118 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 62 Symbolic Special Functions Manipulation: Application in Electromagnetic Wave Simulation Collaboration with company CST (Computer Simulation Technology) Partner: RISC: Joachim Schöberl (TU Vienna) Christoph Koutschan (now RICAM) Peter Paule
119 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 63
120 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 64
121 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 65
122 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 66
123 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 67 The RISC Software Company: the applied branch of RISC Industrial Applications CEO: Wolfgang Freiseisen 50 employees
124 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 68
125 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 69
126 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 70
127 Combinatorics, Modular Functions, and Computer Algebra / RISC Software & Appls. 71
128 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 72 Appendix: Subalgebra Membership Algorithm
129 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 73 Application: C-subalgebras of C[z] GIVEN: f 1, f 2, f 3 C[z] with t :=f 1 = z 6 + a z , FIND: g 1,..., g k C[z] such that f 2 = z 9 + b z , f 3 = z 20 + c z ; C[f 1, f 2, f 3 ] = g 1,..., g k C[t] = C[t] + C[t] g C[t] g k.
130 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 73 Application: C-subalgebras of C[z] GIVEN: f 1, f 2, f 3 C[z] with t :=f 1 = z 6 + a z , FIND: g 1,..., g k C[z] such that f 2 = z 9 + b z , f 3 = z 20 + c z ; C[f 1, f 2, f 3 ] = g 1,..., g k C[t] = C[t] + C[t] g C[t] g k. KEY IDEA: z n + = z u i+l 6 + = (z a i 9 +b i 20 + ) t l +.
131 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 74 KEY PROCEDURE GIVEN: f 1, f 2, f 3 C[z] with M = deg(f 1 ), deg(f 2 ), deg(f 3 ) = 6, 9, 20 ; select t := f 1 and define m := deg(t) = 6;
132 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 74 KEY PROCEDURE GIVEN: f 1, f 2, f 3 C[z] with M = deg(f 1 ), deg(f 2 ), deg(f 3 ) = 6, 9, 20 ; select t := f 1 and define m := deg(t) = 6; FIND: g 1,..., g 5 C[f 1, f 2, f 3 ] such that C[f 1, f 2, f 3 ] = C[t, f 2, f 3 ] = C[t, g 1,..., g 5 ] and {deg(g 1 ),..., deg(g 5 )} = {u 1,..., u 5 } {1,..., 5} (mod 6). How to determine the g i?
133 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 75 How to determine the g i? [M] 0 = {0, 6, 12,... }, and t :=f 1 = z 6 + a z 5 +. [M] 1 = { 1, 7, 13, 19, 25, 31, 37, 43, 49, 54,... }, define in view of u 1 = 49 = , g 1 :=f 2 f 2 3 = z u 1 +. [M] 2 = { 2, 8, 14, 20, 26,... }, define in view of u 2 = 20, g 2 :=f 3 = z u 2 +. [M] 3 = { 3, 9, 15,... }, define in view of u 3 = 9, g 3 :=f 2 = z u 3 +.
134 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 76 [M] 4 = { 4, 10, 16, 22, 28, 34, 40, 46,... }, define in view of u 4 = 40 = 2 20, g 4 :=f 2 3 = z u 4 +. [M] 5 = { 5, 11, 17, 23, 29, 35,... }, define in view of u 5 = 29 = , g 5 :=f 2 f 3 = z u 5 +.
135 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 76 [M] 4 = { 4, 10, 16, 22, 28, 34, 40, 46,... }, define in view of u 4 = 40 = 2 20, g 4 :=f 2 3 = z u 4 +. [M] 5 = { 5, 11, 17, 23, 29, 35,... }, define in view of u 5 = 29 = , g 5 :=f 2 f 3 = z u 5 +. SUMMARY. We determined the g i C[f 1, f 2, f 3 ] as g 1 := f 2 f3 2 = z u 1 +, g 2 := f 3 = z u 2 +, g 3 := f 2 = z u 3 +, g 4 := f3 2 = z u 4 +, g 5 := f 2 f 3 = z u 5 +, such that C[f 1, f 2, f 3 ] = C[t, g 1,... g 5 ] and deg(g i ) i (mod 6).
136 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 77 Example. f = z 62 + C[f 1, f 2, f 3 ]: 62 = = u ; recalling g 2 :=f 3 = z u 2 + one has, f g 2 t 7 = c 1 z = = u ; recalling g 1 :=f 2 f3 2 = zu 1 + one has, f g 2 t 7 c 1 g 1 t 2 = c 2 z BUT:
137 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 77 Example. f = z 62 + C[f 1, f 2, f 3 ]: 62 = = u ; recalling g 2 :=f 3 = z u 2 + one has, f g 2 t 7 = c 1 z = = u ; recalling g 1 :=f 2 f3 2 = zu 1 + one has, f g 2 t 7 c 1 g 1 t 2 = c 2 z BUT: For instance, it could be that f g 2 t 7 c 1 g 1 t 2 = z 4 + C[f 1, f 2, f 3 ].
138 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 78 Example (contd). f = z 62 + C[f 1, f 2, f 3 ]: For instance, it could be that f g 2 t 7 c 1 g 1 t 2 = z 4 + C[f 1, f 2, f 3 ]. NOTE. BUT 4 / 6, 9, 20 = deg(f 1 ), deg(f 2 ), deg(f 3 ) 4 deg(g) : g C[f 1, f 2, f 3 ]. SOLUTION.
139 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 78 Example (contd). f = z 62 + C[f 1, f 2, f 3 ]: For instance, it could be that f g 2 t 7 c 1 g 1 t 2 = z 4 + C[f 1, f 2, f 3 ]. NOTE. BUT 4 / 6, 9, 20 = deg(f 1 ), deg(f 2 ), deg(f 3 ) 4 deg(g) : g C[f 1, f 2, f 3 ]. SOLUTION. We repeat the KEY PROCEDURE {f 1, f 2, f 3 } {g 1, g 2, g 3, g 4, g 5 } by iteratively joining products: {g 1, g 2, g 3, g 4, g 5 } {g i g j } {h 1, h 2, h 3, h 4, h 5 }, {h 1, h 2, h 3, h 4, h 5 } {h i h j } {... }, a.s.o.
140 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 79 DECISION PROCEDURE: C-subalgebra membership GIVEN: f and f 1,..., f n from C[z]; FIND: polynomials p 0, p 1,..., p k C[z] such that f = p 0 (t) + p 1 (t) g p k (t) g k 1, g 1,..., g k C[t] = C[f 1,..., f n ] APPLICATION.
141 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 79 DECISION PROCEDURE: C-subalgebra membership GIVEN: f and f 1,..., f n from C[z]; FIND: polynomials p 0, p 1,..., p k C[z] such that f = p 0 (t) + p 1 (t) g p k (t) g k 1, g 1,..., g k C[t] = C[f 1,..., f n ] APPLICATION. With this procedure the right hand sides of Ramanujan identities can be found automatically: just apply it to given f M (N) and f 1,..., f n E (N). In this context, z = 1 q because of possible poles sitting at [ ]; the f j can be treated as formal Laurent series like f 1 = a 6 q 6 + a 5 q 5 +, f 2 = b 9 q 9 + b 8 q 8 +, f 3 = c 20 q 20 + c 19 +, etc. q19
142 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 80 Example. Radu s Ramanujan-Kolberg package in STEP 1 computes that: 1 E(q)8 q E(q 7 ) 7 p(7n + 5)q n M (7). n=0
143 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 80 Example. Radu s Ramanujan-Kolberg package in STEP 1 computes that: 1 E(q)8 q E(q 7 ) 7 p(7n + 5)q n M (7). n=0 In STEP 2 Radu s package determines that the monoid is generated by one element (recall f 1 = t): E (7) = f 1 = q 1 E(q)4 E(q 7 ) 4.
144 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 80 Example. Radu s Ramanujan-Kolberg package in STEP 1 computes that: 1 E(q)8 q E(q 7 ) 7 p(7n + 5)q n M (7). n=0 In STEP 2 Radu s package determines that the monoid is generated by one element (recall f 1 = t): E 1 E(q)4 (7) = f 1 = q E(q 7 ) 4. In STEP 3 the package determines the module presentation C[f 1,..., f n ] = C[f 1 ] = 1, g 1,..., g k C[t] = 1 C[f1 ].
145 Combinatorics, Modular Functions, and Computer Algebra / Appendix: Subalgebra Membership Algorithm 80 Example. Radu s Ramanujan-Kolberg package in STEP 1 computes that: 1 E(q)8 q E(q 7 ) 7 p(7n + 5)q n M (7). n=0 In STEP 2 Radu s package determines that the monoid is generated by one element (recall f 1 = t): E 1 E(q)4 (7) = f 1 = q E(q 7 ) 4. In STEP 3 the package determines the module presentation C[f 1,..., f n ] = C[f 1 ] = 1, g 1,..., g k C[t] = 1 C[f1 ]. In STEP 4 the package finds Ramanujan s identity: 1 E(q)8 q E(q 7 ) 7 p(7n + 5)q n = f 1. n=0
Combinatorics, Modular Forms, and Discrete Geometry
Combinatorics, Modular Forms, and Discrete Geometry / 1 Geometric and Enumerative Combinatorics, IMA University of Minnesota, Nov 10 14, 2014 Combinatorics, Modular Forms, and Discrete Geometry Peter Paule
More informationDedicated to our friend Krishna Alladi on his 60th birthday
A NEW WITNESS IDENTITY FOR 11 p(11n + 6) PETER PAULE AND CRISTIAN-SILVIU RADU Dedicated to our friend Krishna Alladi on his 60th birthday Abstract. Let p(n) be the number of partitions of the positive
More informationThe Rogers-Ramanujan Functions and Computer Algebra
Ramanujan Congruences / 1 Joint Mathematics Meetings AMS Special Session in honor of Dennis Stanton s 65th Birthday San Diego, Jan 10 13, 2018 The Rogers-Ramanujan Functions and Computer Algebra Peter
More informationINFINITE FAMILIES OF STRANGE PARTITION CONGRUENCES FOR BROKEN 2-DIAMONDS
December 1, 2009 INFINITE FAMILIES OF STRANGE PARTITION CONGRUENCES FOR BROKEN 2-DIAMONDS PETER PAULE AND SILVIU RADU Dedicated to our friend George E. Andrews on the occasion of his 70th birthday Abstract.
More informationSome congruences for Andrews Paule s broken 2-diamond partitions
Discrete Mathematics 308 (2008) 5735 5741 www.elsevier.com/locate/disc Some congruences for Andrews Paule s broken 2-diamond partitions Song Heng Chan Division of Mathematical Sciences, School of Physical
More informationPartition Congruences in the Spirit of Ramanujan
Partition Congruences in the Spirit of Ramanujan Yezhou Wang School of Mathematical Sciences University of Electronic Science and Technology of China yzwang@uestc.edu.cn Monash Discrete Mathematics Research
More informationPARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND (2k + 1) CORES
PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND 2k + CORES SILVIU RADU AND JAMES A. SELLERS Abstract. In this paper we prove several new parity results for broken k-diamond partitions introduced in
More informationCONGRUENCES MODULO SQUARES OF PRIMES FOR FU S k DOTS BRACELET PARTITIONS
CONGRUENCES MODULO SQUARES OF PRIMES FOR FU S k DOTS BRACELET PARTITIONS CRISTIAN-SILVIU RADU AND JAMES A SELLERS Dedicated to George Andrews on the occasion of his 75th birthday Abstract In 2007, Andrews
More informationINFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3
INFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3 SILVIU RADU AND JAMES A. SELLERS Abstract. In 2007, Andrews and Paule introduced the family of functions k n) which enumerate the number
More information20 The modular equation
18.783 Elliptic Curves Lecture #20 Spring 2017 04/26/2017 20 The modular equation In the previous lecture we defined modular curves as quotients of the extended upper half plane under the action of a congruence
More informationRamanujan-type congruences for broken 2-diamond partitions modulo 3
Progress of Projects Supported by NSFC. ARTICLES. SCIENCE CHINA Mathematics doi: 10.1007/s11425-014-4846-7 Ramanujan-type congruences for broken 2-diamond partitions modulo 3 CHEN William Y.C. 1, FAN Anna
More informationRamanujan-type Congruences for Broken 2-Diamond Partitions Modulo 3
Ramanujan-type Congruences for Broken 2-Diamond Partitions Modulo 3 William Y.C. Chen 1, Anna R.B. Fan 2 and Rebecca T. Yu 3 1,2,3 Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071,
More informationMacMahon s Partition Analysis VIII: Plane Partition Diamonds
MacMahon s Partition Analysis VIII: Plane Partition Diamonds George E. Andrews * Department of Mathematics The Pennsylvania State University University Park, PA 6802, USA E-mail: andrews@math.psu.edu Peter
More informationA Special Module in the Field of Modular Functions
A Special Module in the Field of Modular Functions Research Institute for Symbolic Computation (RISC), Johannes Kepler University, A-4040 Linz, Austria Dedicated to Peter Paule at the Occasion of his 60th
More informationDancing Samba with Ramanujan Partition Congruences
Dancing Samba with Ramanujan Partition Congruences Ralf Hemmecke 12-Jun-2016 Abstract The article presents an algorithm to compute a C[t]-module basis G for a given subalgebra A over a polynomial ring
More informationRamanujan s first letter to Hardy: 5 + = 1 + e 2π 1 + e 4π 1 +
Ramanujan s first letter to Hardy: e 2π/ + + 1 = 1 + e 2π 2 2 1 + e 4π 1 + e π/ 1 e π = 2 2 1 + 1 + e 2π 1 + Hardy: [These formulas ] defeated me completely. I had never seen anything in the least like
More information20 The modular equation
18.783 Elliptic Curves Spring 2015 Lecture #20 04/23/2015 20 The modular equation In the previous lecture we defined modular curves as quotients of the extended upper half plane under the action of a congruence
More informationMACMAHON S PARTITION ANALYSIS IX: k-gon PARTITIONS
MACMAHON S PARTITION ANALYSIS IX: -GON PARTITIONS GEORGE E. ANDREWS, PETER PAULE, AND AXEL RIESE Dedicated to George Szeeres on the occasion of his 90th birthday Abstract. MacMahon devoted a significant
More informationCongruence Properties of Partition Function
CHAPTER H Congruence Properties of Partition Function Congruence properties of p(n), the number of partitions of n, were first discovered by Ramanujan on examining the table of the first 200 values of
More informationNew Congruences for Broken k-diamond Partitions
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.5.8 New Congruences for Broken k-diamond Partitions Dazhao Tang College of Mathematics and Statistics Huxi Campus Chongqing University
More informationSuper congruences involving binomial coefficients and new series for famous constants
Tal at the 5th Pacific Rim Conf. on Math. (Stanford Univ., 2010 Super congruences involving binomial coefficients and new series for famous constants Zhi-Wei Sun Nanjing University Nanjing 210093, P. R.
More informationPARTITIONS AND (2k + 1) CORES. 1. Introduction
PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND 2k + CORES SILVIU RADU AND JAMES A. SELLERS Abstract. In this aer we rove several new arity results for broken k-diamond artitions introduced in 2007
More informationCongruence Subgroups
Congruence Subgroups Undergraduate Mathematics Society, Columbia University S. M.-C. 24 June 2015 Contents 1 First Properties 1 2 The Modular Group and Elliptic Curves 3 3 Modular Forms for Congruence
More informationRAMANUJAN S MOST BEAUTIFUL IDENTITY
RAMANUJAN S MOST BEAUTIFUL IDENTITY MICHAEL D. HIRSCHHORN Abstract We give a simple proof of the identity which for Hardy represented the best of Ramanujan. On the way, we give a new proof of an important
More informationarxiv: v1 [math.co] 8 Sep 2017
NEW CONGRUENCES FOR BROKEN k-diamond PARTITIONS DAZHAO TANG arxiv:170902584v1 [mathco] 8 Sep 2017 Abstract The notion of broken k-diamond partitions was introduced by Andrews and Paule Let k (n) denote
More informationMock and quantum modular forms
Mock and quantum modular forms Amanda Folsom (Amherst College) 1 Ramanujan s mock theta functions 2 Ramanujan s mock theta functions 1887-1920 3 Ramanujan s mock theta functions 1887-1920 4 History S.
More informationComputer Algebra Algorithms for Special Functions in Particle Physics.
Computer Algebra Algorithms for Special Functions in Particle Physics. Jakob Ablinger RISC, J. Kepler Universität Linz, Austria joint work with J. Blümlein (DESY) and C. Schneider (RISC) 7. Mai 2012 Definition
More informationcongruences Shanghai, July 2013 Simple proofs of Ramanujan s partition congruences Michael D. Hirschhorn
s s m.hirschhorn@unsw.edu.au Let p(n) be the number of s of n. For example, p(4) = 5, since we can write 4 = 4 = 3+1 = 2+2 = 2+1+1 = 1+1+1+1 and there are 5 such representations. It was known to Euler
More informationCongruences for Fishburn numbers modulo prime powers
Congruences for Fishburn numbers modulo prime powers Partitions, q-series, and modular forms AMS Joint Mathematics Meetings, San Antonio January, 205 University of Illinois at Urbana Champaign ξ(3) = 5
More informationAddition sequences and numerical evaluation of modular forms
Addition sequences and numerical evaluation of modular forms Fredrik Johansson (INRIA Bordeaux) Joint work with Andreas Enge (INRIA Bordeaux) William Hart (TU Kaiserslautern) DK Statusseminar in Strobl,
More information#A22 INTEGERS 17 (2017) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS
#A22 INTEGERS 7 (207) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS Shane Chern Department of Mathematics, Pennsylvania State University, University Park, Pennsylvania shanechern@psu.edu Received: 0/6/6,
More informationARITHMETIC OF THE 13-REGULAR PARTITION FUNCTION MODULO 3
ARITHMETIC OF THE 13-REGULAR PARTITION FUNCTION MODULO 3 JOHN J WEBB Abstract. Let b 13 n) denote the number of 13-regular partitions of n. We study in this paper the behavior of b 13 n) modulo 3 where
More informationApplications of modular forms to partitions and multipartitions
Applications of modular forms to partitions and multipartitions Holly Swisher Oregon State University October 22, 2009 Goal The goal of this talk is to highlight some applications of the theory of modular
More informationSOME CONGRUENCES FOR PARTITIONS THAT ARE p-cores. Frank G. Garvan
SOME CONGRUENCES FOR PARTITIONS THAT ARE p-cores Frank G. Garvan Department of Mathematics Statistics & Computing Science Dalhousie University Halifax, Nova Scotia Canada B3H 3J5 October 18, 1991 Abstract.
More information4-Shadows in q-series and the Kimberling Index
4-Shadows in q-series and the Kimberling Index By George E. Andrews May 5, 206 Abstract An elementary method in q-series, the method of 4-shadows, is introduced and applied to several poblems in q-series
More informationSingular Overpartitions
Singular Overpartitions George E. Andrews Dedicated to the memory of Paul Bateman and Heini Halberstam. Abstract The object in this paper is to present a general theorem for overpartitions analogous to
More informationIntroduction to modular forms Perspectives in Mathematical Science IV (Part II) Nagoya University (Fall 2018)
Introduction to modular forms Perspectives in Mathematical Science IV (Part II) Nagoya University (Fall 208) Henrik Bachmann (Math. Building Room 457, henrik.bachmann@math.nagoya-u.ac.jp) Lecture notes
More informationCONGRUENCES MODULO 2 FOR CERTAIN PARTITION FUNCTIONS
Bull. Aust. Math. Soc. 9 2016, 400 409 doi:10.1017/s000497271500167 CONGRUENCES MODULO 2 FOR CERTAIN PARTITION FUNCTIONS M. S. MAHADEVA NAIKA, B. HEMANTHKUMAR H. S. SUMANTH BHARADWAJ Received 9 August
More informationS ps S qs S rs S 0s. N pqr = s. S 2 2g
On generalizations of Verlinde's formula P. Bantay Inst. for Theor. Phys., Eotvos Univ. July, 000 Abstract It is shown that traces of mapping classes of finite order may be expressed by Verlinde-like formulae.
More informationPARITY OF THE PARTITION FUNCTION. (Communicated by Don Zagier)
ELECTRONIC RESEARCH ANNOUNCEMENTS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 1, Issue 1, 1995 PARITY OF THE PARTITION FUNCTION KEN ONO (Communicated by Don Zagier) Abstract. Let p(n) denote the number
More informationApéry Numbers, Franel Numbers and Binary Quadratic Forms
A tal given at Tsinghua University (April 12, 2013) and Hong Kong University of Science and Technology (May 2, 2013) Apéry Numbers, Franel Numbers and Binary Quadratic Forms Zhi-Wei Sun Nanjing University
More informationCONGRUENCES FOR POWERS OF THE PARTITION FUNCTION
CONGRUENCES FOR POWERS OF THE PARTITION FUNCTION MADELINE LOCUS AND IAN WAGNER Abstract. Let p tn denote the number of partitions of n into t colors. In analogy with Ramanujan s work on the partition function,
More informationPARITY OF THE COEFFICIENTS OF KLEIN S j-function
PARITY OF THE COEFFICIENTS OF KLEIN S j-function CLAUDIA ALFES Abstract. Klein s j-function is one of the most fundamental modular functions in number theory. However, not much is known about the parity
More informationRepresenting numbers as the sum of squares and powers in the ring Z n
Representing numbers as the sum of squares powers in the ring Z n Rob Burns arxiv:708.03930v2 [math.nt] 23 Sep 207 26th September 207 Abstract We examine the representation of numbers as the sum of two
More informationRelations. Binary Relation. Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation. Let R A B be a relation from A to B.
Relations Binary Relation Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation Let R A B be a relation from A to B. If (a, b) R, we write a R b. 1 Binary Relation Example:
More informationDIVISIBILITY PROPERTIES OF THE 5-REGULAR AND 13-REGULAR PARTITION FUNCTIONS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A60 DIVISIBILITY PROPERTIES OF THE 5-REGULAR AND 13-REGULAR PARTITION FUNCTIONS Neil Calkin Department of Mathematical Sciences, Clemson
More informationTwists and residual modular Galois representations
Twists and residual modular Galois representations Samuele Anni University of Warwick Building Bridges, Bristol 10 th July 2014 Modular curves and Modular Forms 1 Modular curves and Modular Forms 2 Residual
More informationECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationEngel Expansions of q-series by Computer Algebra
Engel Expansions of q-series by Computer Algebra George E. Andrews Department of Mathematics The Pennsylvania State University University Park, PA 6802, USA andrews@math.psu.edu Arnold Knopfmacher The
More informationModular Forms, Elliptic Curves, and Modular Curves
1 Modular Forms, Elliptic Curves, and Modular Curves This chapter introduces three central objects of the book. Modular forms are functions on the complex upper half plane. A matrix group called the modular
More informationCONGRUENCES FOR BROKEN k-diamond PARTITIONS
CONGRUENCES FOR BROKEN k-diamond PARTITIONS MARIE JAMESON Abstract. We prove two conjectures of Paule and Radu from their recent paper on broken k-diamond partitions. 1. Introduction and Statement of Results
More informationModular forms, combinatorially and otherwise
Modular forms, combinatorially and otherwise p. 1/103 Modular forms, combinatorially and otherwise David Penniston Sums of squares Modular forms, combinatorially and otherwise p. 2/103 Modular forms, combinatorially
More informationq-binomial coefficient congruences
CARMA Analysis and Number Theory Seminar University of Newcastle August 23, 2011 Tulane University, New Orleans 1 / 35 Our first -analogs The natural number n has the -analog: [n] = n 1 1 = 1 + +... n
More informationarxiv: v1 [math.nt] 7 Oct 2009
Congruences for the Number of Cubic Partitions Derived from Modular Forms arxiv:0910.1263v1 [math.nt] 7 Oct 2009 William Y.C. Chen 1 and Bernard L.S. Lin 2 Center for Combinatorics, LPMC-TJKLC Nankai University,
More information= i 0. a i q i. (1 aq i ).
SIEVED PARTITIO FUCTIOS AD Q-BIOMIAL COEFFICIETS Fran Garvan* and Dennis Stanton** Abstract. The q-binomial coefficient is a polynomial in q. Given an integer t and a residue class r modulo t, a sieved
More informationEXERCISES IN MODULAR FORMS I (MATH 726) (2) Prove that a lattice L is integral if and only if its Gram matrix has integer coefficients.
EXERCISES IN MODULAR FORMS I (MATH 726) EYAL GOREN, MCGILL UNIVERSITY, FALL 2007 (1) We define a (full) lattice L in R n to be a discrete subgroup of R n that contains a basis for R n. Prove that L is
More informationSOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ω(q) AND ν(q) S.N. Fathima and Utpal Pore (Received October 13, 2017)
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 47 2017), 161-168 SOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ωq) AND νq) S.N. Fathima and Utpal Pore Received October 1, 2017) Abstract.
More informationSpringer Proceedings in Mathematics & Statistics. Volume 226
Springer Proceedings in Mathematics & Statistics Volume 226 Springer Proceedings in Mathematics & Statistics This book series features volumes composed of selected contributions from workshops and conferences
More informationA PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES
A PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES MATTHEW S. MIZUHARA, JAMES A. SELLERS, AND HOLLY SWISHER Abstract. Ramanujan s celebrated congruences of the partition function p(n have inspired a vast
More informationCONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)
CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit, and Yee introduced partition
More informationIN POSITIVE CHARACTERISTICS: 3. Modular varieties with Hecke symmetries. 7. Foliation and a conjecture of Oort
FINE STRUCTURES OF MODULI SPACES IN POSITIVE CHARACTERISTICS: HECKE SYMMETRIES AND OORT FOLIATION 1. Elliptic curves and their moduli 2. Moduli of abelian varieties 3. Modular varieties with Hecke symmetries
More informationThe part-frequency matrices of a partition
J. Algebra Comb. Discrete Appl. 3(3) 77 86 Received: 03 November 20 Accepted: 04 January 206 Journal of Algebra Combinatorics Discrete Structures and Applications The part-frequency matrices of a partition
More informationOn the zeros of certain modular forms
On the zeros of certain modular forms Masanobu Kaneko Dedicated to Professor Yasutaka Ihara on the occasion of his 60th birthday. The aim of this short note is to list several families of modular forms
More informationNEW IDENTITIES INVOLVING SUMS OF THE TAILS RELATED TO REAL QUADRATIC FIELDS KATHRIN BRINGMANN AND BEN KANE
NEW IDENTITIES INVOLVING SUMS OF THE TAILS RELATED TO REAL QUADRATIC FIELDS KATHRIN BRINGMANN AND BEN KANE To George Andrews, who has been a great inspiration, on the occasion of his 70th birthday Abstract.
More informationp-adic families of modular forms
April 3, 2009 Plan Background and Motivation Lecture 1 Background and Motivation Overconvergent p-adic modular forms The canonical subgroup and the U p operator Families of p-adic modular forms - Strategies
More informationElliptic multiple zeta values
and special values of L-functions Nils Matthes Fachbereich Mathematik Universität Hamburg 21.12.16 1 / 30 and special values of L-functions Introduction Common theme in number theory/arithmetic geometry:
More informationTHE ANDREWS-STANLEY PARTITION FUNCTION AND p(n): CONGRUENCES
THE ANDREWS-STANLEY PARTITION FUNCTION AND pn: CONGRUENCES HOLLY SWISHER Abstract R Stanley formulated a partition function tn which counts the number of partitions π for which the number of odd parts
More informationCongruences for Fishburn numbers modulo prime powers
Congruences for Fishburn numbers modulo prime powers Armin Straub Department of Mathematics University of Illinois at Urbana-Champaign July 16, 2014 Abstract The Fishburn numbers ξ(n) are defined by the
More informationElliptic Curves & Number Theory. R. Sujatha School of Mathematics TIFR
Elliptic Curves & Number Theory R. Sujatha School of Mathematics TIFR Aim: To explain the connection between a simple ancient problem in number theory and a deep sophisticated conjecture about Elliptic
More informationConstructing Class invariants
Constructing Class invariants Aristides Kontogeorgis Department of Mathematics University of Athens. Workshop Thales 1-3 July 2015 :Algebraic modeling of topological and computational structures and applications,
More informationCONGRUENCES FOR BERNOULLI - LUCAS SUMS
CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the
More informationGeneralised Rogers Ramanujan identities and arithmetics. Ole Warnaar School of Mathematics and Physics
Generalised Rogers Ramanujan identities and arithmetics Ole Warnaar School of Mathematics and Physics Based on joint work with Nick Bartlett Michael Griffin Ken Ono Eric Rains History and motivation The
More informationElementary proofs of congruences for the cubic and overcubic partition functions
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 602) 204), Pages 9 97 Elementary proofs of congruences for the cubic and overcubic partition functions James A. Sellers Department of Mathematics Penn State
More informationArithmetic properties of overcubic partition pairs
Arithmetic properties of overcubic partition pairs Bernard L.S. Lin School of Sciences Jimei University Xiamen 3101, P.R. China linlsjmu@13.com Submitted: May 5, 014; Accepted: Aug 7, 014; Published: Sep
More informationContext-free languages in Algebraic Geometry and Number Theory
Context-free languages in Algebraic Geometry and Number Theory Ph.D. student Laboratoire de combinatoire et d informatique mathématique (LaCIM) Université du Québec à Montréal (UQÀM) Presentation at the
More informationCHAPTER 1 POLYNOMIALS
1 CHAPTER 1 POLYNOMIALS 1.1 Removing Nested Symbols of Grouping Simplify. 1. 4x + 3( x ) + 4( x + 1). ( ) 3x + 4 5 x 3 + x 3. 3 5( y 4) + 6 y ( y + 3) 4. 3 n ( n + 5) 4 ( n + 8) 5. ( x + 5) x + 3( x 6)
More informationq-series IDENTITIES AND VALUES OF CERTAIN L-FUNCTIONS Appearing in the Duke Mathematical Journal.
q-series IDENTITIES AND VALUES OF CERTAIN L-FUNCTIONS George E. Andrews, Jorge Jiménez-Urroz and Ken Ono Appearing in the Duke Mathematical Journal.. Introduction and Statement of Results. As usual, define
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationAN ARITHMETIC FORMULA FOR THE PARTITION FUNCTION
AN ARITHMETIC FORMULA FOR THE PARTITION FUNCTION KATHRIN BRINGMANN AND KEN ONO 1 Introduction and Statement of Results A partition of a non-negative integer n is a non-increasing sequence of positive integers
More informationDifference Equation on Quintuple Products and Ramanujan s Partition Congruence p(11n +6) 0 (mod 11)
International Mathematical Forum, 5, 2010, no 31, 1533-1539 Difference Equation on Quintuple Products and Ramanujan s Partition Congruence p(11n +6) 0 (mod 11) Qinglun Yan 1, Xiaona Fan and Jing Fu College
More informationRamanujan-type congruences for overpartitions modulo 16. Nankai University, Tianjin , P. R. China
Ramanujan-type congruences for overpartitions modulo 16 William Y.C. Chen 1,2, Qing-Hu Hou 2, Lisa H. Sun 1,2 and Li Zhang 1 1 Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P.
More informationOn an identity of Gessel and Stanton and the new little Göllnitz identities
On an identity of Gessel and Stanton and the new little Göllnitz identities Carla D. Savage Dept. of Computer Science N. C. State University, Box 8206 Raleigh, NC 27695, USA savage@csc.ncsu.edu Andrew
More information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
More informationarxiv: v1 [math.co] 21 Sep 2015
Chocolate Numbers arxiv:1509.06093v1 [math.co] 21 Sep 2015 Caleb Ji, Tanya Khovanova, Robin Park, Angela Song September 22, 2015 Abstract In this paper, we consider a game played on a rectangular m n gridded
More informationCOMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES
COMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES James McLaughlin Department of Mathematics, West Chester University, West Chester, PA 9383, USA jmclaughl@wcupa.edu Andrew V. Sills Department of Mathematical
More informationPolynomial analogues of Ramanujan congruences for Han s hooklength formula
Polynomial analogues of Ramanujan congruences for Han s hooklength formula William J. Keith CELC, University of Lisbon Email: william.keith@gmail.com Detailed arxiv preprint: 1109.1236 Context Partition
More informationCOMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES. James McLaughlin Department of Mathematics, West Chester University, West Chester, PA 19383, USA
COMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES James McLaughlin Department of Mathematics, West Chester University, West Chester, PA 9383, USA jmclaughl@wcupa.edu Andrew V. Sills Department of Mathematical
More informationThesis submitted in partial fulfillment of the requirement for The award of the degree of. Masters of Science in Mathematics and Computing
SOME n-color COMPOSITION Thesis submitted in partial fulfillment of the requirement for The award of the degree of Masters of Science in Mathematics and Computing Submitted by Shelja Ratta Roll no- 301203014
More informationPolygonal Numbers, Primes and Ternary Quadratic Forms
Polygonal Numbers, Primes and Ternary Quadratic Forms Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun August 26, 2009 Modern number theory has
More informationFORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS
Sairaiji, F. Osaka J. Math. 39 (00), 3 43 FORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS FUMIO SAIRAIJI (Received March 4, 000) 1. Introduction Let be an elliptic curve over Q. We denote by ˆ
More informationA RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES
#A63 INTEGERS 1 (01) A RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES Brandt Kronholm Department of Mathematics, Whittier College, Whittier,
More informationTHE RAMANUJAN-SERRE DIFFERENTIAL OPERATORS AND CERTAIN ELLIPTIC CURVES. (q = e 2πiτ, τ H : the upper-half plane) ( d 5) q n
THE RAMANUJAN-SERRE DIFFERENTIAL OPERATORS AND CERTAIN ELLIPTIC CURVES MASANOBU KANEKO AND YUICHI SAKAI Abstract. For several congruence subgroups of low levels and their conjugates, we derive differential
More informationCOMPUTING THE INTEGER PARTITION FUNCTION
MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000 000 S 005-578(XX)0000-0 COMPUTING THE INTEGER PARTITION FUNCTION NEIL CALKIN, JIMENA DAVIS, KEVIN JAMES, ELIZABETH PEREZ, AND CHARLES SWANNACK
More informationRamanujan-Slater Type Identities Related to the Moduli 18 and 24
Ramanujan-Slater Type Identities Related to the Moduli 18 and 24 James McLaughlin Department of Mathematics, West Chester University, West Chester, PA; telephone 610-738-0585; fax 610-738-0578 Andrew V.
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS
Bull Aust Math Soc 81 (2010), 58 63 doi:101017/s0004972709000525 ELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS MICHAEL D HIRSCHHORN and JAMES A SELLERS (Received 11 February 2009) Abstract
More informationThe arithmetic geometric mean (Agm)
The arithmetic geometric mean () Pictures by David Lehavi This is part of exercise 5 question 4 in myc> calculus class Fall 200: a = c a n+ =5a n 2 lim n an = a = a an + bn a n+ = 2 b = b b n+ = a nb n
More informationAN ARITHMETIC FORMULA FOR THE PARTITION FUNCTION
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 135, Number 11, November 007, Pages 3507 3514 S 000-9939(07)08883-1 Article electronically published on July 7, 007 AN ARITHMETIC FORMULA FOR THE
More informationInteger Partitions With Even Parts Below Odd Parts and the Mock Theta Functions
Integer Partitions With Even Parts Below Odd Parts and the Mock Theta Functions by George E. Andrews Key Words: Partitions, mock theta functions, crank AMS Classification Numbers: P84, P83, P8, 33D5 Abstract
More informationREGULAR TETRAHEDRA WHOSE VERTICES HAVE INTEGER COORDINATES. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXX, 2 (2011), pp. 161 170 161 REGULAR TETRAHEDRA WHOSE VERTICES HAVE INTEGER COORDINATES E. J. IONASCU Abstract. In this paper we introduce theoretical arguments for
More information