Some remarks on 3-partitions of multisets
From MaRDI portal
Publication:1739914
DOI10.1016/j.endm.2018.11.001zbMath1414.05036OpenAlexW2904926060MaRDI QIDQ1739914
Ovidiu Bagdasar, Dorin Andrica
Publication date: 29 April 2019
Full work available at URL: https://doi.org/10.1016/j.endm.2018.11.001
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial optimization (90C27) Other combinatorial number theory (11B75) Asymptotic enumeration (05A16)
Related Items
Remarks on a family of complex polynomials, Note on the number of ordered \(k\)-partitions of multiset \(M_d[n\) with equal sums], On some new arithmetic functions involving prime divisors and perfect powers, On \(k\)-partitions of multisets with equal sums
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reduction of the three-partition problem
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Some Unexpected Connections Between Analysis and Combinatorics
- On a Conjecture of Andrica and Tomescu