A Hurewicz-type theorem for asymptotic dimension and applications to geometric group theory
نویسندگان
چکیده
منابع مشابه
A Hurewicz-type Theorem for Asymptotic Dimension and Applications to Geometric Group Theory
We prove an asymptotic analog of the classical Hurewicz theorem on mappings that lower dimension. This theorem allows us to find sharp upper bound estimates for the asymptotic dimension of groups acting on finitedimensional metric spaces and allows us to prove a useful extension theorem for asymptotic dimension. As applications we find upper bound estimates for the asymptotic dimension of nilpo...
متن کاملMath 527 - Homotopy Theory Hurewicz theorem
Alternate proof. Using a bit of differential topology (or a more geometric construction along the lines of Hatcher § 4.1 Exercise 15), consider the degree of a smooth map f : S → S. Since every homotopy class [f ] contains a smooth representative, and all such maps have the same degree (i.e. degree is a homotopy invariant), this defines a function deg : πn(S )→ Z. One readily shows that deg is ...
متن کاملThe Hurewicz Theorem
The fundamental group and homology groups both give extremely useful information, particularly about path-connected spaces. Both can be considered as functors, so we can use these constructional invariants as convenient guides to classifying spaces. However, though homology groups are often easy to compute, the fundamental group sometimes is not. In fact, it is often not even obvious when a spa...
متن کاملHomology of Types in Model Theory Ii: a Hurewicz Theorem for Stable Theories
This is a sequel to the paper [6] ‘Homology of types in model theory I: Basic concepts and connections with type amalgamation’. We compute the group H2 for strong types in stable theories and show that any profinite abelian group can occur as the group H2 in the model-theoretic context. The work described in this paper was originally inspired by Hrushovski’s discovery [8] of striking connection...
متن کاملA new separation theorem with geometric applications
Let G = (V (G), E(G)) be an undirected graph with a measure function μ assigning non-negative values to subgraphs H so that μ(H) does not exceed the clique cover number of H. When μ satisfies some additional natural conditions, we study the problem of separating G into two subgraphs, each with a measure of at most 2μ(G)/3 by removing a set of vertices that can be covered with a small number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2006
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-06-04088-8