中文
相关论文

相关论文: Characterizing Liminal And Type I Graph C*-Algebra…

200 篇论文

We give necessary and sufficient conditions on a row-finite graph E so that the Leavitt path algebra L(E) is purely infinite simple. This result provides the algebraic analog to the corresponding result for the Cuntz-Krieger C$^*$-algebra…

环与代数 · 数学 2007-05-23 G. Abrams , G. Aranda Pino

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

环与代数 · 数学 2019-12-12 Piotr M. Hajac , Mariusz Tobolski

We give sufficient conditions on a labeled direct graph to determine whether the Tanaka prolongation of its associated Lie algebra is infinite-dimensional. In the case that all directed edges are labeled differently, the corresponding graph…

微分几何 · 数学 2024-02-13 Mauricio Godoy Molina

A characterization is given for directed graphs that yield graph $C^*$-algebras with continuous trace. This is established for row-finite graphs with no sources first using a groupoid approach, and extended to the general case via the…

算子代数 · 数学 2015-12-15 Danny Crytser

Given an arbitrary countable ordinal $\alpha $, we introduce the notion of type $I_{\alpha }$ C*-algebra and $\alpha $-subhomogeneous C*-algebra. When $\alpha =0$, these recover the notions of Fell C*-algebra and of commutative C*-algebra,…

算子代数 · 数学 2026-02-24 Martino Lupini

We investigate the pure infiniteness and stable finiteness of the Exel-Pardo $C^*$-algebras $\mathcal{O}_{G,E}$ for countable self-similar graphs $(G,E,\varphi)$. In particular, we associate a specific ordinary graph $\widetilde{E}$ to…

算子代数 · 数学 2020-05-13 Hossein Larki

We construct a unital pre-C*-algebra $A_0$ which is stably finite, in the sense that every left invertible square matrix over $A_0$ is right invertible, while the C*-completion of $A_0$ contains a non-unitary isometry, and so it is…

算子代数 · 数学 2017-09-01 Niels Jakob Laustsen , Jared T. White

We introduce new formulations of aperiodicity and cofinality for finitely aligned higher-rank graphs \Lambda, and prove that C*(\Lambda) is simple if and only if \Lambda is aperiodic and cofinal. The main advantage of our versions of…

算子代数 · 数学 2015-05-13 Peter Lewin , Aidan Sims

It is known that a graph $C^*$-algebra $C^*(E)$ is approximately finite dimensional (AF) if and only if the graph $E$ has no loops. In this paper we consider the question of when a labeled graph $C^*$-algebra $C^*(E,\CL,\CB)$ is AF. A…

算子代数 · 数学 2013-06-06 J. A. Jeong , E. J. Kang , S. H. Kim

Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…

组合数学 · 数学 2020-07-21 Hendrik Heine

We consider the problem of identifying exactly which AF-algebras are isomorphic to a graph C*-algebra. We prove that any separable, unital, Type I C*-algebra with finitely many ideals is isomorphic to a graph C*-algebra. This result allows…

算子代数 · 数学 2013-08-26 Soren Eilers , Takeshi Katsura , Efren Ruiz , Mark Tomforde

Let A be a unital separable C*-algebra. We observe that A is type I if and only if the CNT-entropy of every inner automorphism of A is zero.

算子代数 · 数学 2007-05-23 Nathanial P. Brown

We geometrically describe the relation induced on a set of graphs by isomorphism of their associated graph C*-algebras as the smallest equivalence relation generated by five types of moves. The graphs studied have finitely many vertices and…

算子代数 · 数学 2019-10-28 Sara E. Arklint , Søren Eilers , Efren Ruiz

Given a $k$-graph $\Lambda$ and an element $p$ of $\NN^k$, we define the dual $k$-graph, $p\Lambda$. We show that when $\Lambda$ is row-finite and has no sources, the $C^*$-algebras $C^*(\Lambda)$ and $C^*(p\Lambda)$ coincide. We use this…

算子代数 · 数学 2007-05-23 Stephen Allen , David Pask , Aidan Sims

We prove directly that if E is a directed graph in which every cycle has an entrance, then there exists a C*-algebra which is co-universal for Toeplitz-Cuntz-Krieger E-families. In particular, our proof does not invoke ideal-structure…

算子代数 · 数学 2010-01-13 Aidan Sims , Samuel B. G. Webster

A graph is IC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share no common end vertex. IC-planarity specializes both NIC-planarity, which allows a pair of crossing…

离散数学 · 计算机科学 2017-07-28 Christian Bachmaier , Franz J. Brandenburg , Kathrin Hanauer

A C*-algebra is n-homogeneous (where n is finite) if every its nonzero irreducible representation acts on an n-dimensional Hilbert space. An elementary proof of Fell's characterization of n-homogeneous C*-algebras (by means of their…

算子代数 · 数学 2017-05-26 Piotr Niemiec

It is shown that no local periodicity is equivalent to the aperiodicity condition for arbitrary finitely-aligned k-graphs. This allows us to conclude that C*(\Lambda) is simple if and only if \Lambda is cofinal and has no local periodicity.

算子代数 · 数学 2008-10-28 Jacob Shotwell

We show that the graph construction used to prove that a gauge-invariant ideal of a graph C*-algebra is isomorphic to a graph C*-algebra, and also used to prove that a graded ideal of a Leavitt path algebra is isomorphic to a Leavitt path…

算子代数 · 数学 2013-04-16 Efren Ruiz , Mark Tomforde

Let E be a row-finite directed graph. We prove that there exists a C*-algebra C*_{min}(E) with the following co-universal property: given any C*-algebra B generated by a Toeplitz-Cuntz-Krieger E-family in which all the vertex projections…

算子代数 · 数学 2008-09-16 Aidan Sims