Spanning Forest Polynomials and the Transcendental Weight of Feynman Graphs

被引：41
|
作者：
Brown, Francis [1 ]
Yeats, Karen [2 ]
机构：
[1] Univ Paris 06, Inst Math Jussieu Paris, UMR 7586, F-75005 Paris, France
[2] Simon Fraser Univ, Dept Math, Burnaby, BC V5A 156, Canada
来源：
COMMUNICATIONS IN MATHEMATICAL PHYSICS | 2011年 / 301卷 / 02期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Span Tree; Feynman Graph; Feynman Integral; White Vertex; Weight Drop;
D O I：
10.1007/s00220-010-1145-1
中图分类号：
O4 [物理学];
学科分类号：
0702 ;
摘要：
We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in phi(4) theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a list of subgraphs which induce a drop in the transcendental weight.
引用
收藏
页码：357 / 382
页数：26
相关论文
共 50 条
  • [21] FEYNMAN GRAPHS FOR SUPERFIELDS
    CAPPER, DM
    NUOVO CIMENTO DELLA SOCIETA ITALIANA DI FISICA A-NUCLEI PARTICLES AND FIELDS, 1975, A 25 (02): : 259 - 272
  • [22] FACTORIZATION OF POLYNOMIALS BY TRANSCENDENTAL EVALUATION
    VANDERHULST, MP
    LENSTRA, AK
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 204 : 138 - 145
  • [23] Properties of Feynman graph polynomials
    Bogner, Christian
    NUCLEAR PHYSICS B-PROCEEDINGS SUPPLEMENTS, 2010, 205-06 : 116 - 121
  • [24] Counting Feynman-like graphs: Quasimodularity and Siegel-Veech weight
    Goujard, Elise
    Moeller, Martin
    JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2020, 22 (02) : 365 - 412
  • [25] Bipartite graphs as polynomials and polynomials as bipartite graphs
    Grinblat, Andrey
    Lopatkin, Viktor
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2021, 20 (05)
  • [26] An Efficient Transactional Memory Algorithm for Computing Minimum Spanning Forest of Sparse Graphs
    Kang, Seunghwa
    Bader, David A.
    ACM SIGPLAN NOTICES, 2009, 44 (04) : 15 - 24
  • [27] Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs
    Khoshkhah, Kaveh
    Ghadikolaei, Mehdi Khosravian
    Monnot, Jerome
    Theis, Dirk Oliver
    THEORETICAL COMPUTER SCIENCE, 2019, 775 : 1 - 15
  • [28] Constant-time dynamic weight approximation for minimum spanning forest
    Henzinger, Monika
    Peng, Pan
    INFORMATION AND COMPUTATION, 2021, 281
  • [29] A study of Feynman integrals with uniform transcendental weights and their symbology
    Song He
    Zhenjie Li
    Rourou Ma
    Zihao Wu
    Qinglin Yang
    Yang Zhang
    Journal of High Energy Physics, 2022
  • [30] A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees
    Perrett, Thomas
    DISCRETE MATHEMATICS, 2016, 339 (11) : 2706 - 2714
12345