Formulas for the number of partitions related to the Rogers-Ramanujan identities
From MaRDI portal
Publication:5043943
DOI10.1080/09720529.2020.1819678zbMath1496.05006OpenAlexW3100094938MaRDI QIDQ5043943
Wagner Ferreira Santos, Raphael Gustavo D'Almeida Vilamiu, Mateus Alegri
Publication date: 6 October 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2020.1819678
Combinatorial aspects of partitions of integers (05A17) Analytic theory of partitions (11P82) Partition identities; identities of Rogers-Ramanujan type (11P84)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A formula for the partition function that ``counts
- Bijective proofs using two-line matrix representations for partitions
- New two-line arrays representing partitions
- New insight into the partition theory of integers related to problems of thermodynamics and mesoscopic physics
- On an elementary proof of some asymptotic formulas in the theory of partitions
- Bijections between Lattice Paths and Plane Partitions
- Efficient implementation of the Hardy–Ramanujan–Rademacher formula
This page was built for publication: Formulas for the number of partitions related to the Rogers-Ramanujan identities