Hi All,(adsbygoogle = window.adsbygoogle || []).push({});

Say we have a finite collection ## S_1,...,S_n ## of sets , which are not all pairwise disjoint , and we want

to find the minimal collection of the ## S_j ## whose union is ## \cup S_j ## . Is there

any theorem, result to this effect?

I would imagine that making the ## S_j## pairwise-disjoint would help. Is there some other way?

I think I remember some results about results elated to minimal systems of representatives, maybe would also work?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# "Minimal Cover" in Finite Collection of Sets?

Loading...

Similar Threads - Minimal Cover Finite | Date |
---|---|

A Minimal Covering Set? | Oct 9, 2017 |

I Fitting a line by minimizing absolute deviation | Jul 7, 2017 |

Minimizing Chi^2, Singular Matrix problem | Jan 25, 2016 |

Find Function/Transform for signal that minimizes CV of data | Jul 19, 2015 |

Binary classification: error probability minimization | Apr 12, 2015 |

**Physics Forums - The Fusion of Science and Community**