Abstract simplicial complex
In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family. It is a purely combinatorial description of the geometric notion of a simplicial complex. For example, in a 2-dimensional simplicial complex, the sets in the family are the triangles (sets of size 3), their edges (sets of size 2), and their vertices (sets of size 1).
Geometric realization of a 3-dimensional abstract simplicial complex In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family. It is a purely combinatorial description of the geometric notion of a simplicial complex.[1] For example, in a 2-dimensional simplicial complex, the sets in the family are the triangles (sets of size 3), their edges (sets of size 2), and their vertices (sets of size 1). In the context of matroids…
saved by
related reading
- Independence systemen.wikipedia.org
- matroids.pdfpeople.math.harvard.edu
- Matroiden.wikipedia.org
- thesis-FIXED.pdfhjaltman.github.io
- Matroid representationen.wikipedia.org
- Simplex - Wikipediaen.wikipedia.org
- How to collapse a simplicial complex [0.2cm] Theory and practicegiovannipaolini.org
- Cyclomatic complexityen.wikipedia.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Arithmetical hierarchy - Wikipediaen.wikipedia.org
- Betti number - Wikipediaen.wikipedia.org
- nullstellensatzweb.math.princeton.edu