Creating permutations of all possible non-repeated combinations within N elements
Mostra commenti meno recenti
Dear all, was wondering if i) there is a name for the following combinatorics problem; ii) is there a way to code it within Matlab and generate all results?
I have N elements, and would like to generate all possible permutations of non-repeated combinations with varying bracket sizes. For instance, for N = 5 elements, we have the following possible permutations:
- Max group combination size of 5: (ABCDE)
- Max group combination size of 4: (A) (BCDE); (BCDE) (A); (B) (ACDE); (ACDE) (B); (C) (ABDE); (D) (ABCE); (E)(ABCD) etc.
- Max group combination size of 3: (AB) (CDE); (A) (B) (CDE); (AC) (BCD); (A) (C) (BCD) etc.
- Max group combination size of 2: (AB) (CD) (E); (AB) (C) (D) (E); (AB) (CE) (D) etc.
- Max group combination size of 1: (A) (B) (C) (D) (E); (B) (C) (D) (E) (A); etc.
Note that, within the brackets, order does not matter i.e. they are just combinations. But beyond the brackets, permutation must occur, for instance, (AB) (CDE) and (CDE) (AB) are two possible permutations.
My apologies in advance for the unclear/vague wording. Thank you for your help!
Risposta accettata
Più risposte (1)
the cyclist
il 28 Gen 2016
0 voti
This is known as "partitioning" a set. I'm not sure if there is anything in base MATLAB to do this, but there are some entries on the File Exchange for doing this. Here is one.
1 Commento
eugene479
il 29 Gen 2016
Categorie
Scopri di più su Nearest Neighbors in Centro assistenza e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!