اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMonic representations of finite higher-rank graphs
108
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we define the notion of monic representation for the $C^*$-algebras of finite higher-rank graphs with no sources, and undertake a comprehensive study of them. Monic representations are the representations that, when restricted to the commutative $C^*$-algebra of the continuous functions on the infinite path space, admit a cyclic vector. We link monic representations to the $Lambda$-semibranching representations previously studied by Farsi, Gillaspy, Kang, and Packer, and also provide a universal representation model for nonnegative monic representations.
قيم البحث
اقرأ أيضاً
In this paper, we discuss a method of constructing separable representations of the $C^*$-algebras associated to strongly connected row-finite $k$-graphs $Lambda$. We begin by giving an alternative characterization of the $Lambda$-semibranching funct
ion systems introduced in an earlier paper, with an eye towards constructing such representations that are faithful. Our new characterization allows us to more easily check that examples satisfy certain necessary and sufficient conditions. We present a variety of new examples relying on this characterization. We then use some of these methods and a direct limit procedure to construct a faithful separable representation for any row-finite source-free $k$-graph.
In this monograph we undertake a comprehensive study of separable representations (as well as their unitary equivalence classes) of $C^*$-algebras associated to strongly connected finite $k$-graphs $Lambda$. We begin with the representations associat
ed to the $Lambda$-semibranching function systems introduced by Farsi, Gillaspy, Kang, and Packer in cite{FGKP}, by giving an alternative characterization of these systems which is more easily verified in examples. We present a variety of such examples, one of which we use to construct a new faithful separable representation of any row-finite source-free $k$-graph. Next, we analyze the monic representations of $C^*$-algebras of finite $k$-graphs. We completely characterize these representations, generalizing results of Dutkay and Jorgensen cite{dutkay-jorgensen-monic} and Bezuglyi and Jorgensen cite{bezuglyi-jorgensen} for Cuntz and Cuntz-Krieger algebras respectively. We also describe a universal representation for non-negative monic representations of finite, strongly connected $k$-graphs. To conclude, we characterize the purely atomic and permutative representations of $k$-graph $C^*$-algebras, and discuss the relationship between these representations and the classes of representations introduced earlier.
In this paper, we present a new way to associate a finitely summable spectral triple to a higher-rank graph $Lambda$, via the infinite path space $Lambda^infty$ of $Lambda$. Moreover, we prove that this spectral triple has a close connection to the w
avelet decomposition of $Lambda^infty$ which was introduced by Farsi, Gillaspy, Kang, and Packer in 2015. We first introduce the concept of stationary $k$-Bratteli diagrams, in order to associate a family of ultrametric Cantor sets, and their associated Pearson-Bellissard spectral triples, to a finite, strongly connected higher-rank graph $Lambda$. We then study the zeta function, abscissa of convergence, and Dixmier trace associated to the Pearson-Bellissard spectral triples of these Cantor sets, and show these spectral triples are $zeta$-regular in the sense of Pearson and Bellissard. We obtain an integral formula for the Dixmier trace given by integration against a measure $mu$, and show that $mu$ is a rescaled version of the measure $M$ on $Lambda^infty$ which was introduced by an Huef, Laca, Raeburn, and Sims. Finally, we investigate the eigenspaces of a family of Laplace-Beltrami operators associated to the Dirichlet forms of the spectral triples. We show that these eigenspaces refine the wavelet decomposition of $L^2(Lambda^infty, M)$ which was constructed by Farsi et al.
We study the structure and compute the stable rank of C*-algebras of finite higher-rank graphs. We completely determine the stable rank of the C*-algebra when the k-graph either contains no cycle with an entrance, or is cofinal. We also determine exa
ctly which finite, locally convex k-graphs yield unital stably finite C*-algebras. We give several examples to illustrate our results.
We will define new constructions similar to the graph systems of correspondences described by Deaconu et al. We will use these to prove a version of Ionescus theorem for higher rank graphs. Afterwards we will examine the properties of these construct
ions further and make contact with Yeends topological k-graphs and the tensor groupoid valued product systems of Fowler and Sims.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
