exhaustive subsets

I've found some python solutions to find the set of subsets for a given set,
but how do you find the set of the set of subsets whose union is the given
set and whose intersections is the empty set.

ie. Given a cake divided into 6 unique pieces (0-5), how many different ways
can I distribute the cake so that there are no pieces left. eg.

((0), (1,2,3,4))
or ((0),(1),(2,3,4))
or ((0,1),(2,3),(4))
or ((0,4),(1),(2,3))

Is there a name for this problem?

Cheers,
Brett

--
Brett Calcott
Philosophy Program, RSSS, ANU
Canberra, ACT 0200, AUSTRALIA

re: exhaustive subsets

In article <mailman.0.1084510656.27251.python-list@python.org>,
"Brett Calcott" <brett@coombs.anu.edu.au> wrote:
[color=blue]
> I've found some python solutions to find the set of subsets for a given set,
> but how do you find the set of the set of subsets whose union is the given
> set and whose intersections is the empty set.
>
> ie. Given a cake divided into 6 unique pieces (0-5), how many different ways
> can I distribute the cake so that there are no pieces left. eg.
>
> ((0), (1,2,3,4))
> or ((0),(1),(2,3,4))
> or ((0,1),(2,3),(4))
> or ((0,4),(1),(2,3))
>
> Is there a name for this problem?[/color]

Partitions? Didn't we just have a discussion about them here a week or
two ago?
<http://groups.google.com/groups?thre...2936.25742.pyt
hon-list@python.org>

--
David Eppstein http://www.ics.uci.edu/~eppstein/
Univ. of California, Irvine, School of Information & Computer Science

re: exhaustive subsets

google for Sterling numbers

"Brett Calcott" <brett@coombs.anu.edu.au> wrote in message
news:mailman.0.1084510656.27251.python-list@python.org...
| I've found some python solutions to find the set of subsets for a given set,
| but how do you find the set of the set of subsets whose union is the given
| set and whose intersections is the empty set.
|
| ie. Given a cake divided into 6 unique pieces (0-5), how many different ways
| can I distribute the cake so that there are no pieces left. eg.
|
| ((0), (1,2,3,4))
| or ((0),(1),(2,3,4))
| or ((0,1),(2,3),(4))
| or ((0,4),(1),(2,3))
|
| Is there a name for this problem?
|
| Cheers,
| Brett
|
| --
| Brett Calcott
| Philosophy Program, RSSS, ANU
| Canberra, ACT 0200, AUSTRALIA
|
|
|
|

re: exhaustive subsets

"Elaine Jackson" <elainejackson7355@home.com> wrote in message news:<zQZoc.474813$Ig.279550@pd7tw2no>...[color=blue]
> google for Sterling numbers
>[/color]

I'm pretty sure you mean "Stirling numbers". When I followed your
suggestion I got a lot of pages about businesses reporting "sterling
numbers" in their quarterly reports, and about marijuana, oddly
enough.

re: exhaustive subsets

>[color=blue]
> Partitions? Didn't we just have a discussion about them here a week or
> two ago?
> <http://groups.google.com/groups?thre...2936.25742.pyt
> hon-list@python.org>
>[/color]

Thanks. Knowing the right terminology makes all the difference to doing a
search :)