activity
20002026
most citedHigher rank graph C*-algebras

272 citations · 515 across the 52 of their papers we have counts for

collaborators

56 papers

math.OA2026

Nuclear dimension, pure infiniteness and real rank for higher rank graph -algebras

David Pask

We study the structure and regularity of higher rank graph -algebras, with particular emphasis on their nuclear dimension. For a row-finite, locally convex -graph with…

math.OA2026

The -algebras of locally finite undirected graphs: A complete description of their K-theory

D. Pask

We study the -algebra of a locally finite undirected (Serre) graph and compute its K-theory. The algebra is defined intrinsically, as the graph-of-groups algebra…

math.GT2026

Full Mealy automata, complete square complexes, and anti-tori

David Pask

To a full Mealy automaton we associate a bijection , a one-vertex rank-two graph , and a one-vertex -square complex tiled by Wang tiles…

math.CT2026

Planar higher-rank trees have rank at most four

David Pask

We prove that a finite, connected, singly connected, locally convex higher-rank tree whose -skeleton is planar and which is \emph{non-degenerate}, in the sense that every edge o…

math.KT2025

Higher-rank graphs and the graded -theory of Kumjian-Pask algebras

Roozbeh Hazrat, Promit Mukherjee, David Pask +1

This paper lays out the foundations of graded -theory for Leavitt algebras associated with higher-rank graphs, also known as Kumjian-Pask algebras, establishing it as a potentia…

math.OA2025

Relating insplittings of 2-graphs and of textile systems

Samantha Brooker, Priyanga Ganesan, Elizabeth Gillaspy +3

The graphical operation of insplitting is key to understanding conjugacy of shifts of finite type (SFTs) in both one and two dimensions. In this paper, we consider two approaches t…