there are many interesting matrices associated to graphs. we all know about the adjacency matrix and the laplacian, the basic matrices of spectral graph theory. the distance matrix is another interesting one - it was famously shown by graham and pollack that distance determinants of trees depend only on the number of vertices. the characteristic polynomial of distance matrices of trees was further studied by graham and lovasz, who found many interesting properties. recently, graph theorists have begun to consider "exponential distance matrices" of graphs, obtained by taking the entrywise exponential of the usual distance matrix, and have proved some basic theorems on their eigenvalues for simple families of graphs. taking a less myopic view of the mathematical landscape quickly reveals that exponential distance matrices appeared some thirty years ago in quantum physics, when zagier explicitly evaluated the determinant of the exponential distance matrix of the coxeter-cayley graph of the symmetric group as the main step in proving the existence of a hilbert space representation of deformed commutation relations interpolating between bosons and fermions. i will describe parallel results for the hurwitz-cayley graph of the symmetric group and explain their relation to gauge-string/dualities in yang-mills theory. as in zagier's study, the main tools come from discrete harmonic analysis, aka the character theory of finite groups, and some basic aspects of symmetric function theory also play an important role. from a pedagogical perspective, the moral of the story is that it's good to imbibe some algebra with your combinatorics, and plain old matrices just don't cut it.