Graphs on Surfaces and the Partition Function of String Theory
J.Manuel Garcia-Islas

TL;DR
This paper explores the connection between graph theory on surfaces and the partition function in discrete string theory, providing exact combinatorial formulas for various closed surfaces.
Contribution
It offers a formal mathematical framework linking graph embeddings on surfaces to the computation of the string theory partition function, including explicit calculations for specific surfaces.
Findings
Exact formulas for the partition function on the sphere and torus
Methodology for counting non-isomorphic triangulations
Extension to non-orientable surfaces like the projective plane
Abstract
Graphs on surfaces is an active topic of pure mathematics belonging to graph theory. It has also been applied to physics and relates discrete and continuous mathematics. In this paper we present a formal mathematical description of the relation between graph theory and the mathematical physics of discrete string theory. In this description we present problems of the combinatorial world of real importance for graph theorists. The mathematical details of the paper are as follows: There is a combinatorial description of the partition function of bosonic string theory. In this combinatorial description the string world sheet is thought as simplicial and it is considered as a combinatorial graph. It can also be said that we have embeddings of graphs in closed surfaces. The discrete partition function which results from this procedure gives a sum over triangulations of closed surfaces. This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Cellular Automata and Applications · Graph Theory and Algorithms
