{
  "id": "math/0403121",
  "version": "v1",
  "published": "2004-03-07T14:34:25.000Z",
  "updated": "2004-03-07T14:34:25.000Z",
  "title": "Analytic proof of the partition identity $A_{5,3,3}(n) = B^0_{5,3,3}(n)$",
  "authors": [
    "Padmavathamma",
    "B. M. Chandrashekara",
    "R. Raghavendra",
    "C. Krattenthaler"
  ],
  "comment": "AmS-LaTeX; 9 pages",
  "journal": "Ramanujan J. 15 (2008), 77-86.",
  "categories": [
    "math.CO",
    "math.CA"
  ],
  "abstract": "In this paper we give an analytic proof of the identity $A_{5,3,3}(n) =B^0_{5,3,3}(n)$, where $A_{5,3,3}(n)$ counts the number of partitions of $n$ subject to certain restrictions on their parts, and $B^0_{5,3,3}(n)$ counts the number of partitions of $n$ subject to certain other restrictions on their parts, both too long to be stated in the abstract. Our proof establishes actually a refinement of that partition identity. The original identity was first discovered by the first author jointly with M. Ruby Salestina and S. R. Sudarshan in [\"A new theorem on partitions,\" Proc. Int. Conference on Special Functions, IMSC, Chennai, India, September 23-27, 2002; to appear], where it was also given a combinatorial proof, thus responding a question of Andrews.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-03-07T14:34:25.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A15",
      "05A17",
      "05A19",
      "11P81",
      "11P82",
      "11P83"
    ],
    "keywords": [
      "partition identity",
      "analytic proof",
      "restrictions",
      "combinatorial proof",
      "proof establishes"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "LaTeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2004math......3121P"
    }
  }
}