## One ring to rule them all

Arithmetic with networks The paper “On the arithmetic of graphs” is posted. (An updated PDF). The paper is far from polished, the document already started to become … ….

The join operation on graphs produces a monoid on which one can ask whether there exists an analogue of the fundamental theorem of arithmetic. The join operation mirrors the corresponding join operation in the continuum. It leaves spheres invariant. We prove the existence of infinitely many primes in each dimension and also establish Euclid’s lemma, the existence of prime factorizations. An important open question is whether there is a fundamental theorem of arithmetic for graphs.