Combinatorial Algebraic Topology (Algorithms and Computation by Dmitry Kozlov

By Dmitry Kozlov

This quantity is the 1st accomplished therapy of combinatorial algebraic topology in e-book shape. the 1st a part of the ebook constitutes a fast stroll during the major instruments of algebraic topology. Readers - graduate scholars and dealing mathematicians alike - will most likely locate relatively invaluable the second one half, which includes an in-depth dialogue of the foremost learn ideas of combinatorial algebraic topology. even supposing purposes are sprinkled in the course of the moment half, they're vital concentration of the 3rd half, that is solely dedicated to constructing the topological constitution idea for graph homomorphisms.

Show description

Read or Download Combinatorial Algebraic Topology (Algorithms and Computation in Mathematics) PDF

Best geometry and topology books

Low-dimensional geometry: From Euclidean surfaces to hyperbolic knots

The research of third-dimensional areas brings jointly components from numerous components of arithmetic. the main outstanding are topology and geometry, yet components of quantity thought and research additionally make appearances. long ago 30 years, there were awesome advancements within the arithmetic of third-dimensional manifolds.

Extra info for Combinatorial Algebraic Topology (Algorithms and Computation in Mathematics)

Example text

2. The horizontal levels correspond to the successive steps of the algorithm computing the value of the function f . One way to think about the barycentric subdivision, which can come in handy in certain situations, is the following. First, we define the barycentric subdivision in the standard n-simplex. By definition, it is the simplicial complex obtained by stratifying the standard n-simplex with the intersections with the hyperplanes xi = xj , for 1 ≤ i < j ≤ n + 1. The new vertices will be in barycenters (also called the centers of gravity) of the subsimplices of the standard n-simplex, hence the name barycentric.

One way to think of this gluing process is the following. We have a collection of simplices {∆σ }σ∈∆ , together with inclusion maps iσ,τ : ∆σ ֒→ ∆τ , whenever σ is a proper subset of τ . The space |∆| is obtained from the disjoint union of the simplices by one extra condition: we would like to identify two points whenever one of them maps to the other one by one of these inclusion maps. Of course, one easy way to satisfy such a condition is simply to identify all points, and to obtain just a point as the resulting quotient space.

Let ∆1 = ∆2 = {∅, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}}. Then any f : [3] → [3] is a simplicial map, whereas the same is not true for ∆1 = ∆2 = {∅, {1}, {2}, {3}, {1, 2}, {1, 3}}. Let us make some observations on the properties of simplicial maps: • • • • • • • The identity map on the set of vertices is always a simplicial map from the abstract simplicial complex onto itself. The composition of two simplicial maps is again a simplicial map, since a simplex maps to a simplex, which again maps to a simplex.

Download PDF sample

Rated 4.93 of 5 – based on 41 votes