“…Here the underlying combinatorial model plays a key role. For graph C * -algebras [19], following [26,Section 7], the n th order-1 factorisation through finite-dimensional C * -algebras was obtained by producing a pair of pavings of the combinatorial quadrant N × N by copies of a completely positive contractive n × n real matrix so that when the two pavings are superimposed, entries at any fixed distance from the diagonal, and sufficiently far from the origin, approach 1 as n → ∞. For 2-graphs, we must perform an analogous decomposition in N 2 × N 2 , and the expected increase in dimension turns out to be illusory: facing no topological constraints, we can just pick convenient bijections of N 2 × N 2 onto N × N that carry points close to the diagonal to points close to the diagonal.…”