Independence system
en.wikipedia.org · 118 words · saved by 1 readers
In combinatorial mathematics, an independence system
From Wikipedia, the free encyclopedia In combinatorial mathematics, an independence system is a pair , where is a finite set and is a collection of subsets of (called the independent sets or feasible sets) with the following properties: The empty set is independent, i.e., . (Alternatively, at least one subset of is independent, i.e., .) Every subset of an independent set is independent, i.e., for each , we have . This is sometimes called the hereditary property, or downward-closedness. Another term for an independence system is an abstract simplicial complex. Relation to…
saved by
related reading
- Abstract simplicial complexen.wikipedia.org
- Matroiden.wikipedia.org
- Matroid representationen.wikipedia.org
- matroids.pdfpeople.math.harvard.edu
- Partially ordered seten.wikipedia.org
- Ergodicity - Wikipediaen.wikipedia.org
- Schröder–Bernstein theorem - Wikipediaen.wikipedia.org
- Support (mathematics)en.wikipedia.org
- Arithmetical hierarchy - Wikipediaen.wikipedia.org
- A conjecture in extremal combinatoricsusers.encs.concordia.ca
- Coset - Wikipediaen.wikipedia.org
- Well-order - Wikipediaen.wikipedia.org