2000 character limit reached
Some Remarks on Non-Planar Diagrams
Published 19 Dec 2013 in hep-ph | (1312.5603v1)
Abstract: Two criteria for planarity of a Feynman diagram upon its propagators (momentum flows) are presented. Instructive Mathematica programs that solve the problem and examples are provided. A simple geometric argument is used to show that while one can planarize non-planar graphs by embedding them on higher-genus surfaces (in the example it is a torus), there is still a problem with defining appropriate dual variables since the corresponding faces of the graph are absorbed by torus generators.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.