Search arXivSearch

arXiv · 2009.01357

Ultragraph algebras via labelled graph groupoids, with applications to generalized uniqueness theorems

Abstract

An ultragraph gives rise to a labelled graph with some particular properties. In this paper we describe the algebras associated to such labelled graphs as groupoid algebras. More precisely, we show that the known groupoid algebra realization of ultragraph C*-algebras is only valid for ultragraphs for which the range of each edge is finite, and we extend this realization to any ultragraph (including ultragraphs with sinks). Using our machinery, we characterize the shift space associated to an ultragraph as the tight spectrum of the inverse semigroup associated to the ultragraph (viewed as a labelled graph). Furthermore, in the purely algebraic setting, we show that the algebraic partial action used to describe an ultragraph Leavitt path algebra as a partial skew group ring is equivalent to the dual of a topological partial action, and we use this to describe ultragraph Leavitt path algebras as Steinberg algebras. Finally, we prove generalized uniqueness theorems for both ultragraph C*-algebras and ultragraph Leavitt path algebras and characterize their abelian core subalgebras.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gilles G. de Castro, Daniel Gonçalves, Daniel W. van Wyk. 2020-09-02. Ultragraph algebras via labelled graph groupoids, with applications to generalized uniqueness theorems. https://arxiv.org/abs/2009.01357

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA