Partitions with fixed largest hook length
DOI10.1007/s11139-016-9868-zzbMath1379.05009arXiv1604.04028OpenAlexW2963817203MaRDI QIDQ682005
Publication date: 13 February 2018
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.04028
Fibonacci numberEuler's pentagonal number theoremEuler's partition theoremRogers-Ramanujan identityRogers-fine identity
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Congruences; primitive roots; residue systems (11A07) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Core partitions into distinct parts and an analog of Euler's theorem
- Combinatorial proofs of identities in Ramanujan's lost notebook associated with the Rogers-Fine identity and false theta functions
- Structural and enumerative properties of the Fibonacci cubes
- On a partition problem of H. L. Alder
- Two theorems of Gauss and allied identities proved arithmetically
- Partitions with prescribed hooksets
- Proof of the Alder-Andrews conjecture
- Overpartitions
- Partitions with difference conditions and Alder's conjecture
This page was built for publication: Partitions with fixed largest hook length