Algebraic combinatorics on trace monoids: extending number theory to walks on graphs
Abstract
Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose letters, the edges of the graph, obey a specific commutation rule. A particularclass of traces emerges from this framework, the hikes, whose alphabet is the set of simple cycleson the graph. We show that hikes characterize undirected graphs uniquely, up to isomorphism, andsatisfy remarkable algebraic properties such as the existence and uniqueness of a prime factorization.Because of this, the set of hikes partially ordered by divisibility hosts a plethora of relations in directcorrespondence with those found in number theory. Some applications of these results are presented,including a permanantal extension to MacMahon's master theorem and a derivation of the Ihara zetafunction.
Keywords
Cite
@article{arxiv.1601.01780,
title = {Algebraic combinatorics on trace monoids: extending number theory to walks on graphs},
author = {P. -L Giscard and P Rochet},
journal= {arXiv preprint arXiv:1601.01780},
year = {2017}
}