• Communications of the Korean Mathematical Society
• /
• v.15 no.3
• /
• pp.521-531
• /
• 2000

Graph C*-algebras C*(E) are the universal C*-algebras generated by partial isometries satisfying the Cuntz-Krieger relations determined by directed graphs E, and it is known that a simple graph C*-algebra is extremally rich in sense that it contains enough extreme consider a sufficient condition on a graph for which the associated graph algebra(possibly nonsimple) is extremally rich. We also present examples of nonextremally rich prime graph C*-algebras with finitely many ideals and with real rank zero.

• Journal of the Korean Mathematical Society
• /
• v.47 no.3
• /
• pp.601-631
• /
• 2010

In [6] and [7], we introduced graph von Neumann algebras which are the (groupoid) crossed product algebras of von Neumann algebras and graph groupoids via groupoid actions. We showed that such crossed product algebras have the graph-depending amalgamated reduced free probabilistic properties. In this paper, we will consider a scalar-valued $W^*$-probability on a given graph von Neumann algebra. We show that a diagonal graph $W^*$-probability space (as a scalar-valued $W^*$-probability space) and a graph W¤-probability space (as an amalgamated $W^*$-probability space) are compatible. By this compatibility, we can find the relation between amalgamated free distributions and scalar-valued free distributions on a graph von Neumann algebra. Under this compatibility, we observe the scalar-valued freeness on a graph von Neumann algebra.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.651-661
• /
• 2007

Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies an identity $s{\approx}t$ if the corresponding graph algebra $\underline{A(G)}$ satisfies $s{\approx}t$. A graph G=(V,E) is called an $(xy)x{\approx}x(yy)$ graph if the graph algebra $\underline{A(G)}$ satisfies the equation $(xy)x{\approx}x(yy)$. An identity $s{\approx}t$ of terms s and t of any type ${\tau}$ is called a hyperidentity of an algebra $\underline{A}$ if whenever the operation symbols occurring in s and t are replaced by any term operations of $\underline{A}$ of the appropriate arity, the resulting identities hold in $\underline{A}$. In this paper we characterize $(xy)x{\approx}x(yy)$ graph algebras, identities and hyperidentities in $(xy)x{\approx}x(yy)$ graph algebras.

• Kyungpook Mathematical Journal
• /
• v.45 no.4
• /
• pp.561-570
• /
• 2005

Weak Crossed Product Algebras correspond to certain graphs called lower subtractive graphs. The properties of such algebras can be obtained by studying this kind of graphs ([4], [5]). In [1], the author showed that a weak crossed product is Frobenius and its restricted subalgebra is symmetric if and only if its associated graph has a unique maximal vertex. A special construction of these graphs came naturally and was known as standard lower subtractive graph. It was a deep question that when such a special graph possesses unique maximal vertex? This work is to answer the question partially and to give a particular characterization for such graphs at which the corresponding algebras are isomorphic. A graph that follows the mentioned characterization is called flexible. Flexibility is to some extend a generalization of the so-called Coxeter groups and its weak Bruhat ordering.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.567-608
• /
• 2022

We show that certain extensions of classifiable C^*-algebras are strongly classified by the associated six-term exact sequence in K-theory together with the positive cone of K₀-groups of the ideal and quotient. We use our results to completely classify all unital graph C^*-algebras with exactly one non-trivial ideal.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.1201-1211
• /
• 2015

s-sequences and d-sequences are fundamental sequences intensively studied in many fields of algebra. In this paper we are interested in dealing with monomial sequences associated to graphs in order to establish conditions for which they are s-sequences and/or d-sequences.

• The Pure and Applied Mathematics
• /
• v.19 no.2
• /
• pp.199-209
• /
• 2012

For a locally compact higher rank graph ${\Lambda}$, we construct a two-sided path space ${\Lambda}^{\Delta}$ with shift homeomorphism ${\sigma}$ and its corresponding path groupoid ${\Gamma}$. Then we find equivalent conditions of aperiodicity, cofinality and irreducibility of ${\Lambda}$ in (${\Lambda}^{\Delta}$, ${\sigma}$), ${\Gamma}$, and the groupoid algebra $C^*({\Gamma})$.

• Journal of the Korean Mathematical Society
• /
• v.46 no.3
• /
• pp.657-673
• /
• 2009

The fixed point algebra $C^*(E)^{\gamma}$ of a gauge action $\gamma$ on a graph $C^*$-algebra $C^*(E)$ and its AF subalgebras $C^*(E)^{\gamma}_{\upsilon}$ associated to each vertex v do play an important role for the study of dynamical properties of $C^*(E)$. In this paper, we consider the stability of $C^*(E)^{\gamma}$ (an AF algebra is either stable or equipped with a (nonzero bounded) trace). It is known that $C^*(E)^{\gamma}$ is stably isomorphic to a graph $C^*$-algebra $C^*(E_{\mathbb{Z}}\;{\times}\;E)$ which we observe being stable. We first give an explicit isomorphism from $C^*(E)^{\gamma}$ to a full hereditary $C^*$-subalgebra of $C^*(E_{\mathbb{N}}\;{\times}\;E)({\subset}\;C^*(E_{\mathbb{Z}}\;{\times}\;E))$ and then show that $C^*(E_{\mathbb{N}}\;{\times}\;E)$ is stable whenever $C^*(E)^{\gamma}$ is so. Thus $C^*(E)^{\gamma}$ cannot be stable if $C^*(E_{\mathbb{N}}\;{\times}\;E)$ admits a trace. It is shown that this is the case if the vertex matrix of E has an eigenvector with an eigenvalue $\lambda$ > 1. The AF algebras $C^*(E)^{\gamma}_{\upsilon}$ are shown to be nonstable whenever E is irreducible. Several examples are discussed.

• Journal of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.239-268
• /
• 2015

Let Q be a finite quiver and $G{\subseteq}Aut(\mathbb{k}Q)$ a finite abelian group. Assume that $\hat{Q}$ and ${\Gamma}$ are the generalized Mckay quiver and the valued graph corresponding to (Q, G) respectively. In this paper we discuss the relationship between indecomposable $\hat{Q}$-representations and the root system of Kac-Moody algebra $g({\Gamma})$. Moreover, we may lift G to $\bar{G}{\subseteq}Aut(g(\hat{Q}))$ such that $g({\Gamma})$ embeds into the fixed point algebra $g(\hat{Q})^{\bar{G}}$ and $g(\hat{Q})^{\bar{G}}$ as a $g({\Gamma})$-module is integrable.

• The Journal of the Korea Contents Association
• /
• v.11 no.9
• /
• pp.63-75
• /
• 2011

A number of process algebras have been proposed to develop distributed mobile real-time systems: pi-Calculus, Mobile Ambients Calculus, Bigraph, etc. However, as the systems get large and complex, the algebras become less suitable for understanding the interactions and mobility of the processes of the systems due to the size and complexity. Therefore it is necessary to handle the size and complexity for systematic understanding of the systems. This paper handles the size and complexity with a method of abstraction on sequences of interactions and movements of processes in the systems, which can be further organized in the form of hierarchically structured lattices, namely, Prism. The theoretical principle of the abstraction is based on a new concept of Behavior Ontology, which is extended from Active ontology. Prism allows the systems to be analyzed in the perspective of the lattices in Prism, which are characterized by the hierarchically organized behavioral properties of the developing systems, for systematic understanding the systems. In this way, the complexity of the interactions and the movements can be handled systematically in the semantically and hierarchically organized structure of the behavior.