Ramanujan-type Congruences for Overpartitions Modulo 5. Nankai University, Tianjin , P. R. China

Similar documents
Congruences Modulo Small Powers of 2 and 3 for Partitions into Odd Designated Summands

Arithmetic Properties of Combinatorial Quantities

Two congruences involving 4-cores

Permutation Tableaux and the Dashed Permutation Pattern 32 1

Conjectures and Results on Super Congruences

PRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES. Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania

Zhanjiang , People s Republic of China

Permutation Tableaux and the Dashed Permutation Pattern 32 1

Carmen s Core Concepts (Math 135)

A Study of Relationship Among Goldbach Conjecture, Twin prime and Fibonacci number

Math 127: Equivalence Relations

Wilson s Theorem and Fermat s Theorem

SOLUTIONS TO PROBLEM SET 5. Section 9.1

Primitive Roots. Chapter Orders and Primitive Roots

Assignment 2. Due: Monday Oct. 15, :59pm

1.6 Congruence Modulo m

Introduction to Modular Arithmetic

6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method

LUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS

Some Fine Combinatorics

Congruence properties of the binary partition function

ON THE EQUATION a x x (mod b) Jam Germain

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP

SOLUTIONS FOR PROBLEM SET 4

Discrete Math Class 4 ( )

NUMBER THEORY AMIN WITNO

Solutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00

Applications of Fermat s Little Theorem and Congruences

To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2

A CONJECTURE ON UNIT FRACTIONS INVOLVING PRIMES

Number Theory - Divisibility Number Theory - Congruences. Number Theory. June 23, Number Theory

An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,

Modular arithmetic Math 2320

LECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.

A theorem on the cores of partitions

On repdigits as product of consecutive Fibonacci numbers 1

The congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.

MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005

Solutions for the Practice Questions

Practice Midterm 2 Solutions

A REMARK ON A PAPER OF LUCA AND WALSH 1. Zhao-Jun Li Department of Mathematics, Anhui Normal University, Wuhu, China. Min Tang 2.

UNIVERSITY OF MANITOBA DATE: December 7, FINAL EXAMINATION TITLE PAGE TIME: 3 hours EXAMINER: M. Davidson

by Michael Filaseta University of South Carolina

Section Summary. Permutations Combinations Combinatorial Proofs

Minimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field

MAT Modular arithmetic and number theory. Modular arithmetic

Degree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS

Corners in Tree Like Tableaux

Number Theory. Konkreetne Matemaatika

1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =

November 28, Western Washington University. Ramanujan s Congruences. Bryan Clark, Lesley Lowery, Nhan Nguyen. Introduction. History.

#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS. Thomas A. Plick

Math 255 Spring 2017 Solving x 2 a (mod n)

BAND SURGERY ON KNOTS AND LINKS, III

Dedekind Sums with Arguments Near Euler s Number e

Variations on a Theme of Sierpiński

PRIMES 2017 final paper. NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma

University of British Columbia. Math 312, Midterm, 6th of June 2017

FORBIDDEN INTEGER RATIOS OF CONSECUTIVE POWER SUMS

The Chinese Remainder Theorem

Discrete Square Root. Çetin Kaya Koç Winter / 11

Constructions of Coverings of the Integers: Exploring an Erdős Problem

Quadratic Residues. Legendre symbols provide a computational tool for determining whether a quadratic congruence has a solution. = a (p 1)/2 (mod p).

Greedy Flipping of Pancakes and Burnt Pancakes

Gauss and AGM. Burton Rosenberg. January 30, 2004

Sheet 1: Introduction to prime numbers.

LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI

THE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m

b) Find all positive integers smaller than 200 which leave remainder 1, 3, 4 upon division by 3, 5, 7 respectively.

A tournament problem

Modular Arithmetic. Kieran Cooney - February 18, 2016

50. ON THE EXPANSION OF RAMANUJAN S CONTINUED FRACTION. Dedicated to George E. Andrews on the occasion of his 60th Birthday.

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.

Congruence. Solving linear congruences. A linear congruence is an expression in the form. ax b (modm)

Sec$on Summary. Permutations Combinations Combinatorial Proofs

arxiv: v1 [math.co] 30 Nov 2017

SYMMETRIES OF FIBONACCI POINTS, MOD m

Walking on Numbers and a Self-Referential Formula

Combinatorics in the group of parity alternating permutations

6.2 Modular Arithmetic

Mathematics Explorers Club Fall 2012 Number Theory and Cryptography

Generating trees and pattern avoidance in alternating permutations

The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday

Sec 5.1 The Basics of Counting

Yet Another Triangle for the Genocchi Numbers

Unique Sequences Containing No k-term Arithmetic Progressions

Eric Duchêne (Univ. Claude Bernard Lyon 1) Michel Rigo (University of Liège)

Solutions to Exam 1. Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively prime positive integers.

MODULAR ARITHMETIC II: CONGRUENCES AND DIVISION

Block 1 - Sets and Basic Combinatorics. Main Topics in Block 1:

Public Key Encryption

What is counting? (how many ways of doing things) how many possible ways to choose 4 people from 10?

CHAPTER 2. Modular Arithmetic

Fermat s little theorem. RSA.

Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.

RESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel

The Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes

In this paper, we discuss strings of 3 s and 7 s, hereby dubbed dreibens. As a first step

Transcription:

Ramanujan-type Congruences for Overpartitions Modulo 5 William Y.C. Chen a,b, Lisa H. Sun a,, Rong-Hua Wang a and Li Zhang a a Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P. R. China b Center for Applied Mathematics Tianjin University, Tianjin 30007, P. R. China chen@nankai.edu.cn, sunhui@nankai.edu.cn, wangwang@mail.nankai.edu.cn, zhangli47@mail.nankai.edu.cn Abstract. Let p(n denote the number of overpartitions of n. Hirschhorn and Sellers showed that p(4n + 3 0 (mod 8 for n 0. They also conjectured that p(40n + 35 0 (mod 40 for n 0. Chen and Xia proved this conjecture by using the (p, k- parametrization of theta functions given by Alaca, Alaca and Williams. In this paper, we show that p(5n ( 1 n p(4 5n (mod 5 for n 0 and p(n ( 1 n p(4n (mod 8 for n 0 by using the relation of the generating function of p(5n modulo 5 found by Treneer and the -adic expansion of the generating function of p(n due to Mahlburg. As a consequence, we deduce that p(4 k (40n + 35 0 (mod 40 for n, k 0. Furthermore, applying the Hecke operator on φ(q 3 and the fact that φ(q 3 is a Hecke eigenform, we obtain an infinite family of congrences p(4 k 5l n 0 (mod 5, where k 0 and l is a prime such that l 3 (mod 5 and ( n l = 1. Moreover, we show that p(5 n p(5 4 n (mod 5 for n 0. So we are led to the congruences p ( 4 k 5 i+3 (5n ± 1 0 (mod 5 for n, k, i 0. In this way, we obtain various Ramanujan-type congruences for p(n modulo 5 such as p(45(3n + 1 0 (mod 5 and p(15(5n ± 1 0 (mod 5 for n 0. Keywords: overpartition, Ramanujan-type congruence, modular form, Hecke operator, Hecke eigenform MSC(010: 05A17, 11P83 1 Introduction The objective of this paper is to use half-integral weight modular forms to derive three infinite families of congruences for overpartitions modulo 5. Recall that a partition of a nonnegative integer n is a nonincreasing sequence of positive integers whose sum is n. An overpartition of n is a partition of n where the first occurrence of each distinct part may be overlined. We denote the number of overpartitions of n by p(n. We set p(0 = 1 and p(n = 0 if n < 0. For example, there are eight overpartitions of 3 3, 3, + 1, + 1, + 1, + 1, 1 + 1 + 1, 1 + 1 + 1. 1

Overpartitions arise in combinatorics [6], q-series [5], symmetric functions [], representation theory [11], mathematical physics [7, 8] and number theory [15, 16]. They are also called standard MacMahon diagrams, joint partitions, jagged partitions or dotted partitions. Corteel and Lovejoy [6] showed that the generating function of p(n is given by p(nq n = ( q; q (q; q. Recall that the generating function of p(n can be expressed as p(nq n = 1 φ( q, where φ(q is Ramanujan s theta function as defined by see Berndt []. φ(q = n= q n, (1.1 On the other hand, the generating function of p(n has the following -adic expansion p(nq n = 1 + k ( 1 n+k c k (nq n, (1. k=1 where c k (n denotes the number of representations of n as a sum of k squares of positive integers. The above -adic expansion (1. is useful to derive congruences for p(n modulo powers of, see, for example [1, 13, 18]. By employing dissection formulas, Fortin, Jacob and Mathieu [7], Hirschhorn and Sellers [9] independently derived various Ramanujan-type congruences for p(n, such as n=1 p(4n + 3 0 (mod 8. (1.3 Hirschhorn and Sellers [9] proposed the following conjectures p(7n + 18 0 (mod 1, (1.4 p(40n + 35 0 (mod 40. (1.5 They also conjectured that if l is prime and r is a quadratic nonresidue modulo l then p(ln + r { 0 (mod 8 if l ±1 (mod 8, 0 (mod 4 if l ±3 (mod 8. (1.6

By using the 3-dissection formula for φ( q, Hirschhorn and Sellers [10] proved (1.4 and obtained a family of congruences where n, α 0. p(9 α (7n + 18 0 (mod 1, Employing the -dissection formulas of theta functions due to Ramanujan, Hirschhorn and Sellers [9], Chen and Xia [4] obtained a generating function of p(40n + 35 modulo 5. Using the (p, k-parametrization of theta functions given by Alaca, Alaca and Williams [1], they showed that p(40n + 35 0 (mod 5. (1.7 This proves Hirschhorn and Sellers conjecture (1.5 by combining congruence (1.3. Applying the -adic expansion (1., Kim [13] proved (1.6 and obtained congruence properties of p(n modulo 8. For powers of, Mahlburg [18] showed that p(n 0 (mod 64 holds for a set of integers of arithmetic density 1. Kim [1] showed that p(n 0 (mod 18 holds for a set of integers of arithmetic density 1. For the modulus 3, by using the fact that φ(q 5 is a Hecke eigenform in the half-integral weight modular form space M 5 ( Γ 0 (4, Lovejoy and Osburn [17] proved that p(3l 3 n 0 (mod 3, where l (mod 3 is an odd prime and l n. Moreover, by utilizing half-integral weight modular forms, Treneer [1] showed that for a prime l such that l 1 (mod 5, for all n coprime to l. p(5l 3 n 0 (mod 5, In this paper, we establish the following two congruence relations for overpartitions modulo 5 and modulo 8 by using a relation of the generating function of p(5n modulo 5 and applying the -adic expansion (1.. Theorem 1.1. For n 0, we have Theorem 1.. For n 0, we have p(5n ( 1 n p(4 5n (mod 5. (1.8 p(n ( 1 n p(4n (mod 8. (1.9 Combining the above two congruence relations with congruences (1.3 and (1.7, we arrive at a family of congruences modulo 40. 3

Corollary 1.3. For n, k 0, we have M 3 p(4 k (40n + 35 0 (mod 40. (1.10 Based on the Hecke operator on φ(q 3 and the fact that φ(q 3 is a Hecke eigenform in ( Γ 0 (4, we obtain a family of congruences for overpartitions modulo 5. Theorem 1.4. Let ( l denote the Legendre symbol. Assume that k is a nonnegative integer and l is a prime with l 3 (mod 5. Then we have p(4 k 5l n 0 (mod 5, where n is a nonnegative integer such that ( n l = 1. Using the properties of the Hecke operator T 3,16(l and the Hecke eigenform φ(q 3, we are led to another congruence relation for overpartitions modulo 5. Theorem 1.5. For n 0, we have p(5 n p(5 4 n (mod 5. (1.11 Combining (1.8 and (1.11, we find the following family of congruences modulo 5. Corollary 1.6. For n, k, i 0, we have p ( 4 k 5 i+3 (5n ± 1 0 (mod 5. (1.1 Preliminaries To make this paper self-contained, we recall some definitions and notation on half-integral weight modular forms. For more details, see [3, 14, 19 1]. M k Let k be an odd positive integer and N be a positive integer with 4 N. We use ( Γ 0 (N to denote the space of holomorphic modular forms on Γ 0 (N of weight k. Definition.1. Let f(z = a(nq n be a modular form in M k ( Γ 0 (N. For any odd prime l N, the action of the Hecke operator T k,n(l on f(z M k ( Γ 0 (N is given by f(z T k,n(l = ( ( k 1 ( 1 a(l n + l where a( n l = 0 if n is not divisible by l. 4 n l k 3 a(n + l k a( n l q n, (.1

The following proposition says that the Hecke operator T k,n(l maps the modular form space M k ( Γ 0 (N into itself. Proposition.. Let l be an odd prime and f(z M k ( Γ 0 (N, then f(z T k,n(l M k ( Γ 0 (N. A Hecke eigenform associated with the Hecke operator T k,n(l is defined as follows. Definition.3. A half-integral weight modular form f(z M k ( Γ 0 (4N is called a Hecke eigenform for the Hecke operator T k,n(l, if for every prime l 4N there exists a complex number λ(l for which f(z T k,n(l = λ(lf(z. For the space of half-integral weight modular forms on Γ 0 (4, we have the following dimension formula. Proposition.4. We have k dim M k ( Γ 0 (4 = 1 +. 4 By the above dimension formula, we see that dim M 3 ( Γ 0 (4 = 1. From the fact that φ(q 3 M 3 ( Γ 0 (4, it is easy to deduce that see, for example [1, P. 18]. φ(q 3 T 3,4(l = (l + 1φ(q 3, (. 3 Proofs of Theorem 1.1 and Theorem 1. In this section, we give proofs of Theorem 1.1 and Theorem 1. by using a relation of the generating function of p(5n modulo 5 and the -adic expansion (1. of p(n. Proof of Theorem 1.1. Recall the following -dissection formula for φ(q, φ(q = φ(q 4 + qψ(q 8, (3.1 where ψ(q = n=0 q n +n, 5

see, for example, Hirschhorn and Sellers [9]. Replacing q by q, (3.1 becomes φ( q = φ(q 4 qψ(q 8. (3. We now consider the generating function of p(5n modulo 5. The following relation is due to Treneer [1, p. 18], p(5nq n φ( q 3 (mod 5. (3.3 Plugging (3. into (3.3 yields that p(5nq n φ(q 4 3 qφ(q 4 ψ(q 8 + q φ(q 4 ψ(q 8 3q 3 ψ(q 8 3 (mod 5. (3.4 Extracting the terms of q 4n+i for i = 0, 1,, 3 on both sides of (3.4 and setting q 4 to q, we obtain p(0nq n φ(q 3 (mod 5, (3.5 p(0n + 5q n φ(q ψ(q (mod 5, (3.6 p(0n + 10q n φ(qψ(q (mod 5, (3.7 p(0n + 15q n 3ψ(q 3 (mod 5. (3.8 Substituting the -dissection formula (3.1 into (3.5, we find that p(0nq n φ(q 4 3 + qφ(q 4 ψ(q 8 + q φ(q 4 ψ(q 8 + 3q 3 ψ(q 8 3 (mod 5. (3.9 Extracting the terms of q 4n+i for i = 0, 1,, 3 on both sides of (3.9 and setting q 4 to q, we obtain p(4 0n φ(q 3 (mod 5, (3.10 p(4 (0n + 5 φ(q ψ(q (mod 5, (3.11 p(4 (0n + 10 φ(qψ(q (mod 5, (3.1 p(4 (0n + 15 3ψ(q 3 (mod 5. (3.13 6

Comparing the equations (3.5 (3.8 with (3.10 (3.13, we deduce that So we conclude that This completes the proof. p(5 (4n p(4 5 4n (mod 5, p(5 (4n + 1 p(4 5 (4n + 1 (mod 5, p(5 (4n + p(4 5 (4n + (mod 5, p(5 (4n + 3 p(4 5 (4n + 3 (mod 5. p(5n ( 1 n p(4 5n (mod 5. We note that extracting the terms of odd powers of q on both sides of (3.8 leads to the congruence p(40n + 35 0 (mod 5 due to Chen and Xia [4]. Next, we prove Theorem 1. by using the -adic expansion (1.. Recall that c k (n in (1. denotes the number of representations of n as a sum of k squares of positive integers. In particular, c 1 (n = 1 if n is a square; otherwise, c 1 (n = 0. Proof of Theorem 1.. It follows from (1. that p(n ( 1 n ( c 1 (n + 4c (n (mod 8, (3.14 where n 1. Replacing n by 4n in (3.14, we get p(4n c 1 (4n + 4c (4n (mod 8. (3.15 Since c 1 (n = c 1 (4n and c (n = c (4n, (3.15 can be rewritten as Substituting (3.16 into (3.14, we arrive at as claimed. p(4n c 1 (n + 4c (n (mod 8. (3.16 p(n ( 1 n p(4n (mod 8, It is easy to see that Corollary 1.3 can be obtained by iteratively applying Theorem 1.1 and Theorem 1. to the congruences p(40n + 35 0 (mod 5 and p(40n + 35 0 (mod 8 that can be deduced from congruence (1.3 by replacing n with 10n + 8. 4 Proof of Theorem 1.4 In this section, we prove Theorem 1.4 by using the Hecke operator on φ(q 3 along with the fact that φ(q 3 is a Hecke eigenform in M 3 ( Γ 0 (4. In view of Theorem 1.1, to prove Theorem 1.4, it suffices to consider the special case k = 0 that takes the following form. 7

Theorem 4.1. Let l be a prime with l 3 (mod 5. Then holds for any nonnegative integer n with ( n l = 1. p(5l n 0 (mod 5 (4.1 Proof. Recall that φ( q 3 is a modular form in M 3 ( Γ 0 (16. Suppose that φ( q 3 = a(nq n (4. is the Fourier expansion of φ( q 3. Applying the Hecke operator T 3,16(l to φ( q 3 and using (.1, we find that ( a(l n + φ( q 3 T 3,16(l = n=0 ( n n a(n + la( q n, (4.3 l l where l is an odd prime. Replacing q by q in (., we see that φ( q 3 is a Hecke eigenform in the space M 3 ( Γ 0 (16, and hence φ( q 3 T 3,16(l = (l + 1φ( q 3. (4.4 Comparing the coefficients of q n in (4.3 and (4.4, we deduce that ( n ( n a(l n + a(n + la = (l + 1a(n. (4.5 l l Revoking the congruence (3.3, that is, φ( q 3 p(5nq n (mod 5, (4.6 and comparing (4. with (4.6, we get a(n p(5n (mod 5. (4.7 Plugging (4.7 into (4.5, we deduce that ( ( n 5n p(5l n + p(5n + lp (l + 1p(5n l l (mod 5. (4.8 Since l 3 (mod 5 and ( n = 1, we see that l 5 and l n, so that l l 5n and p ( ( 5n l = 0. Moreover, we have n l (l + 1 1 (mod 5. Hence congruence (4.8 becomes This completes the proof. p(5l n 0 (mod 5. 8

We now give some special cases of Theorem 1.4. Setting l = 3 and k = 0, 1 in Theorem 1.4, respectively, we obtain the following congruences for n 0, p ( 45(3n + 1 0 (mod 5, p ( 180(3n + 1 0 (mod 5. Setting l = 13, k = 0 in Theorem 1.4, we obtain the following congruences for n 0, p ( 845(13n + 0 (mod 5, p ( 845(13n + 5 0 (mod 5, p ( 845(13n + 6 0 (mod 5, p ( 845(13n + 7 0 (mod 5, p ( 845(13n + 8 0 (mod 5, p ( 845(13n + 11 0 (mod 5. 5 Proof of Theorem 1.5 In this section, we complete the proof of Theorem 1.5 by using the Hecke operator T 3,16(l and the Hecke eigenform φ( q 3. Proof of Theorem 1.5. Setting l = 5 in the congruence relation (4.8, we find that ( n p(5n p(5 3 n + p(5n (mod 5. (5.1 5 By the definition of the Legendre symbol, we see that if n 0 (mod 5, then ( n 5 = 0. Hence, by replacing n with 5n in congruence (5.1, we obtain that as claimed. p(5 n p(5 4 n (mod 5, (5. Furthermore, we note that if n ±1 (mod 5, then ( n 5 = 1. Hence by setting n to 5n ± 1 in (5.1, we deduce that p(5 3 (5n ± 1 0 (mod 5. (5.3 By iteratively applying the congruence p(5n ( 1 n p(4 5n (mod 5 given in Theorem 1.1 and congruence (5. to (5.3, we obtain that p(4 k 5 i+3 (5n ± 1 0 (mod 5, (5.4 9

where n, k, i 0. This proves Corollary 1.6. For n 0, setting i = 0 and k = 0, 1 in (5.4, we obtain the following special cases p ( 15(5n ± 1 0 (mod 5, p ( 500(5n ± 1 0 (mod 5. By replacing n by 5n ± in (5.1 and iteratively using the congruence relation (5., we obtain the following relation. Corollary 5.1. For n, i 0, we have p ( 5(5n ± 3 p ( 5 i+3 (5n ± (mod 5. Acknowledgments. This work was supported by the 973 Project, the PCSIRT Project of the Ministry of Education and the National Science Foundation of China. References [1] A. Alaca, S. Alaca and K.S. Williams, On the two-dimensional theta functions of the Borweins, Acta Arith. 14 (006 177 195. [] B.C. Berndt, Number Theory in the Spirit of Ramanujan, American Mathematical Society, Providence, RI, 006. [3] W.Y.C. Chen, D.K. Du, Q.H. Hou and L.H. Sun, Congruences of multipartition functions modulo powers of primes, Ramanujan J., to appear. [4] W.Y.C. Chen and E.X.W. Xia, Proof of a conjecture of Hirschhorn and Sellers on overpartitions, Acta Arith. 163 (1 (014 59 69. [5] S. Corteel and P. Hitczenko, Multiplicity and number of parts in overpartitions, Ann. Combin. 8 (004 87 301. [6] S. Corteel and J. Lovejoy, Overpartitions, Trans. Amer. Math. Soc. 356 (004 163 1635. [7] J.-F. Fortin, P. Jacob and P. Mathieu, Jagged partitions, Ramanujan J. 10 (005 15 35. [8] J.-F. Fortin, P. Jacob and P. Mathieu, Generating function for K-restricted jagged partitions, Electron. J. Combin. 1 (1 (005 R1. [9] M.D. Hirschhorn and J.A. Sellers, Arithmetic relations for overpartitions, J. Combin. Math. Combin. Comput. 53 (005 65 73. 10

[10] M.D. Hirschhorn and J.A. Sellers, An infinite family of overpartition congruences modulo 1, Integers 5 (005 #A0. [11] S.-J. Kang and J.-H. Kwon, Crystal bases of the fock space representations and string functions, J. Algebra 80 (004 313 349. [1] B. Kim, The overpartition function modulo 18, Integers 8 (008 #A38. [13] B. Kim, A short note on the overpartition function, Discrete Math. 309 (009 58 53. [14] N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer, New York, 1993. [15] J. Lovejoy, Overpartitions and real quadratic fields, J. Number Theory 106 (004 178 186. [16] J. Lovejoy and O. Mallet, Overpartition pairs and two classes of basic hypergeomtric series, Adv. Math. 17 (008 386 418. [17] J. Lovejoy and R. Osburn, Quadratic forms and four partition functions modulo 3, Integers 11 (011 #A4. [18] K. Mahlburg, The overpartition function modulo small powers of, Discrete Math. 86 (004 63 67. [19] K. Ono, The Web of Modularity: Arithmetic of the Coefficients of Modular Forms and q-series, CBMS Regional Conference Series in Mathematics 10, AMS Press, Providence, RI, 004. [0] G. Shimura, On modular forms of half-integral weight, Ann. Math. 97 (1973 440 481. [1] S. Treneer, Congruences for the coefficients of weakly holomorphic modular forms, Proc. London Math. Soc. 93 (006 304 34. 11