Computational Topology Flashcards
1
Q
Define the geometric realization of an abstract simplicial complex.
A
2
Q
Define simplicial maps.
A
3
Q
Define a star and a link of a simplex.
A
4
Q
Describe the algorithm to decide whether a simplicial complex K triangulates a surface.
A
5
Q
State and prove the Heawood Bound with n the number of vertices of K.
A
6
Q
Define Nerve Complex of K.
A
7
Q
State and prove the nerve theorem.
A
8
Q
Let K be a simplicial complex. Define a standard covering of K
A
9
Q
Define tautness of a simplicial complex.
A
10
Q
A
11
Q
Define the cect complex.
A
