Home | Legals | Data Protection | Sitemap | KIT

Finite Decomposition Complexity and Assembly Maps

Finite Decomposition Complexity and Assembly Maps
Date:

16.10.2018

Place:

1.067 (20.30)

Speaker:

Daniel Kasprowski

Time:

13:30-14:30

Source:

Finite Decomposition Complexity and Assembly Maps

Abstract: In the first part of the talk, I will review the concepts of finite asymptotic dimension and finite decomposition complexity. Then I will introduce the notion of regular decomposition complexity. In the second part, I will explain how these notion lead to injectivity results for assembly maps, for example in algebraic K-theory. Parts of this talk are joined work with A. Nicas and D. Rosenthal and with U. Bunke, A. Engel and C. Winges.