Code and data for mathematical research classifying certain Feynman graphs by forbidden minors
Investigation into combinatorial characterization of weighted Feynman graphs satisfying a certain integration condition motivated by quantum physics. Code is primarily written in Sage mathematical software (built on Python) and C++, and includes a new FeynmanGraph class with specialized methods and auxiliary functions to perform exhaustive searches over classes of graphs and induced subgraphs and spanning trees.
Data files associated to various named configurations confirm conjectures by brute force that are also proved in the paper using more elegant mathematical arguments.
- Postdoc: at Simon Fraser University during academic year 2010–2011
- Supervisor: Karen Yeats.
Forbidden minors for graphs with no first obstruction to parametric Feynman integration