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

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoir:	Panzer, E
Formáid:	Dataset
Teanga:	English
Foilsithe / Cruthaithe:	University of Oxford 2022
Ábhair:	Mathematics

Míreanna comhchosúla

Hepp’s bound for Feynman graphs and matroids
de réir: Panzer, E
Foilsithe / Cruthaithe: (2022)

6loop phi^4 theory
de réir: Panzer, E, et al.
Foilsithe / Cruthaithe: (2017)

The first example of the Fischer–Hepp type rearrangement in pyrimidines
de réir: Inga Cikotiene, et al.
Foilsithe / Cruthaithe: (2013-09-01)

Improved lower bounds on book crossing numbers of complete graphs
de réir: Salazar, G., et al.
Foilsithe / Cruthaithe: (2014)

On the slope filtration of [phi]-modules over the Robba ring
de réir: Liu, Ruochuan
Foilsithe / Cruthaithe: (2009)

Tight upper bound on the maximum anti-forcing numbers of graphs
de réir: Lingjuan Shi, et al.
Foilsithe / Cruthaithe: (2017-10-01)

Bounds on the Twin-Width of Product Graphs
de réir: William Pettersson, et al.
Foilsithe / Cruthaithe: (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
de réir: Gokmen Ceribasi, et al.
Foilsithe / Cruthaithe: (2022-03-01)

Updated census of Feynman periods up to 11 loops
de réir: Panzer, E, et al.
Foilsithe / Cruthaithe: (2017)

Pioneering Mediatization Studies: Аn Interview with Professor Andreas Hepp
de réir: Marina G. Shilina, et al.
Foilsithe / Cruthaithe: (2021-12-01)

Nick COULDRY et Andreas HEPP (2016), The Mediated Construction of Reality
de réir: Élisabeth Schneider
Foilsithe / Cruthaithe: (2018-02-01)

Laparoscopic Hepp Couinaud for the treatment of Caroli's disease: A case report
de réir: Mohamad Hamaoui, et al.
Foilsithe / Cruthaithe: (2023-06-01)

Symmetric bipartite graphs and graphs with loops
de réir: Grant Cairns, et al.
Foilsithe / Cruthaithe: (2015-02-01)

Cycle transversals in bounded degree graphs
de réir: Marina Groshaus, et al.
Foilsithe / Cruthaithe: (2011-03-01)

Bounds for the smallest $k$-chromatic graphs of given girth
de réir: Geoffrey Exoo, et al.
Foilsithe / Cruthaithe: (2019-03-01)

On a lower bound for the Laplacian eigenvalues of a graph
de réir: Greaves, Gary Royden Watson, et al.
Foilsithe / Cruthaithe: (2020)

Determining Number of Kneser Graphs: Exact Values and Improved Bounds
de réir: Angsuman Das, et al.
Foilsithe / Cruthaithe: (2022-03-01)

Isolation and characterization of HepP: a virulence-related Pseudomonas aeruginosa heparinase
de réir: Nyaradzo Dzvova, et al.
Foilsithe / Cruthaithe: (2017-12-01)

Andreas Hepp (2011): Medienkultur. Die Kultur mediatisierter Welten. Wiesbaden: VS
de réir: Knut Hickethier
Foilsithe / Cruthaithe: (2013-01-01)

An upper bound for the chromatic number of line graphs
de réir: Andrew D. King, et al.
Foilsithe / Cruthaithe: (2005-01-01)

Asymptotic problems for differential equations with bounded $\Phi$-Laplacian
de réir: Zuzana Dosla, et al.
Foilsithe / Cruthaithe: (2009-10-01)

A Lower Bound of 1+phi for Truthful Scheduling Mechanisms
de réir: Koutsoupias, E, et al.
Foilsithe / Cruthaithe: (2015)

Acyclic colourings of graphs with bounded degree
de réir: Mieczyslaw Borowiecki, et al.
Foilsithe / Cruthaithe: (2010-01-01)

Wilson loops and their gravity duals in AdS4/CFT3
de réir: Farquet, D
Foilsithe / Cruthaithe: (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.
de réir: E. Dijkhof
Foilsithe / Cruthaithe: (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.
de réir: E. Dijkhof
Foilsithe / Cruthaithe: (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.
de réir: E. Dijkhof
Foilsithe / Cruthaithe: (2004-01-01)

Irreversible 2-conversion set in graphs of bounded degree
de réir: Jan Kynčl, et al.
Foilsithe / Cruthaithe: (2017-09-01)

Time-delayed feedback control of the Dicke–Hepp–Lieb superradiant quantum phase transition
de réir: Wassilij Kopylov, et al.
Foilsithe / Cruthaithe: (2015-01-01)

A bound on the number of perfect matchings in Klee-graphs
de réir: Marek Cygan, et al.
Foilsithe / Cruthaithe: (2013-01-01)

Improving bounds on packing densities of 4-point permutations
de réir: Jakub Sliacan, et al.
Foilsithe / Cruthaithe: (2018-02-01)

Empirical Phi-discrepancies and quasi-empirical likelihood: exponential bounds
de réir: Bertail Patrice, et al.
Foilsithe / Cruthaithe: (2015-10-01)

Minimum survivable graphs with bounded distance increase
de réir: Selma Djelloul, et al.
Foilsithe / Cruthaithe: (2003-01-01)

Bounded-degree graphs have arbitrarily large queue-number
de réir: David R. Wood
Foilsithe / Cruthaithe: (2008-01-01)

M. Gumbert-Hepp, Computus Magistri Jacobi. Een schoolboek voor tijdrekenkunde uit 1436
de réir: N. Lettinck
Foilsithe / Cruthaithe: (1989-01-01)

M. Gumbert-Hepp, Computus Magistri Jacobi. Een schoolboek voor tijdrekenkunde uit 1436
de réir: N. Lettinck
Foilsithe / Cruthaithe: (1989-01-01)

M. Gumbert-Hepp, Computus Magistri Jacobi. Een schoolboek voor tijdrekenkunde uit 1436
de réir: N. Lettinck
Foilsithe / Cruthaithe: (1989-01-01)

An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth
de réir: Zongwen Bai, et al.
Foilsithe / Cruthaithe: (2019-11-01)

Complete graph K4 decomposition into circuits of length 4
de réir: Mohd Darus, Maizon, et al.
Foilsithe / Cruthaithe: (2014)

Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs
de réir: Greaves, Gary Royden Watson, et al.
Foilsithe / Cruthaithe: (2022)