Change search
ReferencesLink to record
Permanent link

Direct link
Feynman Diagrams and Map Enumeration
Uppsala University, Disciplinary Domain of Science and Technology, Physics, Department of Physics and Astronomy, Theoretical Physics.
2016 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

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
National Category
Other Physics Topics
URN: urn:nbn:se:uu:diva-298474OAI: diva2:946396
Educational program
Master Programme in Engineering Physics
2016-06-15, 11167, Lägerhyddsvägen 1, Uppsala, 12:34 (Swedish)
Available from: 2016-07-05 Created: 2016-07-05 Last updated: 2016-07-05Bibliographically approved

Open Access in DiVA

Feynman Diagrams and Map Enumeration(794 kB)48 downloads
File information
File name FULLTEXT01.pdfFile size 794 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Theoretical Physics
Other Physics Topics

Search outside of DiVA

GoogleGoogle Scholar
Total: 48 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 262 hits
ReferencesLink to record
Permanent link

Direct link