Question: combinatorics

Any help with this question will be much appreciated. I have a set with 15 elements and i have broke them down into all the possible subsets using the powerset function. I have also assigned the elements to a vector. I want to sum all the elements of each subset. ie The set {a,b,c,d} has all the subsets {{},{a},{b},{c},{a,b},{a,c},{b,c},{a,b,c}} with these assignments let us say a:=[1,0,0], b:=[0,1,0], c:=[0,0,1] I want results such that i have a, [1,0,0] b, [0,1,0] c, [0,0,1] a+b, [1,1,0] a+c, [1,0,1] b+c, [0,1,1] a+b+c, [1,1,1] Is there any way to write a Maple function to carry this out? I have tried looking around and can't really find anything similar that i could adapt. Many thanks in advance.
Please Wait...