The minimum rank of a directed graph Γ is defined to be the smallest possible rank over all real matrices whose ijth entry is nonzero whenever (i, j) is an arc in Γ and is zero otherwise. The symmetric minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero o...

The minimum rank of a directed graph Γ is defined to be the smallest possible rank over all real matrices whose ijth entry is nonzero whenever (i, j) is an arc in Γ and is zero otherwise. The symmetric minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero o...

We study dimension theory for the C∗-algebras of row-finite k-graphs with no sources. We establish that strong aperiodicity—the higher-rank analogue of condition (K)—for a k-graph is necessary and sufficient for the associated C∗-algebra to have topological dimension zero. We prove that a purely infinite 2-graph algebra has real-rank zero if and only if it has topological dimension zero and sat...

The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. This paper introduces a new graph parameter, Z(G), that is the minimum size of a zero forcing set of vertices and uses it to bound the minimum rank for numerous families of graphs, often e...

In 1996, Harris and Kadison posed the following problem: show that a linear bijection between C∗-algebras that preserves the identity and the set of invertible elements is a Jordan isomorphism. In this paper, we show that if A and B are semisimple Banach algebras andΦ : A→ B is a linear map onto B that preserves the spectrum of elements, thenΦ is a Jordan isomorphism if either A or B is a C∗-al...

We give a characterization of finiteness of projections in the multiplier algebra of a σ-unital C∗-algebra of real rank zero and stable rank one.

For any (unital) exchange ring R whose finitely generated projective modules satisfy the separative cancellation property (A ⊕ A ∼= A ⊕ B ∼= B ⊕ B =⇒ A ∼= B), it is shown that all invertible square matrices over R can be diagonalized by elementary row and column operations. Consequently, the natural homomorphism GL1(R) → K1(R) is surjective. In combination with a result of Huaxin Lin, it follow...

Abstract. The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a 1 graph G, is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by 2 G. It is shown that for a connected graph of order at least two, no vertex is in every zero forcing set. The positive 3 semidefinite zero forcing number Z+(G) is introduced, and ...