On the number of partitions of \(n\) without a given subsum. I

DOI10.1016/0012-365X(89)90086-1zbMath0673.05007OpenAlexW2004119784WikidataQ105858099 ScholiaQ105858099MaRDI QIDQ1120577

Paul Erdős, András Sárközy, Jean Louis Nicolas

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90086-1

zbMATH Keywords

number of partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items (5)

Complementary Schur asymptotics for partitions ⋮ On the sets represented by the partitions of an integer \(n\) ⋮ Jean-Louis Nicolas and the partitions ⋮ Weak asymptotic formulas for partitions free of small summands. II ⋮ Arithmetic properties of summands of partitions. II

Cites Work

• Sur les sous-sommes d'une partition
• Addendum to "On Some Algebraic Properties of the Bessel Polynomials"
• On partitions into distinct parts ≥ Y
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of partitions of \(n\) without a given subsum. I