%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% UPDATED Submission to INTEGERS, June 2005 %% Small insertion made in Section 2 in response to referee's comments %% This is a LaTeX file for a 5 page document %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentclass[12pt]{article} \usepackage{amsmath} \usepackage{amsthm} \usepackage{amssymb} \textwidth= 6.5in \textheight= 9.0in \topmargin = -20pt \evensidemargin=0pt \oddsidemargin=0pt \headsep=25pt \parskip=10pt \font\smallit=cmti10 \font\smalltt=cmtt10 \font\smallrm=cmr9 %%%%%%%%%%%%%%%%%%%%%%% %\pagestyle{plain} %%%%%%%%%%%%%%%%%%%%%%% %\setlength{\topmargin}{-.5in} %\setlength{\hoffset}{-0.75in} %\setlength{\textwidth}{6.3in} %\setlength{\textheight}{8.7in} \newtheorem{Lemma}{Lemma}[section] \newtheorem{Theorem}[Lemma]{Theorem} \newtheorem{Prop}[Lemma]{Proposition} \newtheorem{Corollary}[Lemma]{Corollary} \newcommand{\N}[2]{N^{\#}_{#1}(#2)} \newtheorem{Notation}[Lemma]{Notation} \newtheorem{Remark}[Lemma]{Remark} \newtheorem{Table}[Lemma]{Table} \newtheorem{Definition}[Lemma]{Definition} \renewcommand{\baselinestretch}{1.2} \renewcommand{\arraystretch}{.7} \begin{document} \vspace*{-60pt} \centerline{\smalltt INTEGERS: \smallrm ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY \smalltt 5 (2005), \#A20} \vskip 40pt \begin{center} {\bf AN INFINITE FAMILY OF OVERPARTITION\\ CONGRUENCES MODULO 12} \vskip 20pt {\bf Michael D. Hirschhorn }\\ {\smallit School of Mathematics, UNSW, Sydney 2052, Australia}\\ {\tt m.hirschhorn@unsw.edu.au}\\ \vskip 10pt {\bf James A. Sellers}\\ {\smallit Department of Mathematics, The Pennsylvania State University, University Park, PA 16802, USA}\\ {\tt sellersj@math.psu.edu}\\ \end{center} \vskip 30pt \centerline{\smallit Received: 2/17/05, Revised: 6/25/05, Accepted: 7/29/05, Published: 8/15/05} \vskip 30pt \baselineskip=14pt \centerline{\bf Abstract} \noindent A number of arithmetic properties of overpartitions have been proven recently. However, all such results have involved moduli which are powers of 2. In this brief note, we prove the first infinite family of congruences with a modulus that is not a power of 2 by proving that, for all $n\geq 0$ and all $\alpha\geq 0,$ $ \overline{p}(9^\alpha(27n+18)) \equiv 0 \pmod{12}. $ \pagestyle{myheadings} \markright{\smalltt INTEGERS: \smallrm ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY \smalltt 5 (2005), \#A20\hfill} \thispagestyle{empty} \baselineskip=14pt \section*{\normalsize 1. Introduction} \addtocounter{section}{+1} In this brief note, we let $\overline{p}(n)$ be the number of overpartitions of the integer $n$. An {\bf{overpartition}} of the nonnegative integer $n$ is a partition of $n$ where the first occurrence of parts of each size may be overlined. For example, the overpartitions of the integer 3 are $$ 3,\ \overline{3},\ 2+1,\ \overline{2}+1,\ 2+\overline{1},\ \overline{2}+\overline{1},\ 1+1+1,\ \overline{1}+1+1. $$ From this example, we see that $\overline{p}(3) = 8.$ The function $\overline{p}(n)$ has been considered recently by a number of mathematicians; please see \cite{CL, CLY, Fortin, HS-over, Lovejoy1, Lovejoy2, Lovejoy3, Mahlburg}. In \cite{HS-over} and \cite{Mahlburg}, several Ramanujan-like congruences modulo small powers of two were proven for $\overline{p}(n).$ But as of this writing, no one has proven a family of congruences satisfied by $\overline{p}(n)$ for a modulus that is not a power of 2. Our goal in this note is to prove such a family. \begin{Theorem} \label{infinite-family-mod12} For all $n\geq 0$ and all $\alpha\geq 0,$ $$\overline{p}(9^\alpha(27n+18)) \equiv 0 \pmod{3}.$$ \end{Theorem} This theorem settles a conjecture stated by the authors in \cite{HS-over} (which was the $\alpha=0$ case of Theorem \ref{infinite-family-mod12}). \section*{\normalsize 2. The Machinery} \addtocounter{section}{+1} \addtocounter{Lemma}{-1} Throughout this note, all power series in $q$ will be viewed as formal power series, so questions of convergence will not be considered. Indeed, such questions are not of importance as we do not evaluate any of the series at a particular value of $q.$ With this said, we focus our attention on proving Theorem \ref{infinite-family-mod12}, which is a corollary of the following: \begin{Theorem} \label{thm-machinery} For all $n\geq 0,$ \allowdisplaybreaks\begin{eqnarray*} &&\overline{p}(27n+18)\equiv0\pmod{3}\textrm{\ \ \ and}\\ &&\overline{p}(27n)\equiv \overline{p}(3n)\pmod{3}. \end{eqnarray*} \end{Theorem} We utilize generating function manipulations to prove Theorem \ref{thm-machinery}. We begin with the generating function for $\overline{p}(n):$ $$ \sum_{n\ge0}\overline{p}(n)q^n=\prod_{n\ge1}\frac{1+q^n}{1-q^n}=\frac{1}{D(q)}, $$ where $$ D(q)=\sum_{n=-\infty}^\infty(-1)^nq^{n^2}. $$ In the proof of Theorem \ref{thm-machinery}, we will make use of the following straightforward lemmata: \begin{Lemma} \label{lemma1} $$ D(q)^3\equiv D(q^3) \pmod{3}. $$ \end{Lemma} \begin{proof} This follows from the fact that $$ (1-q^n)^3\equiv 1-q^{3n}\pmod{3} $$ together with the fact that $$ D(q)=\prod_{n\ge1}\frac{(1-q^n)^2}{(1-q^{2n})}. $$ \end{proof} \begin{Lemma} \label{lemma2} $$ D(q)\equiv D(q^9)+qY(q^3)\pmod{3} $$ where $$ Y(q)=\sum_{n=-\infty}^\infty(-1)^nq^{3n^2-2n}. $$ \end{Lemma} \begin{proof} We have \begin{eqnarray*} D(q) &=& \sum_{n\equiv0\pmod3}(-1)^nq^{n^2}+\sum_{n\equiv\pm1\pmod3}(-1)^nq^{n^2}\\ &=& D(q^9)-2qY(q^3)\\ &\equiv& D(q^9)+qY(q^3)\pmod{3}. \end{eqnarray*} \end{proof} \begin{proof}{(of Theorem \ref{thm-machinery})} Our first goal is to rewrite the generating function for $\overline{p}(n)$ in such a way that we can dissect it to obtain the generating function for $\overline{p}(3n)$ in a straightforward manner. We have, after multiple applications of the above lemmata, \allowdisplaybreaks\begin{eqnarray*} \sum_{n\ge0}\overline{p}(n)q^n &=&\frac1{D(q)}\\ &=&\frac{D(q)^2}{D(q)^3}\\ &\equiv& \frac{D(q)^2}{D(q^3)}\pmod{3} \textrm{\ \ using Lemma \ref{lemma1}}\\ &\equiv& \frac{(D(q^9)+qY(q^3))^2}{D(q^3)}\pmod{3} \textrm{\ \ using Lemma \ref{lemma2}}\\ &=& \frac{D(q^9)^2+2qD(q^9)Y(q^3)+q^2Y(q^3)^2}{D(q^3)}. \end{eqnarray*} From this we see that \begin{eqnarray*} \sum_{n\ge0}\overline{p}(3n)q^n &\equiv& \frac{D(q^3)^2}{D(q)}\pmod{3}\\ &=&\frac{D(q^3)^2D(q)^2}{D(q)^3}\\ &\equiv& \frac{D(q^3)^2D(q)^2}{D(q^3)} \textrm{\ \ using Lemma \ref{lemma1}}\\ &=& D(q^3)D(q)^2\\ &\equiv& D(q^3)(D(q^9)+qY(q^3))^2\pmod{3} \textrm{\ \ using Lemma \ref{lemma2}}\\ &=& D(q^3)(D(q^9)^2+2qD(q^9)Y(q^3)+q^2Y(q^3)^2). \end{eqnarray*} This implies that \allowdisplaybreaks \begin{eqnarray*} \sum_{n\ge0}\overline{p}(9n)q^n &\equiv& D(q)D(q^3)^2\pmod{3}\\ &\equiv& D(q^3)^2(D(q^9)+qY(q^3))\pmod{3} \textrm{\ \ using Lemma \ref{lemma2}}. \end{eqnarray*} We can now prove both congruence properties stated in Theorem \ref{thm-machinery} from the last fact above. First, note that we now have $$ \sum_{n\ge0}\overline{p}(27n+18)q^n \equiv 0 \pmod{3}. $$ This is clear because there are no powers of $q$ in the last line above that are congruent to 2 modulo 3. Secondly, \begin{eqnarray*} \sum_{n\ge0}\overline{p}(27n)q^n &\equiv& D(q)^2D(q^3) \pmod{3}\\ &\equiv& \sum_{n\ge0}\overline{p}(3n)q^n\pmod{3} \end{eqnarray*} from the work above. This completes the proof of Theorem \ref{thm-machinery}. \end{proof} \section*{\normalsize 3. Closing Thoughts} \addtocounter{section}{+1} \addtocounter{Lemma}{-3} We close this note with two brief comments. First, we note that since the sequence $9^\alpha(27n+18)$ does not contain squares and since $\overline{p}(n)\equiv0\pmod4$ unless $n$ is a square, we can actually strengthen Theorem \ref{infinite-family-mod12} as follows: \begin{Theorem} For all $n\geq 0$ and all $\alpha\geq 0,$ $$\overline{p}(9^\alpha(27n+18)) \equiv 0 \pmod{12}.$$ \end{Theorem} Second, it is apparent (computationally) that other congruences with moduli which are not powers of 2 are satisfied by $\overline{p}(n).$ We hope in the future to prove some of these as well. \begin{thebibliography}{99} \footnotesize %\bibitem{Andrews} %G.E. Andrews, %{\it The Theory of Partitions}, %Addison-Wesley, 1976. %\bibitem{CH} %S. Cooper and M. D. Hirschhorn, On some sum--to--product identities, %\emph{Bull. Austral. Math. Soc.} {\bf 63} (2001), 353--365. \bibitem{CL} S. Corteel and J. Lovejoy, Overpartitions, \emph{Trans. Amer. Math. Soc.} {\bf 356} (2004), 1623-1635. \bibitem{CLY} S. Corteel, J. Lovejoy, and A. Yee, Overpartitions and generating functions for generalized Frobenius partitions, \emph{Mathematics and Computer Science III: Algorithms, Trees, Combinatorics, and Probabilities} (2004) 15-24. \bibitem{Fortin} J.-F. Fortin, P. Jacob, and P. Mathieu, Jagged partitions, to appear in \emph{The Ramanujan Journal}. \bibitem{HS-over} M. D. Hirschhorn and J. A. Sellers, Arithmetic Relations for Overpartitions, \emph{J. Comb. Math. Comb. Comp.} {\bf 53} (2005), 65--73. \bibitem{Lovejoy1} J. Lovejoy, Gordon's theorem for overpartitions, \emph{J. Comb. Theory Ser. A} {\bf 103}, no. 2 (2003), 393--401. \bibitem{Lovejoy2} J. Lovejoy, Overpartition theorems of the Rogers-Ramaujan type, \emph{J. London Math. Soc.} {\bf 69} (2004), 562-574. \bibitem{Lovejoy3} J. Lovejoy, Overpartitions and real quadratic fields, \emph{J. Number Theory} {\bf 106} (2004), 178-186. \bibitem{Mahlburg} K. Mahlburg, The Overpartition Function Modulo Small Powers of 2, \emph{Discrete Mathematics} {\bf 286}, no. 3 (2004), 263-267. \end{thebibliography} \end{document}