Uniqueness theorems for combinatorial C*-algebras

Abstract

Spielberg's construction of C*-algebras from left cancellative small categories is a common generalization for most C*-algebras one would consider to come from ``combinatorial data,'' including graph and k-graph C*-algebras, Li's semigroup C*-algebras, Nekrashevych's self-similar action algebras, and more. We use known groupoid models of these algebras and Exel's theory of tight representations of inverse semigroups to prove uniqueness theorems for these C*-algebras. As applications, we improve on our previous uniqueness theorem for the boundary quotient C*-algebras of right LCM monoids, and we also generalize the uniqueness theorem of Brown, Nagy, and Reznikoff for row-finite higher-rank graphs to the finitely aligned case.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…