Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Bijective Proofs of ...
Conference paper

Bijective Proofs of Partition Identities of MacMahon, Andrews, and Subbarao

Shishuo Fu (1) (2), James Sellers (3) (4)
(1) Chongqing University (CHINA)
(2) Chongqing University [Chongqing]
(3) Pennsylvania State University
(4) Pennsylvania State University [State College, PA]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2013
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Proceedings
DOI
10.46298/dmtcs.2400
License
https://about.hal.science/hal-authorisation-v1
Indicators
595
Views
1412
Downloads

Bijective Proofs of Partition Identities of MacMahon, Andrews, and Subbarao

Shishuo Fu (1) (2), James Sellers (3) (4)
(1) Chongqing University (CHINA)
(2) Chongqing University [Chongqing]
(3) Pennsylvania State University
(4) Pennsylvania State University [State College, PA]
Abstract
English
We revisit a classic partition theorem due to MacMahon that relates partitions with all parts repeated at least once and partitions with parts congruent to $2,3,4,6 \pmod{6}$, together with a generalization by Andrews and two others by Subbarao. Then we develop a unified bijective proof for all four theorems involved, and obtain a natural further generalization as a result.
French
Nous revisitons un théorème de partitions d'entiers dû à MacMahon, qui relie les partitions dont chaque part est répétée au moins une fois et celles dont les parts sont congrues à $2, 3, 4, 6 \pmod{6}$, ainsi qu'une généralisation par Andrews et deux autres par Subbarao. Ensuite nous construisons unepreuve bijective unifiée pour tous les quatre théorèmes ci-dessus, et obtenons de plus une généralisation naturelle.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • partition
  • residue classes
  • bijection
  • generating function
Cited by

Source: OpenCitations

  • On Generalizations of Theorems of MacMahon and Subbarao

    Annals of Combinatorics

    Authors : Darlison Nyirenda ORCID, Beaullah Mugwangwavari

    Journal reference : Volume 27, 2022, pp. 373-386

    DOI : 10.1007/s00026-022-00592-5
  • A Variant of IdentityFinder and Some New Identities of Rogers–Ramanujan–MacMahon Type

    Annals of Combinatorics

    Authors : Shashank Kanade ORCID, Debajyoti Nandi, Matthew C. Russell

    Journal reference : Volume 23, 2019, pp. 807-834

    DOI : 10.1007/s00026-019-00474-3
Preview
Loading PDF preview...