seeking info on restricted arrangement problems/combinatorics

[ Follow Ups ] [ Post Followup ] [ Netlib Discussion Forum ] [ FAQ ]

Posted by Mohsen Maesumi on May 04, 1998 at 17:59:28:

I appreciate any pointers to literature regarding the following problem
or type of question:

T distinguishable balls are to be placed in C indistinguishable
containers so that there are B balls in each container ( we
assume T=CB).
How many such rearrangements can be made if over all
rearrangements no two balls can be in the same container more
than once? (Therefore , in each rearrangement, the balls in
each container have never bben together before.)

Is there an algorithm for producing all arrangements?
Mohsen Maesumi

Follow Ups: