Feynman Diagrams and Map Enumeration
Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
The goal of this thesis is to count how many graphs exist given a number of verticesor some other restrictions. The graphs are counted by perturbing Gaussian integralsand using the Wick lemma to interpret the perturbations in terms of graphs. Fatgraphs, a specific type of graph, are central in this thesis. A method based onorthogonal polynomials to count fat graphs is presented. The thesis finishes with theformulation and some results related to the three-color problem.
Place, publisher, year, edition, pages
2016. , 50 p.
UPTEC F, ISSN 1401-5757 ; 16032
Other Physics Topics
IdentifiersURN: urn:nbn:se:uu:diva-298474OAI: oai:DiVA.org:uu-298474DiVA: diva2:946396
Master Programme in Engineering Physics
2016-06-15, 11167, Lägerhyddsvägen 1, Uppsala, 12:34 (Swedish)
Zabzine, Maxim, Professor
Nyberg, TomasMinahan, Joseph, Professor