Hepp bounds of phi^4 graphs with <=11 loops
This text is human readable and also compatible with the MAPLE computer algebra system. It contains the values of the Hepp bound (the volume of the polar of the spanning tree polytope) of graphs that arise from 4-regular graphs after deleting a vertex. The data was computed with a MAPLE program on 2...
Main Author: | Panzer, E |
---|---|
Format: | Dataset |
Language: | English |
Published: |
University of Oxford
2022
|
Subjects: |
Similar Items
-
Hepp’s bound for Feynman graphs and matroids
by: Panzer, E
Published: (2022) -
6loop phi^4 theory
by: Panzer, E, et al.
Published: (2017) -
Updated census of Feynman periods up to 11 loops
by: Panzer, E, et al.
Published: (2017) -
A Lower Bound of 1+phi for Truthful Scheduling Mechanisms
by: Koutsoupias, E, et al.
Published: (2015) -
On the slope filtration of [phi]-modules over the Robba ring
by: Liu, Ruochuan
Published: (2009)