By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
440,675 Members | 2,255 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 440,675 IT Pros & Developers. It's quick & easy.

exhaustive subsets

P: n/a
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


Jul 18 '05 #1
Share this Question
Share on Google+
4 Replies


P: n/a
In article <ma************************************@python.org >,
"Brett Calcott" <br***@coombs.anu.edu.au> wrote:
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?


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
ho******@python.org>

--
David Eppstein http://www.ics.uci.edu/~eppstein/
Univ. of California, Irvine, School of Information & Computer Science
Jul 18 '05 #2

P: n/a
google for Sterling numbers

"Brett Calcott" <br***@coombs.anu.edu.au> wrote in message
news:ma************************************@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
|
|
|
|
Jul 18 '05 #3

P: n/a
"Elaine Jackson" <el***************@home.com> wrote in message news:<zQZoc.474813$Ig.279550@pd7tw2no>...
google for Sterling numbers


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.
Jul 18 '05 #4

P: n/a
>
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
ho******@python.org>


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

Jul 18 '05 #5

This discussion thread is closed

Replies have been disabled for this discussion.