| Line 27: | Line 27: | ||
[[Image:Simplicialcomplexexample.png]]<br> | [[Image:Simplicialcomplexexample.png]]<br> | ||
| − | <br> A graph is a thing made of point, some of which are linked by line segments. Generalize the idea to points that can also be grouped into triangles, or tetrahedra, etc. | + | ---- |
| + | |||
| + | '''<u>Simplicial Complexes:</u>'''<u</u> | ||
| + | |||
| + | In an connected planar graph, Euler's Formula E + 2 = V + F for which V is the number of vertices, F is the number of faces, and E is the number of edges holds. | ||
| + | |||
| + | <br> | ||
| + | |||
| + | A graph is a thing made of point, some of which are linked by line segments. Generalize the idea to points that can also be grouped into triangles, or tetrahedra, etc. | ||
For graphs we know Euler's formula E+2=V+F. Give this a geometric meaning. | For graphs we know Euler's formula E+2=V+F. Give this a geometric meaning. | ||
| Line 37: | Line 45: | ||
<br> | <br> | ||
| − | [[1]] Discrete Mathematics and Its Applications, Kenneth H. Rosen.<br> | + | [[1]] Found in Discrete Mathematics and Its Applications, Kenneth H. Rosen.<br> |
| − | [[2]] http://mathworld.wolfram.com/Simplex.html.<br> | + | [[2]] Found at http://mathworld.wolfram.com/Simplex.html.<br> |
[[3]] Found at http://mathworld.wolfram.com/SimplicialComplex.html, adapted from J. R. Munkres, "Simplicial Complexes and Simplicial Maps," 1993.<br> | [[3]] Found at http://mathworld.wolfram.com/SimplicialComplex.html, adapted from J. R. Munkres, "Simplicial Complexes and Simplicial Maps," 1993.<br> | ||
Revision as of 15:54, 27 April 2014
Introduction:
A simplicial complex is a special type of graph wherein the notion of a vertex is replaced with a new higher dimensional analog, called a simplex. A simplex is, in simplest terms, an n-dimensional collection of vertices enclosed by faces.
Definitions:
Graph:
"A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes) and E, a set of edges. Each edge has either one or two vertices associated with it, called its endpoints. An edge is said to connect its endpoints."1
Simplex:
"A simplex...is the generalization of a tetrahedral region of space to n dimensions."2
Simplicial Complex:
"...a simplicial complex K in Rnis a collection of simplices in Rn such that...every face of K is in K, and...the intersection of any two faces of K is a face of each of them."3
Simplicial Complexes:<u</u>
In an connected planar graph, Euler's Formula E + 2 = V + F for which V is the number of vertices, F is the number of faces, and E is the number of edges holds.
A graph is a thing made of point, some of which are linked by line segments. Generalize the idea to points that can also be grouped into triangles, or tetrahedra, etc.
For graphs we know Euler's formula E+2=V+F. Give this a geometric meaning.
Discuss (maybe in the 2-dimensional case) what might replace this formula compare a "triangulated" sphere to a "triangulated" doughnut.
1 Found in Discrete Mathematics and Its Applications, Kenneth H. Rosen.
2 Found at http://mathworld.wolfram.com/Simplex.html.
3 Found at http://mathworld.wolfram.com/SimplicialComplex.html, adapted from J. R. Munkres, "Simplicial Complexes and Simplicial Maps," 1993.
