Transactions of the American Mathematical Society · 1988 · 214 citations · 18 references
Natural SciencesComputer ScienceMathematicsCombinatoricsDiscrete MathematicsNumber TheoryCombinatorial Number TheoryEnumerative CombinatoricsGenerating FunctionsInteger PartitionsModular FormsPartition CongruencesPartition Generating FunctionsPolynomial CongruencesRamanujan SumRestricted PartitionsRogers-ramanujan Identities
Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="p left-parenthesis n right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">p(n)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> denote the number of unrestricted partitions of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n"> <mml:semantics> <mml:mi>n</mml:mi> <mml:annotation encoding="application/x-tex">n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . The congruences referred to in the title are <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="p left-parenthesis 5 n plus 4 right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mn>5</mml:mn> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mn>4</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">p(5n + 4)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="p left-parenthesis 7 n plus 5 right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mn>7</mml:mn> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mn>5</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">p(7n + 5)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="p left-parenthesis 11 n plus 6 right-parenthesis identical-to 0"> <mml:semantics> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mn>11</mml:mn> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mn>6</mml:mn> <mml:mo stretchy="false">)</mml:mo> <mml:mo> ≡ </mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">p(11n + 6) \equiv 0</mml:annotation> </mml:semantics> </mml:math> </inline-formula> ( <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="mod 5"> <mml:semantics> <mml:mrow> <mml:mo lspace="thickmathspace" rspace="thickmathspace">mod</mml:mo> <mml:mn>5</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">\bmod 5</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="7"> <mml:semantics> <mml:mn>7</mml:mn> <mml:annotation encoding="application/x-tex">7</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="11"> <mml:semantics> <mml:mn>11</mml:mn> <mml:annotation encoding="application/x-tex">11</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , respectively). Dyson conjectured and Atkin and Swinnerton-Dyer proved combinatorial results which imply the congruences <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="mod 5"> <mml:semantics> <mml:mrow> <mml:mo lspace="thickmathspace" rspace="thickmathspace">mod</mml:mo> <mml:mn>5</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">\bmod 5</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="7"> <mml:semantics> <mml:mn>7</mml:mn> <mml:annotation encoding="application/x-tex">7</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . These are in terms of the rank of partitions. Dyson also conjectured the existence of a "crank" which would likewise imply the congruence <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="mod 11"> <mml:semantics> <mml:mrow> <mml:mo lspace="thickmathspace" rspace="thickmathspace">mod</mml:mo> <mml:mn>11</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">\bmod 11</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . In this paper we give a crank which not only gives a combinatorial interpretation of the congruence <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="mod 11"> <mml:semantics> <mml:mrow> <mml:mo lspace="thickmathspace" rspace="thickmathspace">mod</mml:mo> <mml:mn>11</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">\bmod 11</mml:annotation> </mml:semantics> </mml:math> </inline-formula> but also gives new combinatorial interpretations of the congruences <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="mod 5"> <mml:semantics> <mml:mrow> <mml:mo lspace="thickmathspace" rspace="thickmathspace">mod</mml:mo> <mml:mn>5</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">\bmod 5</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="7"> <mml:semantics> <mml:mn>7</mml:mn> <mml:annotation encoding="application/x-tex">7</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . However, our crank is <italic>not</italic> quite what Dyson asked for; it is in terms of certain restricted tri
18
Applications of Basic Hypergeometric Functions
George E. Andrews · SIAM Review · 1974 · 243 citations
Generalized Frobenius partitions
George E. Andrews · Memoirs of the American Mathematical Society · 1984 · 158 citations