Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, no parts of such partitions can be written as the sum of different integers which are not parts. We address in this paper the algorithmic aspects related to unrefinable partitions, such as testing whether a given partition is unrefinable or not and enumerating all the partitions whose sum is a given number. We design two algorithms to solve the two mentioned problems and we discuss their complexity.
翻译:无法修复的分区是将分割区分成不同部分的子集,它们满足了额外的不可修复属性。更确切地说,这种分割区的任何部分都不能被写成不是部件的不同整数的总和。我们在本文中论述与不可修复的分区有关的算法方面,例如测试给定的分区是否不可修复,并列出其总和是给定数字的所有分区。我们设计了两种算法来解决所提到的两个问题,并讨论其复杂性。