Any ideas on expanded results for SetPartitions in discrete-combinatoria
- To: mathgroup at smc.vnet.net
- Subject: [mg67026] Any ideas on expanded results for SetPartitions in discrete-combinatoria
- From: Ike <ike at techsensei.com>
- Date: Wed, 7 Jun 2006 05:09:54 -0400 (EDT)
- Sender: owner-wri-mathgroup at wolfram.com
Looking for suggestions...
SetPartitions drops partitions that have "overlaps", any ideas on how to
modify or recreate a SetPartitions function that doesn't drop these?
For example
SetPartitions[{A,B,C}]
Generates:
{{{A, B, C}}, {{A}, {B, C}}, {{A, B}, {C}}, {{A, C}, {B}}, {{A}, {B}, {C}}}
What it is missing (for my needs) are the following:
{{A,B}, {B, C}}, {{A,C}, {B, C}}, {{A,B}, {A, C}}, {{A,B}, {B, C},{A,C}}
I have tried doing this:
SetPartitions[{A,A,B,B,C,C}] which adds them but then I need a quick way
to delete the subsets that have duplicate elemenets.
Either way will get me where I need to be. But I can not figure it out.
Thanks in advance for any help.
Ike
wde at pdx.edu