Matroid

In combinatorial mathematics, a matroid is a structure that captures the essence of a notion of "independence" (hence independence structure) that generalizes linear independence in vector spaces. There are many equivalent ways to define a matroid (that is one way we know the concept is important!); the most significant include those in terms of independent sets, bases, closed sets (flats), the closure operator, circuits (minimal dependent sets), and the rank function.

Related Topics:
Combinatorial - Mathematics - Linear independence - Vector space

~ ~ ~ ~ ~ ~ ~ ~ ~ ~