Graph invariants from ideas in physics and number theory

An Huang Harvard University Shing-Tung Yau Harvard University Mei-Heng Yueh Harvard University

Publications of CMSA of Harvard mathscidoc:1702.38072

We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green’s function on a graph studied in [8]. We show that this gives rise to a graph invariant, which is closely related to the 2-dimensional Weisfeiler-Lehman algorithm for graph isomorphism testing. We then consider the same theory over the integers, which leads to the consideration of certain quadratic forms over the integers as initiated in [14], associated to the graphs. The quadratic form represented by the combinatorial Laplacian respects a well-behaved wedge sum of graphs, and appears to capture important graph properties reg
No keywords uploaded!
[ Download ] [ 2017-02-08 00:42:54 uploaded by dmuoio ] [ 703 downloads ] [ 0 comments ]
@inproceedings{angraph,
  title={GRAPH INVARIANTS FROM IDEAS IN PHYSICS AND NUMBER THEORY},
  author={An Huang, Shing-Tung Yau, and Mei-Heng Yueh},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20170208004254342031299},
}
An Huang, Shing-Tung Yau, and Mei-Heng Yueh. GRAPH INVARIANTS FROM IDEAS IN PHYSICS AND NUMBER THEORY. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20170208004254342031299.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved