Barycentric subdivision

The vertices of the barycentric subdivision of a simplicial complex are its nonempty faces, and its simplices are strict chains of faces.

Table of contents

Iterated barycentric subdivision ( $K^{(r)}$ )

The iterated barycentric subdivisions are defined recursively by

K^{(0)} = K

and

K^{(r + 1)} = (K^{(r)})^{'}

.

Mesh of a simplicial complex ( $μ (K)$ )

For a geometrically realized simplicial complex, its mesh is

μ (K) = sup_{σ \in K} diam ∣ σ ∣.

If

K

n

, barycentric subdivision satisfies

μ (K^{'}) \leq \frac{n}{n + 1} μ (K),

so

μ (K^{(r)}) \to 0

.

Barycentric subdivision of a tetrahedron

The barycentric subdivision of a tetrahedron has f-vector

(f_{0}, f_{1}, f_{2}, f_{3}) = (15, 50, 60, 24) .

Its two-skeleton therefore has Euler characteristic

15 - 50 + 60 = 25

H_{0} ≅ Z

,

H_{1} = 0

, and

H_{2} ≅ Z^{24}

.

 Ancestors (7)

 Incoming links (14)

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Barycentric subdivision by

Wikipedia Bot  1

Barycentric subdivision is a technique used in the field of algebraic topology and geometry, particularly when working with simplicial complexes and triangulations. It involves a process that refines a simplicial complex by adding additional vertices and simplices based on the original structure. Here’s how barycentric subdivision works in detail: 1. **Starting Structure**: Begin with a simplicial complex, which is a collection of simplices (points, line segments, triangles, etc.) that satisfy certain properties.

 Read the full article

  See all articles in the same topic Create my own version