|
Balanced Minimum Covers of a Finite Set |
|---|
Alewyn P Burger1 & Jan H van Vuuren2
Abstract
In this paper a method of enumeration for n-balanced, labelled, minimum covers of a finite set of m indistinguishable elements is developed. The method is then used to tabulate the number of such covers for small values of m and n by means of a generating function.
An electronic version of the complete paper may be obtained here: [pdf].
Affiliations
1 Department of Logistics, Stellenbosch University, Private Bag X1, Matieland, 7602, Republic of South Africa, email: apburger@sun.ac.za.
2 Department of Logistics, Stellenbosch University, Private Bag X1, Matieland, 7602, Republic of South Africa,
email: vuuren@sun.ac.za.