Efficient calculation of the number of partitions of the set into subsets satisfying
Consider the set [Formula: see text]. We are interested in determining the number of partitions of this set into subsets of three elements each, where the sum of two of the elements equals the third. To achieve this, we provide a set of criteria that must be met by any valid partition. These criteri...
| Published in: | Mathematics Open |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
World Scientific Publishing
2024-01-01
|
| Subjects: | |
| Online Access: | https://www.worldscientific.com/doi/10.1142/S2811007224500056 |
| Summary: | Consider the set [Formula: see text]. We are interested in determining the number of partitions of this set into subsets of three elements each, where the sum of two of the elements equals the third. To achieve this, we provide a set of criteria that must be met by any valid partition. These criteria then can be used for efficient pruning in the search for these partitions. Specifically, we enumerate all such partitions for [Formula: see text] and [Formula: see text], and added these new terms to the series A108235 in the Online Encyclopedia of Integer Sequences. |
|---|---|
| ISSN: | 2811-0072 |