Applications of modular forms to partitions and multipartitions

Similar documents
THE ANDREWS-STANLEY PARTITION FUNCTION AND p(n): CONGRUENCES

ARITHMETIC OF THE 13-REGULAR PARTITION FUNCTION MODULO 3

DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS

Modular forms, combinatorially and otherwise

CONGRUENCES FOR POWERS OF THE PARTITION FUNCTION

Divisibility of the 5- and 13-regular partition functions

DIVISIBILITY PROPERTIES OF THE 5-REGULAR AND 13-REGULAR PARTITION FUNCTIONS

CONGRUENCE PROPERTIES FOR THE PARTITION FUNCTION. Department of Mathematics Department of Mathematics. Urbana, Illinois Madison, WI 53706

NON-VANISHING OF THE PARTITION FUNCTION MODULO SMALL PRIMES

A Motivated Introduction to Modular Forms

A PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES

NON-CONJUGATE, ROOK EQUIVALENT t-cores

PARITY OF THE PARTITION FUNCTION. (Communicated by Don Zagier)

Congruences for the Coefficients of Modular Forms and Applications to Number Theory

HECKE OPERATORS ON CERTAIN SUBSPACES OF INTEGRAL WEIGHT MODULAR FORMS.

SOME RECURRENCES FOR ARITHMETICAL FUNCTIONS. Ken Ono, Neville Robbins, Brad Wilson. Journal of the Indian Mathematical Society, 62, 1996, pages

Congruences for Fishburn numbers modulo prime powers

CHIRANJIT RAY AND RUPAM BARMAN

PARITY OF THE COEFFICIENTS OF KLEIN S j-function

Hecke-Operators. Alex Maier. 20th January 2007

#A22 INTEGERS 17 (2017) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS

CONGRUENCES FOR BROKEN k-diamond PARTITIONS

Ramanujan-type Congruences for Broken 2-Diamond Partitions Modulo 3

THE ARITHMETIC OF BORCHERDS EXPONENTS. Jan H. Bruinier and Ken Ono

ON THE POSITIVITY OF THE NUMBER OF t CORE PARTITIONS. Ken Ono. 1. Introduction

Introduction to Modular Forms

Congruences of Multipartition Functions Modulo Powers of Primes

Spaces of Weakly Holomorphic Modular Forms in Level 52. Daniel Meade Adams

Ramanujan-type congruences for broken 2-diamond partitions modulo 3

Scott Ahlgren and Ken Ono. At first glance the stuff of partitions seems like child s play: 4 = = = =

Congruence Subgroups

Addition and Counting: The Arithmetic of Partitions

ON PARTITION FUNCTIONS OF ANDREWS AND STANLEY

Ramanujan s first letter to Hardy: 5 + = 1 + e 2π 1 + e 4π 1 +

arxiv: v1 [math.nt] 7 Oct 2009

THE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5

Polynomial analogues of Ramanujan congruences for Han s hooklength formula

Cusp forms and the Eichler-Shimura relation

The part-frequency matrices of a partition

DEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS. George E. Andrews and Ken Ono. February 17, Introduction and Statement of Results

( 1) m q (6m+1)2 24. (Γ 1 (576))

LINEAR RELATIONS BETWEEN MODULAR FORM COEFFICIENTS AND NON-ORDINARY PRIMES

Basic Background on Mock Modular Forms and Weak Harmonic Maass Forms

RANK AND CONGRUENCES FOR OVERPARTITION PAIRS

Partition Congruences in the Spirit of Ramanujan

FERMAT S WORLD A TOUR OF. Outline. Ching-Li Chai. Philadelphia, March, Samples of numbers. 2 More samples in arithemetic. 3 Congruent numbers

Converse theorems for modular L-functions

COMPUTATIONAL PROOFS OF CONGRUENCES FOR 2-COLORED FROBENIUS PARTITIONS

SHIMURA LIFTS OF HALF-INTEGRAL WEIGHT MODULAR FORMS ARISING FROM THETA FUNCTIONS

SHIMURA LIFTS OF HALF-INTEGRAL WEIGHT MODULAR FORMS ARISING FROM THETA FUNCTIONS

Computer methods for Hilbert modular forms

Shifted Convolution L-Series Values of Elliptic Curves

q-series IDENTITIES AND VALUES OF CERTAIN L-FUNCTIONS Appearing in the Duke Mathematical Journal.

A Note on the Transcendence of Zeros of a Certain Family of Weakly Holomorphic Forms

Generalization of a few results in integer partitions

The Arithmetic of Noncongruence Modular Forms. Winnie Li. Pennsylvania State University, U.S.A. and National Center for Theoretical Sciences, Taiwan

CONGRUENCES FOR GENERALIZED FROBENIUS PARTITIONS WITH AN ARBITRARILY LARGE NUMBER OF COLORS

MATH 797MF PROBLEM LIST

Math 259: Introduction to Analytic Number Theory Some more about modular forms

Calculation and arithmetic significance of modular forms

REPRESENTATIONS OF INTEGERS AS SUMS OF SQUARES. Ken Ono. Dedicated to the memory of Robert Rankin.

Congruences of Multipartition Functions Modulo Powers of Primes. Tianjin University, Tianjin , P. R. China

COMPUTING THE INTEGER PARTITION FUNCTION

PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND (2k + 1) CORES

A MODULAR IDENTITY FOR THE RAMANUJAN IDENTITY MODULO 35

On Rankin-Cohen Brackets of Eigenforms

= = = = = =

CONGRUENCES MODULO SQUARES OF PRIMES FOR FU S k DOTS BRACELET PARTITIONS

congruences Shanghai, July 2013 Simple proofs of Ramanujan s partition congruences Michael D. Hirschhorn

Twists and residual modular Galois representations

A brief overview of modular and automorphic forms

INFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3

THE ASYMPTOTIC DISTRIBUTION OF ANDREWS SMALLEST PARTS FUNCTION

Projects on elliptic curves and modular forms

GUO-NIU HAN AND KEN ONO

Polygonal Numbers, Primes and Ternary Quadratic Forms

More about partitions

The Galois Representation Associated to Modular Forms (Part I)

MOCK MODULAR FORMS AS p-adic MODULAR FORMS

THE RAMANUJAN-SERRE DIFFERENTIAL OPERATORS AND CERTAIN ELLIPTIC CURVES. (q = e 2πiτ, τ H : the upper-half plane) ( d 5) q n

MODULAR FORMS ARISING FROM Q(n) AND DYSON S RANK

COMBINATORIAL APPLICATIONS OF MÖBIUS INVERSION

Class Numbers, Continued Fractions, and the Hilbert Modular Group

What is the crank of a partition? Daniel Glasscock, July 2014

Quadratic Forms and Congruences for l-regular Partitions Modulo 3, 5 and 7. Tianjin University, Tianjin , P. R. China

Outline of the Seminar Topics on elliptic curves Saarbrücken,

AN ARITHMETIC FORMULA FOR THE PARTITION FUNCTION

Zeros of classical Eisenstein series and recent developments

Mock modular forms and their shadows

The part-frequency matrices of a partition

TWISTS OF ELLIPTIC CURVES. Ken Ono

The Hardy-Ramanujan-Rademacher Expansion of p(n)

RECENT WORK ON THE PARTITION FUNCTION

SOME CONGRUENCES FOR TRACES OF SINGULAR MODULI

Representations of integers as sums of an even number of squares. Özlem Imamoḡlu and Winfried Kohnen

Congruences, graphs and modular forms

COMPOSITIONS, PARTITIONS, AND FIBONACCI NUMBERS

Congruences for Fishburn numbers modulo prime powers

Combinatorics, Modular Forms, and Discrete Geometry

AUTOMORPHIC FORMS NOTES, PART I

Transcription:

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 forms to problems in partition theory.

Goal The goal of this talk is to highlight some applications of the theory of modular forms to problems in partition theory. First we introduce some partition theoretic objects of interest:

A partition π of a positive integer n is a nonincreasing sequence of positive integers λ 0,..., λ m that sum to n. We write n = π, to denote the size of a partition, and call the λ i the parts of the partition π. In addition, we allow to be considered as the unique partition of 0.

A partition π of a positive integer n is a nonincreasing sequence of positive integers λ 0,..., λ m that sum to n. We write n = π, to denote the size of a partition, and call the λ i the parts of the partition π. In addition, we allow to be considered as the unique partition of 0. For example, 4 = 3 + 1 = 2 + 2 = 2 + 1 + 1 = 1 + 1 + 1 + 1 are all of the partitions of 5.

Graphical Representation We can represent a partition π of n graphically by a Ferrers-Young diagram, which is a left-justified array of n dots, each row representing a part of π in nonincreasing order from top to bottom.

Graphical Representation We can represent a partition π of n graphically by a Ferrers-Young diagram, which is a left-justified array of n dots, each row representing a part of π in nonincreasing order from top to bottom. For example, the diagram for the partition 3 + 2 + 1 + 1 of n = 7 is

The conjugate π of a partition π of n is the partition of n obtained from π by reading the columns instead of the rows in the Ferrers-Young diagram.

The conjugate π of a partition π of n is the partition of n obtained from π by reading the columns instead of the rows in the Ferrers-Young diagram. For example letting π be the partition 3 + 2 + 1 + 1 as before, we see that π is the partition 4 + 2 + 1, which has diagram

The conjugate π of a partition π of n is the partition of n obtained from π by reading the columns instead of the rows in the Ferrers-Young diagram. For example letting π be the partition 3 + 2 + 1 + 1 as before, we see that π is the partition 4 + 2 + 1, which has diagram Notice that the diagram of π is the reflection of the diagram for π.

can be generalized to multipartitions in the following way.

can be generalized to multipartitions in the following way. A k-component multipartition of a positive integer n is a k-tuple of partitions (π 1,..., π k ) such that k i=1 π k = n.

can be generalized to multipartitions in the following way. A k-component multipartition of a positive integer n is a k-tuple of partitions (π 1,..., π k ) such that k i=1 π k = n. For example, is a 4-partition of 17. (2 + 1, 3 + 3 + 1,, 3 + 2 + 2)

Partition Functions Of particular interest are functions that count partitions. We define for nonnegative n p(n) := #{ π = n} t(n) := #{ π = n O(π) O(π ) (mod 4)} { } k p k (n) := # (π 1,..., π k ) π i = n i=1 where O(π) is the number of odd parts in π.

These functions are all interesting in their own right as combinatorial objects. In addition, both p(n), and p k (n) have connections to physics and representation theory. The function t(n) is a function defined by R. Stanley which arose from a study of sign-balanced labeled posets.

These functions are all interesting in their own right as combinatorial objects. In addition, both p(n), and p k (n) have connections to physics and representation theory. The function t(n) is a function defined by R. Stanley which arose from a study of sign-balanced labeled posets. These functions carry with them some fascinating arithmetic properties, which can be unleashed through the applications of the theory of modular forms.

One of the most fascinating characteristics of p(n) are the following congruences of Ramanujan: For all n 0, p(5n + 4) 0 (mod 5) p(7n + 5) 0 (mod 7) p(11n + 6) 0 (mod 11)

Also, Hardy and Ramanujan proved an asymptotic formula for the growth of p(n) that Rademacher later perfected: For all n 0, p(n) = 1 π 2 A k (n) k d sinh( π 2 k 3 (x 1/24)) dx x 1/24 k=1 x=n (where A k (n) is a messy sum of exponentials involving dedekind sums).

S. Ahlgren and M. Boylan Theorem If p(qn + b) 0 (mod q) for some prime q, then (q, b) {(5, 4), (7, 5), (11, 6)}. I.e., there are no other Ramanujan congruences for p(n) beyond the classical cases.

However, if we extend to considering congruences of the form p(an + b) 0 (mod m), then there are other congruences but they are not as glamourous. For example, one of the simplest examples is the congruence p(17303n + 237) 0 (mod 13).

K. Ono, K. Ono and S. Ahlgren Theorem For a prime q 5, a positive integer m, and any 0 b q 1 satisfying a certain numerical requirement (a total of (q + 1)/2 of them), there are infinitely many non-nested arithmetic progressions {An + B} {qn + b}, such that for every n 0 we have p(an + B) 0 (mod q m ).

H. S. Theorem Let q 5 be prime, and m a positive integer. There are infinitely many arithmetic progressions {An + B} such that for all n 0 we have t(an + B) p(an + B) 0 (mod q m ).

H. S. Theorem Let q 5 be prime, and m a positive integer. There are infinitely many arithmetic progressions {An + B} such that for all n 0 we have t(an + B) p(an + B) 0 (mod q m ). Theorem t(n) lim n p(n) = 1 2.

S. Treneer Theorem Let q 5 be prime, and m a positive integer. There are infinitely many arithmetic progressions {An + B} such that for all n 0 we have p k (An + B) 0 (mod q m ).

Why are modular forms so useful in partition theory?

Generating Functions The main tool to begin the study of a partition function is to find a generating function. The generating functions for the partitions we are considering are: F (q) := M(q) := p(n)q n 1 = 1 q n, n=0 n=0 n 1 p k (n)q n 1 = (1 q n ) k, n 1

and the generating function for t(n) is a bit more complicated, so we describe it in terms of F (q): n=0 t(n)q n = F (q)f (q4 ) 5 F (q 32 ) 2 F (q 2 ) 2 F (q 16 ) 5.

and the generating function for t(n) is a bit more complicated, so we describe it in terms of F (q): n=0 t(n)q n = F (q)f (q4 ) 5 F (q 32 ) 2 F (q 2 ) 2 F (q 16 ) 5. Furthermore, when viewed analytically, these functions converge absolutely for q 1.

The reason that these functions are prime candidates for the application of modular forms, is due to the fact that F (q) looks very similar to the complex function η(z) = e πiz/12 (1 e 2πinz ). n=1

The reason that these functions are prime candidates for the application of modular forms, is due to the fact that F (q) looks very similar to the complex function η(z) = e πiz/12 (1 e 2πinz ). n=1 In particular, defining q := e 2πiz, we see that η(z) = q 1 24 n=1 (1 q n ) = q 1 24 F (q).

The function η(z) is a type of modular form.

Modular forms are complex valued functions on the complex upper half plane H = {z C Im(z) > 0}, that have special transformation properties.

Modular forms are complex valued functions on the complex upper half plane H = {z C Im(z) > 0}, that have special transformation properties. To understand ( these ) properties, we consider the group SL 2 (Z) of a b matrices with a, b, c, d Z and determinant 1, and its c d action on H via ( ) a b z := az + b c d cz + d.

The group Γ(1) := SL 2 (Z) is generated by the matrices ( ) ( ) 0 1 1 1 S = and T =. 1 0 0 1

The group Γ(1) := SL 2 (Z) is generated by the matrices ( ) ( ) 0 1 1 1 S = and T =. 1 0 0 1 A fundamental domain for the action is given by F := { 1/2 z < 1/2 z > 1} { 1/2 z 0 z = 1}.

There are subgroups of Γ(1) also of particular interest, called congruence subgroups. In particular {( ) } a b Γ(N) := SL c d 2 (Z) a d 1, b c 0 (mod N) {( ) } a b Γ 1 (N) := SL c d 2 (Z) a d 1, c 0 (mod N) {( ) } a b Γ 0 (N) := SL c d 2 (Z) c 0 (mod N) Notice that our use of the notation Γ(1) for SL 2 (Z) makes sense with this definition.

When congruence subgroups act on H we get more complicated fundamental domains.

When congruence subgroups act on H we get more complicated fundamental domains. We also consider congruence subgroups Γ acting on Q where ( ) a b = a c d c = lim az + b z cz + d,

When congruence subgroups act on H we get more complicated fundamental domains. We also consider congruence subgroups Γ acting on Q where ( ) a b = a c d c = lim az + b z cz + d, Adding in the equivalence classes of Q to the fundamental domain F of a congruence subgroup Γ gives a Riemann surface.

So what is a modular form?

So what is a modular form? A modular form is a complex function on H that behaves nicely with respect to the action of a congruence subgroup Γ.

So what is a modular form? A modular form is a complex function on H that behaves nicely with respect to the action of a congruence subgroup Γ. More specifically,

Definition of Modular form A holomorphic function f : H C is called a modular form of integer weight k if ( ) az + b f = (cz + d) k f (z) cz + d for all z H and ( ) a b c d Γ, and that f is holomorphic at the cusps of Γ meaning for any ( ) a b c d Γ(1), ( ) az + b (cz + d) k f = a(n)e 2πinz/N. cz + d n n 0

If a modular form f vanishes at the cusps, we call f a cusp form, and if f is merely meromorphic at the cups, we call f a weakly holomorphic modular form.

If a modular form f vanishes at the cusps, we call f a cusp form, and if f is merely meromorphic at the cups, we call f a weakly holomorphic modular form. The sets M k (Γ) (and S k (Γ)) of modular forms (or cusp forms) of weight k is a complex vector space. When Γ = Γ(1), it is particularly easy to describe. Notice that for this group, there is only one cusp, which we call.

Let q := e 2πiz. Define E k (z) := 1 2k B k σ k 1 (n)q n n=1 where B k is the kth Bernoulli number and σ k (n) = 1 d n d k.

Let q := e 2πiz. Define E k (z) := 1 2k B k σ k 1 (n)q n n=1 where B k is the kth Bernoulli number and σ k (n) = 1 d n d k. Then for k 4 even, we have that E k M k (Γ(1)). Notice that k must be even since ( 1 0 0 1 ) is in Γ(1).

A basis for the vector space M k (Γ(1)) over C is {E 4 (z) a E 6 (z) b 4a + 6b = k, a, b 0}.

The simplest example of a cusp form is (z) S 12 (Γ(1)).

The simplest example of a cusp form is (z) S 12 (Γ(1)). This function is particularly interesting to us since (z) = E 4(z) 3 E 6 (z) 2 1728 = q n=1(1 q n ) 24 = η(z) 24, and this is the same η(z) that we saw arising in the generating function for partitions!

Unfortunately η(z) is not quite as nice of a modular form as (z). In particular, it does not have integer weight. There is a theory however of half-integer weight modular forms. Moreover, from work of Shimura there is an explicit correspondence between modular forms of integer and half-integer weights.

There are several operators on spaces of modular forms. One of particular interest in proving the theorems stated earlier is the Hecke operator.

There are several operators on spaces of modular forms. One of particular interest in proving the theorems stated earlier is the Hecke operator. If f (z) = n=0 a(n)qn is the Fourier expansion at infinity of a modular form in M k (Γ 0 (N), then f (z) T k (p) := (a(pn) + p k 1 a(n/p))q n n=0 is a modular form in M k (Γ 0 (N) as well. Likewise T k (p) takes cusp forms to cusp forms.

This operator can be extended to have meaning for half-integer weight modular forms as well, and in particular it commutes with the Shimura correspondence.

This operator can be extended to have meaning for half-integer weight modular forms as well, and in particular it commutes with the Shimura correspondence. Theory of Serre (arising from Galois representations) gives conditions for when cusp forms must vanish under the Hecke operator modulo m. In particular, there are conditions for which infinitely many modular forms vanish simultaneously... this is what allows for the proof that for q 5 be prime, and m a positive integer, there are innitely many arithmetic progressions {An + B} such that for all n 0 we have t(an + B) p(an + B) 0 (mod q m ).