BG-ranks and 2-cores

Simple item page
dc.creatorChen, William Y. C.
dc.creatorJi, Kathy Q.
dc.creatorWilf, Herbert S.
dc.date2006-05-17
dc.date2006-05-17
dc.date.accessioned2026-07-07T07:14:20Z
dc.date.available2026-07-07T07:14:20Z
dc.descriptionWe find the number of partitions of $n$ whose BG-rank is $j$, in terms of $pp(n)$, the number of pairs of partitions whose total number of cells is $n$, giving both bijective and generating function proofs. Next we find congruences mod 5 for $pp(n)$, and then we use these to give a new proof of a refined system of congruences for $p(n)$ that was found by Berkovich and Garvan.
dc.identifierhttps://arxiv.org/abs/math/0605474
dc.identifierhttp://arxiv.org/abs/math/0605474
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112836
dc.subjectCombinatorics
dc.subject05A17, 05A15
dc.titleBG-ranks and 2-cores
dc.typetext

Files

Collections

arXiv