Hepp bounds of phi^4 graphs with <=11 loops

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...

Bibliografski detalji
Glavni autor:	Panzer, E
Format:	Dataset
Jezik:	English
Izdano:	University of Oxford 2022
Teme:	Mathematics

Slični predmeti

Hepp’s bound for Feynman graphs and matroids
od: Panzer, E
Izdano: (2022)

6loop phi^4 theory
od: Panzer, E, i dr.
Izdano: (2017)

The first example of the Fischer–Hepp type rearrangement in pyrimidines
od: Inga Cikotiene, i dr.
Izdano: (2013-09-01)

Improved lower bounds on book crossing numbers of complete graphs
od: Salazar, G., i dr.
Izdano: (2014)

On the slope filtration of [phi]-modules over the Robba ring
od: Liu, Ruochuan
Izdano: (2009)

Tight upper bound on the maximum anti-forcing numbers of graphs
od: Lingjuan Shi, i dr.
Izdano: (2017-10-01)

Bounds on the Twin-Width of Product Graphs
od: William Pettersson, i dr.
Izdano: (2023-06-01)

Investigation of the Effect of Climate Change on Energy Produced by Hydroelectric Power Plants (HEPPs) by Trend Analysis Method: A Case Study for Dogancay I–II HEPPs
od: Gokmen Ceribasi, i dr.
Izdano: (2022-03-01)

Updated census of Feynman periods up to 11 loops
od: Panzer, E, i dr.
Izdano: (2017)

Pioneering Mediatization Studies: Аn Interview with Professor Andreas Hepp
od: Marina G. Shilina, i dr.
Izdano: (2021-12-01)

Nick COULDRY et Andreas HEPP (2016), The Mediated Construction of Reality
od: Élisabeth Schneider
Izdano: (2018-02-01)

Laparoscopic Hepp Couinaud for the treatment of Caroli's disease: A case report
od: Mohamad Hamaoui, i dr.
Izdano: (2023-06-01)

Symmetric bipartite graphs and graphs with loops
od: Grant Cairns, i dr.
Izdano: (2015-02-01)

Cycle transversals in bounded degree graphs
od: Marina Groshaus, i dr.
Izdano: (2011-03-01)

Bounds for the smallest $k$-chromatic graphs of given girth
od: Geoffrey Exoo, i dr.
Izdano: (2019-03-01)

On a lower bound for the Laplacian eigenvalues of a graph
od: Greaves, Gary Royden Watson, i dr.
Izdano: (2020)

Determining Number of Kneser Graphs: Exact Values and Improved Bounds
od: Angsuman Das, i dr.
Izdano: (2022-03-01)

Isolation and characterization of HepP: a virulence-related Pseudomonas aeruginosa heparinase
od: Nyaradzo Dzvova, i dr.
Izdano: (2017-12-01)

Andreas Hepp (2011): Medienkultur. Die Kultur mediatisierter Welten. Wiesbaden: VS
od: Knut Hickethier
Izdano: (2013-01-01)

An upper bound for the chromatic number of line graphs
od: Andrew D. King, i dr.
Izdano: (2005-01-01)

Asymptotic problems for differential equations with bounded $\Phi$-Laplacian
od: Zuzana Dosla, i dr.
Izdano: (2009-10-01)

A Lower Bound of 1+phi for Truthful Scheduling Mechanisms
od: Koutsoupias, E, i dr.
Izdano: (2015)

Acyclic colourings of graphs with bounded degree
od: Mieczyslaw Borowiecki, i dr.
Izdano: (2010-01-01)

Wilson loops and their gravity duals in AdS4/CFT3
od: Farquet, D
Izdano: (2015)

M. Gumbert-Hepp, J.P. Gumbert, Willem Procurator. Kroniek. Editie en vertaling van het Chronicon van Wilhelmus Procurator, Gumbert-Hepp, M., met medewerking van Gumbert, J. P. ed.
od: E. Dijkhof
Izdano: (2004-01-01)

M. Gumbert-Hepp, J.P. Gumbert, Willem Procurator. Kroniek. Editie en vertaling van het Chronicon van Wilhelmus Procurator, Gumbert-Hepp, M., met medewerking van Gumbert, J. P. ed.
od: E. Dijkhof
Izdano: (2004-01-01)

M. Gumbert-Hepp, J.P. Gumbert, Willem Procurator. Kroniek. Editie en vertaling van het Chronicon van Wilhelmus Procurator, Gumbert-Hepp, M., met medewerking van Gumbert, J. P. ed.
od: E. Dijkhof
Izdano: (2004-01-01)

Irreversible 2-conversion set in graphs of bounded degree
od: Jan Kynčl, i dr.
Izdano: (2017-09-01)

Time-delayed feedback control of the Dicke–Hepp–Lieb superradiant quantum phase transition
od: Wassilij Kopylov, i dr.
Izdano: (2015-01-01)

A bound on the number of perfect matchings in Klee-graphs
od: Marek Cygan, i dr.
Izdano: (2013-01-01)

Improving bounds on packing densities of 4-point permutations
od: Jakub Sliacan, i dr.
Izdano: (2018-02-01)

Empirical Phi-discrepancies and quasi-empirical likelihood: exponential bounds
od: Bertail Patrice, i dr.
Izdano: (2015-10-01)

Minimum survivable graphs with bounded distance increase
od: Selma Djelloul, i dr.
Izdano: (2003-01-01)

Bounded-degree graphs have arbitrarily large queue-number
od: David R. Wood
Izdano: (2008-01-01)

M. Gumbert-Hepp, Computus Magistri Jacobi. Een schoolboek voor tijdrekenkunde uit 1436
od: N. Lettinck
Izdano: (1989-01-01)

M. Gumbert-Hepp, Computus Magistri Jacobi. Een schoolboek voor tijdrekenkunde uit 1436
od: N. Lettinck
Izdano: (1989-01-01)

M. Gumbert-Hepp, Computus Magistri Jacobi. Een schoolboek voor tijdrekenkunde uit 1436
od: N. Lettinck
Izdano: (1989-01-01)

An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth
od: Zongwen Bai, i dr.
Izdano: (2019-11-01)

Complete graph K4 decomposition into circuits of length 4
od: Mohd Darus, Maizon, i dr.
Izdano: (2014)

Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs
od: Greaves, Gary Royden Watson, i dr.
Izdano: (2022)