2015
DOI: 10.1016/j.jfa.2015.05.010
|View full text |Cite
|
Sign up to set email alerts
|

K-theory for the tame C⁎-algebra of a separated graph

Abstract: Abstract. A separated graph is a pair (E, C) consisting of a directed graph E and a set C = v∈E 0 C v

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(12 citation statements)
references
References 17 publications
0
12
0
Order By: Relevance
“…By injectivity of ∂ 1 and exactness of the sequence K 1 (C * L) Ker(Id − α * ) = Z.p F , where p F denotes the constant map taking the value p F on Z, it corresponds to the class [1] of 1 in K 0 (C * B) (see Corollary 1). Moreover, we know from [28, Lemma 2] that ∂ 1 [u] = − [1].…”
Section: Computations On the Right-hand Sidementioning
confidence: 99%
See 1 more Smart Citation
“…By injectivity of ∂ 1 and exactness of the sequence K 1 (C * L) Ker(Id − α * ) = Z.p F , where p F denotes the constant map taking the value p F on Z, it corresponds to the class [1] of 1 in K 0 (C * B) (see Corollary 1). Moreover, we know from [28, Lemma 2] that ∂ 1 [u] = − [1].…”
Section: Computations On the Right-hand Sidementioning
confidence: 99%
“…On the analytical side, for the case of classical lamplighter groups L=(Z/ndouble-struckZ)Z computations for the K ‐theory of CL have implicitly appeared in different contexts (see, for instance [, Example 6.10; , Theorem 15; , Theorem 4.12; , Section 6.5], or [, Example 3]). Our approach is different from the previous ones in two ways: first, we treat lamplighter groups of finite groups in full generality, and second, we specify generators for the K ‐groups and show their relevance for the Baum–Connes assembly map.…”
Section: Introductionmentioning
confidence: 99%
“…More information around partial actions may be found in the surveys [45,115,116,170,250,251,260]. Notice also that partial actions and/or related structures have been mentioned in [12,13,24,46,62,67,90,92,142,154,161,166,167].…”
Section: (G U(a))→pic(a G )→Pic(a) G →H 2 (G U(a))→b(a/a α )→ → H 1mentioning
confidence: 99%
“…Indeed, as shown in [10], there are examples of crossed-product functors that are not correspondence functors for which the above result fails even for crossed products by ordinary actions. In the recent paper by Ara and Exel [4] (see in particular Corollary 6.9) the authors have applied the result by McClanahan to some interesting partial actions of free groups associated to separated graphs in order to deduce that certain full and reduced crossed products have the same K-theory (and the K-theory is effectively computed in [4]). By the above result these computations extend to the respective exotic crossed product related to any given correspondence crossed-product functor.…”
Section: More Generally Every Other Morita Enveloping Actionmentioning
confidence: 99%