Optimizing diversity

Details Optimizing diversity Optimizing diversity

2007-11-19

arxiv.org/abs/0711.2998v1

Computer Science

Discrete Mathematics

Scientific paper

We consider the problem of minimizing the size of a family of sets G such that every subset of 1,...,n can be written as a disjoint union of at most k members of G, where k and n are given numbers. This problem originates in a real-world application aiming at the diversity of industrial production. At the same time, the minimum of G so that every subset of 1,...,n is the union of two sets in G has been asked by Erdos and studied recently by Furedi and Katona without requiring the disjointness of the sets. A simple construction providing a feasible solution is conjectured to be optimal for this problem for all values of n and k and regardless of the disjointness requirement; we prove this conjecture in special cases including all (n,k) for which n <= 3k holds, and some individual values of n and k.

Affiliated with

Also associated with

No associations

Rating

Optimizing diversity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimizing diversity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing diversity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-116482