2000 character limit reached
Dynamical Complexity and $K$-Theory of $L^p$ Operator Crossed Products
Published 28 Nov 2016 in math.KT, math.DS, and math.OA | (1611.09000v4)
Abstract: We apply quantitative (or controlled) $K$-theory to prove that a certain $Lp$ assembly map is an isomorphism for $p\in[1,\infty)$ when an action of a countable discrete group $\Gamma$ on a compact Hausdorff space $X$ has finite dynamical complexity. When $p=2$, this is a model for the Baum-Connes assembly map for $\Gamma$ with coefficients in $C(X)$, and was shown to be an isomorphism by Guentner, Willett, and Yu.
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.