2019
DOI: 10.4153/cjm-2017-034-5
|View full text |Cite
|
Sign up to set email alerts
|

Boundary Quotient -algebras of Products of Odometers

Abstract: Abstract. In this paper, we study the boundary quotient C*-algebras associated to products of odometers. One of our main results shows that the boundary quotient C*-algebra of the standard product of k odometers over ni-letter alphabets (1 ≤ i ≤ k) is always nuclear, and that it is a UCT Kirchberg algebra if and only if {ln ni : 1 ≤ i ≤ k} is rationally independent, if and only if the associated single-vertex kgraph C*-algebra is simple, To achieve this, one of our main steps is to construct a topological k-gr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
12
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5

Relationship

3
2

Authors

Journals

citations
Cited by 13 publications
(12 citation statements)
references
References 37 publications
0
12
0
Order By: Relevance
“…Theorem 3. 19. Let B be a C*-algebra, (G, Λ) be an aperiodic self-similar P -graph with Property (FV), and π : O G,Λ → B be a homomorphism such that π(s v ) = 0 for all v ∈ Λ 0 .…”
Section: 5mentioning
confidence: 99%
See 1 more Smart Citation
“…Theorem 3. 19. Let B be a C*-algebra, (G, Λ) be an aperiodic self-similar P -graph with Property (FV), and π : O G,Λ → B be a homomorphism such that π(s v ) = 0 for all v ∈ Λ 0 .…”
Section: 5mentioning
confidence: 99%
“…Those examples include (1) self-similar k-graphs with underlying k-graphs strongly aperiodic (cf. [15]), and (2) the motivating example of our series of research [19,20,21] -the product of odometers, which has connections to many other areas like number theory.…”
Section: Introductionmentioning
confidence: 99%
“…(Product of odometers) Let k < ∞, G = Z, and be a single-vertex kgraph. Consider the product of odometers in [19] Proof. Fix a cycline triple (µ, g, ν) of (G, ( 0 \H )).…”
Section: Some Examplesmentioning
confidence: 99%
“…| < ∞, as silently done in [21] (also cf. [19]), we can always assume that v∈ 0 S v = 1 A . Otherwise, let P := v∈ 0 S v .…”
mentioning
confidence: 99%
See 1 more Smart Citation