2000 character limit reached
Polynomially bounded cohomology and the Novikov Conjecture
Published 26 Apr 2010 in math.KT | (1004.4680v5)
Abstract: Using techniques developed for studying polynomially bounded cohomology, we show that the assembly map for $K_*t(\ell1(G))$ is rationally injective for all finitely presented discrete groups $G$. This verifies the $\ell1$-analogue of the Strong Novikov Conjecture for such groups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.