Graph invariants from ideas in physics and number theory
Journal of Combinatorics · 2026 · 17 (3) · 389-415
DOI: 10.4310/joc.260511223458 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorics, 2026. Verfasst von An Huang und 2 weiteren Autor:innen.
Abstract (Originalsprache)
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 \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim Weisfeiler-Lehman algorithm for graph isomorphism testing. We complement this invariant by another type of graph invariants, coming from viewing graphs as quadratic forms over the integers. We explain that the combination of these two ideas give rise to an interesting approach to the graph isomorphism problem.
Zitieren
APA
Huang, A., Yau, S., & Yueh, M. (2026). Graph invariants from ideas in physics and number theory. Journal of Combinatorics, 17(3), 389-415. https://doi.org/10.4310/joc.260511223458
Vancouver
Huang A, Yau S, Yueh M. Graph invariants from ideas in physics and number theory. Journal of Combinatorics. 2026;17(3):389-415. doi:10.4310/joc.260511223458
BibTeX
@article{Huang2026,
author = {Huang, An and Yau, Shing-Tung and Yueh, Mei-Heng},
title = {Graph invariants from ideas in physics and number theory},
journal = {Journal of Combinatorics},
year = {2026},
volume = {17},
number = {3},
pages = {389--415},
doi = {10.4310/joc.260511223458}
}
EUVIMED