Stephen Allen

most citedA dual graph construction for higher-rank graphs, and

K

-theory for finite 2-graphs

2 citations · 3 across the 2 of their papers we have counts for

collaborators

Showing math.OAShow all

2 papers · 1 filter

math.OA2005★ 1 cited

Gauge Invariant Uniqueness Theorem for Corners of k-graphs

Stephen Allen

For a finitely aligned k-graph $Λ$ with X a set of vertices in $Λ$ we define a universal C*-algebra called $C^{*} (Λ, X)$ generated by partial isometries. We show that $C^{*} (Λ, X)$ is is…

math.OA2004★ 2 cited

A dual graph construction for higher-rank graphs, and $K$ -theory for finite 2-graphs

Stephen Allen, David Pask, Aidan Sims

Given a $k$ -graph $Λ$ and an element $p$ of $\NN^k$, we define the dual $k$ -graph, $p Λ$ . We show that when $Λ$ is row-finite and has no sources, the $C^{*}$ -algebras $C^{*} (Λ)$ and $C^…

Gauge Invariant Uniqueness Theorem for Corners of k-graphs

A dual graph construction for higher-rank graphs, and K-theory for finite 2-graphs

A dual graph construction for higher-rank graphs, and $K$ -theory for finite 2-graphs