A few more remarks [PDF] about graph arithmetic. Now on the ArXiv. (Previous documents are here (June 2017 ArXiv), here (August 2017 ArXiv) and here (May 2019 ArXiv). The talk below on youtube was used for me to get organized a bit. It does not look like much has changed, …
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 more convoluted as more and more results were coming in. There had been some disappointment early June when realizing that the Zykov multiplication …
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.
