Abstract
We show that the class of integer partitions that cannot be represented as convex combinations of two partitions of the same number coincides with the class of knapsack partitions and the class of Sidon multisets, which is related to sum-free sets and standard Sidon sets. The decision problem for knapsack partitions is proved to be co-NP-complete, and, therefore, it cannot be solved in polynomial time unless P = NP. Bibliography: 13 titles.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
