Complementary Schur asymptotics for partitions
From MaRDI portal
Abstract: We deduce from the strong form of the Hardy--Ramanujan asymptotics for the partition function an asymptotics for , the number of partitions of that do not use parts from a finite set of positive integers. We apply this to construct highly oscillating partition ideals.
Recommendations
Cites work
- Analytic combinatorics
- Bijective proofs of some classical partition identities
- Efficient implementation of the Hardy-Ramanujan-Rademacher formula
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- On partitions without small parts
- On the number of partitions of n without a given subsum. I
- PIE-sums: A combinatorial tool for partition theory
Cited in
(2)
This page was built for publication: Complementary Schur asymptotics for partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2005695)