Matroid
In combinatorics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid axiomatically, the most significant being in terms of: independent sets; bases or circuits; rank functions; closure operators; and closed sets or flats. In the language of partially ordered sets, a finite simple matroid is equivalent to a geometric lattice.
In combinatorics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid axiomatically, the most significant being in terms of independent sets, bases or circuits, rank functions, closure operators, and closed sets or flats. In the language of partially ordered sets, a finite simple matroid is equivalent to a geometric lattice. Matroid theory borrows extensively from the terms used in both linear algebra and graph theory, largely because it is the abstraction of various notions of central…
saved by
related reading
- matroids.pdfpeople.math.harvard.edu
- Matroid representationen.wikipedia.org
- Independence systemen.wikipedia.org
- Abstract simplicial complexen.wikipedia.org
- Pen and Paper Exercises in Machine Learningarxiv.org
- Napkin.pdfvenhance.github.io
- Tim Gowers - Two culturesdpmms.cam.ac.uk
- nullstellensatzweb.math.princeton.edu
- Zorn's lemma - Wikipediaen.wikipedia.org
- https://www.deeplearningbook.org/contents/linear_algebra.htmldeeplearningbook.org
- balogh containersarxiv.org
- How Sridhar Thinkssridharramesh.github.io