On \(k\)-partitions of multisets with equal sums

DOI10.1007/s11139-021-00418-7zbMath1467.05010OpenAlexW3157838656MaRDI QIDQ2038988

Ovidiu Bagdasar, Dorin Andrica

Publication date: 7 July 2021

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11139-021-00418-7

zbMATH Keywords

generating functionasymptotic formulamultiset3-signum equationsuperelliptic Diophantine equation\(k\)-partition of a multiset

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Other combinatorial number theory (11B75) Asymptotic enumeration (05A16) Diophantine equations (11D99)

Related Items (2)

Exact value of integrals involving product of sine or cosine function ⋮ Note on the number of ordered \(k\)-partitions of multiset \(M_d[n\) with equal sums]

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitions of multisets. II
• Partition bijections, a survey
• Some remarks on 3-partitions of multisets
• Partitions of multisets
• The number of partitions of a set and superelliptic Diophantine equations
• On an elementary proof of some asymptotic formulas in the theory of partitions
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• An elliptic Diophantine equation from the study of partitions
• Recurrent Sequences
• Some Unexpected Connections Between Analysis and Combinatorics
• On a Conjecture of Andrica and Tomescu

This page was built for publication: On \(k\)-partitions of multisets with equal sums