{"paper":{"title":"Dynamical complexity and controlled operator K-theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.OA"],"primary_cat":"math.KT","authors_text":"Erik Guentner, Guoliang Yu, Rufus Willett","submitted_at":"2016-09-07T17:57:27Z","abstract_excerpt":"In this paper, we introduce a property of topological dynamical systems that we call finite dynamical complexity. For systems with this property, one can in principle compute the $K$-theory of the associated crossed product $C^*$-algebra by splitting it up into simpler pieces and using the methods of controlled $K$-theory. The main part of the paper illustrates this idea by giving a new proof of the Baum-Connes conjecture for actions with finite dynamical complexity.\n  We have tried to keep the paper as self-contained as possible: we hope the main part will be accessible to someone with the eq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02093","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1609.02093/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}