首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 484 毫秒
1.
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 C(E) given in [T. Bates, D. Pask, I. Raeburn, W. Szymański, The C-algebras of row-finite graphs, New York J. Math. 6 (2000) 307-324].  相似文献   

2.
We give various necessary and sufficient conditions for an AF-algebra to be isomorphic to a graph C-algebra, an Exel-Laca algebra, and an ultragraph C-algebra. We also explore consequences of these results. In particular, we show that all stable AF-algebras are both graph C-algebras and Exel-Laca algebras, and that all simple AF-algebras are either graph C-algebras or Exel-Laca algebras. In addition, we obtain a characterization of AF-algebras that are isomorphic to the C-algebra of a row-finite graph with no sinks.  相似文献   

3.
4.
The notion of topological free entropy dimension of n-tuple of elements in a unital C algebra was introduced by Voiculescu. In the paper, we compute topological free entropy dimension of one self-adjoint element and topological free orbit dimension of one self-adjoint element in a unital C algebra. We also calculate the values of topological free entropy dimensions of any families of self-adjoint generators of some unital C algebras, including irrational rotation C algebra, UHF algebra, and minimal tensor product of two reduced C algebras of free groups.  相似文献   

5.
We study the interconnection between directed graphs and operators on a Hilbert space. The intuition supporting this link is the following feature shared by partial isometries (as operators on a Hilbert space) on the one hand and edges in directed graphs on the other. A partial isometry a is an operator in a Hilbert space H, i.e., a:HH which maps a (closed) subspace in H isometrically onto a generally different subspace. The respective subspaces are called the initial space and the final space of a. Denoting the corresponding (orthogonal) projections by p i and p f , note that a partial isometry a may be thought of as an edge from one vertex to another (which are not necessarily distinct) in a directed graph. And conversely, every directed graph has such a representation. Since neither the partial isometries nor the directed edges in a fixed model allow unrestricted composition, the algebraic construct which is useful is that of a groupoid. In this paper we develop this as a representation theory, and we explore the connection between realizations in the context of C *-algebras. The building blocks in our theory are certain matricial C *-algebras which we define. We then prove how they serve to localize our global representations.  相似文献   

6.
We study the operator algebra associated with a self-mapping ? on a countable set X which can be represented as a directed graph. The algebra is generated by the family of partial isometries acting on the corresponding l2(X). We study the structure of involutive semigroup multiplicatively generated by the family of partial isometries. We formulate the criterion when the algebra is irreducible on the Hilbert space. We consider the concrete examples of operator algebras. In particular, we give the examples of nonisomorphic C*-algebras, which are the extensions by compact operators of the algebra of continuous functions on the unit circle.  相似文献   

7.
We prove that two dual operator algebras are weak Morita equivalent in the sense of [D.P. Blecher, U. Kashyap, Morita equivalence of dual operator algebras, J. Pure Appl. Algebra 212 (2008) 2401-2412] if and only if they have equivalent categories of dual operator modules via completely contractive functors which are also weak-continuous on appropriate morphism spaces. Moreover, in a fashion similar to the operator algebra case, we characterize such functors as the module normal Haagerup tensor product with an appropriate weak Morita equivalence bimodule. We also develop the theory of the W-dilation, which connects the non-selfadjoint dual operator algebra with the W-algebraic framework. In the case of weak Morita equivalence, this W-dilation is a W-module over a von Neumann algebra generated by the non-selfadjoint dual operator algebra. The theory of the W-dilation is a key part of the proof of our main theorem.  相似文献   

8.
We continue the study of an operator algebra associated with a self-mapping ? on a countable setX which can be represented as a directed graph. This C*-algebra belongs to a class of operator algebras, generated by a family of partial isometries satisfying some relations on their source and range projections. Earlier we have formulated the irreducibility criterion of such algebras, which give us a possibility to examine the structure of the corresponding Hilbert space. We will show that for reducible algebras the underlying Hilbert space can be represented either as an infinite sum of invariant subspaces or as a tensor product of a finite-dimensional Hilbert space with l2(Z). In the first case we present a conditions under which the studied algebra has an irreducible representation into a C*-algebra generated by a weighted shift operator. In the second case, the algebra has the irreducible finite-dimensional representations indexed by the unit circle.  相似文献   

9.
We transcribe a portion of the theory of extensions of C-algebras to general operator algebras. We also include several new general facts about approximately unital ideals in operator algebras and the C-algebras which they generate.  相似文献   

10.
11.
A Leavitt path algebra associates to a directed graph a ?-graded algebra and in its simplest form it recovers the Leavitt algebra L(1, k). In this note, we first study this ?-grading and characterize the (?-graded) structure of Leavitt path algebras, associated to finite acyclic graphs, C n -comet, multi-headed graphs and a mixture of these graphs (i.e., polycephaly graphs). The last two types are examples of graphs whose Leavitt path algebras are strongly graded. We give a criterion when a Leavitt path algebra is strongly graded and in particular characterize unital Leavitt path algebras which are strongly graded completely, along the way obtaining classes of algebras which are group rings or crossed-products. In an attempt to generalize the grading, we introduce weighted Leavitt path algebras associated to directed weighted graphs which have natural ⊕?-grading and in their simplest form recover the Leavitt algebras L(n, k). We then show that the basic properties of Leavitt path algebras can be naturally carried over to weighted Leavitt path algebras.  相似文献   

12.
We show that the C* -algebra of the regular representation of a discrete group G onto a subset Σ of G is the reduced C* -algebra of an r-discrete groupoid whose space of units is totally disconnected and contains Σ as a dense subset. The C*-algebra of quasicrystals, some Cuntz-Krieger and crossed product algebras, and Wiener-Hopf algebras are particular cases of this construction  相似文献   

13.
Let α be a quadratic Poisson bivector on a vector space V. Then one can also consider α as a quadratic Poisson bivector on the vector space V[1]. Fixed a universal deformation quantization (prediction of some complex weights to all Kontsevich graphs [12]), we have deformation quantization of the both algebras S(V) and Λ(V). These are graded quadratic algebras, and therefore Koszul algebras. We prove that for some universal deformation quantization, independent on α, these two algebras are Koszul dual. We characterize some deformation quantizations for which this theorem is true in the framework of the Tamarkin's theory [19].  相似文献   

14.
We study the class of simple C-algebras introduced by Villadsen in his pioneering work on perforated ordered K-theory. We establish six equivalent characterisations of the proper subclass which satisfies the strong form of Elliott's classification conjecture: two C-algebraic (Z-stability and approximate divisibility), one K-theoretic (strict comparison of positive elements), and three topological (finite decomposition rank, slow dimension growth, and bounded dimension growth). The equivalence of Z-stability and strict comparison constitutes a stably finite version of Kirchberg's characterisation of purely infinite C-algebras. The other equivalences confirm, for Villadsen's algebras, heretofore conjectural relationships between various notions of good behaviour for nuclear C-algebras.  相似文献   

15.
In this paper, we prove the Hyers-Ulam-Rassias stability of homomorphisms in C-ternary algebras and of derivations on C-ternary algebras for the following Cauchy-Jensen additive mappings:
(0.1)  相似文献   

16.
Interactions     
Given a C-algebra B, a closed *-subalgebra AB, and a partial isometry S in B which interacts with A in the sense that SaS=H(a)SS and SaS=V(a)SS, where V and H are positive linear operators on A, we derive a few properties which V and H are forced to satisfy. Removing B and S from the picture we define an interaction as being a pair of maps (V,H) satisfying the derived properties. Starting with an abstract interaction (V,H) over a C-algebra A we construct a C-algebra B containing A and a partial isometry S whose interaction with A follows the above rules. We then discuss the possibility of constructing a covariance algebra from an interaction. This turns out to require a generalization of the notion of correspondences (also known as Pimsner bimodules) which we call a generalized correspondence. Such an object should be seen as an usual correspondence, except that the inner-products need not lie in the coefficient algebra. The covariance algebra is then defined using a natural generalization of Pimsner's construction of the celebrated Cuntz-Pimsner algebras.  相似文献   

17.
As a generalization of the free semigroup algebras considered by Davidson and Pitts, and others, the second author and D.W. Kribs initiated a study of reflexive algebras associated with directed graphs. A free semigroupoid algebra is generated by a family of partial isometries, and initial projections, which act on a generalized Fock space spawned by the directed graph . We show that if the graph is finite, then is hyper-reflexive.

  相似文献   


18.
In this paper we study a graph operation which produces what we call the “vertex envelope” GV from a graph G. We apply it to plane cubic graphs and investigate the hamiltonicity of the resulting graphs, which are also cubic. To this end, we prove a result giving a necessary and sufficient condition for the existence of hamiltonian cycles in the vertex envelopes of plane cubic graphs. We then use these conditions to identify graphs or classes of graphs whose vertex envelopes are either all hamiltonian or all non-hamiltonian, paying special attention to bipartite graphs. We also show that deciding if a vertex envelope is hamiltonian is NP-complete, and we provide a polynomial algorithm for deciding if a given cubic plane graph is a vertex envelope.  相似文献   

19.
We classify graph C *-algebras, namely, Cuntz-Krieger algebras associated to the Bass-Hashimoto edge incidence operator of a finite graph, up to strict isomorphism. This is done by a purely graph theoretical calculation of the K-theory of the C *-algebras and the method also provides an independent proof of the classification up to Morita equivalence and stable equivalence of such algebras, without using the boundary operator algebra. A direct relation is given between the K 1-group of the algebra and the cycle space of the graph. We thank Jakub Byszewski for his input in Sect. 2.8. The position of the unit in K 0( Ч) was guessed based on some example calculations by Jannis Visser in his SCI 291 Science Laboratory at Utrecht University College.  相似文献   

20.
An edge-colored directed graph is observable if an agent that moves along its edges from node to node is able to determine his position in the graph after a sufficiently long observation of the edge colors, and without accessing any information about the traversed nodes. When the agent is able to determine his position only from time to time, the graph is said to be partly observable. Observability in graphs is desirable in situations where autonomous agents are moving on a network and they want to localize themselves with limited information. In this paper, we completely characterize observable and partly observable graphs and show how these concepts relate to other concepts in the literature. Based on these characterizations, we provide polynomial time algorithms to decide observability, to decide partial observability, and to compute the minimal number of observations necessary for finding the position of an agent. In particular we prove that in the worst case this minimal number of observations increases quadratically with the number of nodes in the graph. We then consider the more difficult question of assigning colors to a graph so as to make it observable and we prove that two different versions of this problem are NP-complete.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号