Abstract
-
We construct a family of groups from suitable higher rank graphs which are
analogues of the finite symmetric groups. We introduce homological invariants
showing that many of our groups are, for example, not isomorphic to $nV$, when
$n \geq 2$.