English
Related papers

Related papers: Some Remarks on Non-Planar Diagrams

200 papers

Diagrammatic approaches to perturbation theory transformed the practicability of calculations in particle physics. In the case of extended theories of gravity, however, obtaining the relevant diagrammatic rules is non-trivial: we must…

High Energy Physics - Phenomenology · Physics 2024-10-22 Andrei Lazanu , Peter Millington , Sergio Sevillano Muñoz

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…

Computational Geometry · Computer Science 2012-03-28 Sergio Cabello , Bojan Mohar

This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…

Functional Analysis · Mathematics 2010-04-30 Murad Banaji

We study maps from a 2D world-sheet to a 2D target space which include folds. The geometry of folds is discussed and a metric on the space of folded maps is written down. We show that the latter is not invariant under area preserving…

High Energy Physics - Theory · Physics 2019-08-15 O. Ganor , J. Sonnenschein , S. Yankielowicz

The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…

Combinatorics · Mathematics 2014-02-10 Vassily Olegovich Manturov

It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…

Combinatorics · Mathematics 2014-10-22 K. Dosen , Z. Petric

Scattering amplitudes are often split up into their color (su(N)) and kinematic components. Since the su(N) gauge part can be described using flows of color, one may anticipate that the double su(2) kinematic part can be described in terms…

High Energy Physics - Phenomenology · Physics 2022-04-27 Joakim Alnefjord , Andrew Lifson , Christian Reuschle , Malin Sjodahl

Whitney's theorem states that every 3-connected planar graph is uniquely embeddable on the sphere. On the other hand, it has many inequivalent embeddings on another surface. We shall characterize structures of a $3$-connected $3$-regular…

Combinatorics · Mathematics 2023-06-22 Kengo Enami

The purpose of this paper is to show that, under certain combinatorial conditions on the graph, parametric Feynman integrals can be realized as periods on the complement of the determinant hypersurface in an affine space depending on the…

Algebraic Geometry · Mathematics 2012-04-11 Paolo Aluffi , Matilde Marcolli

The $c_2$ invariants in all 4 different representations of the Feynman period (parametric and dual parametric representations, position and momentum spaces) coincide for all log-divergent graphs that satisfy the combinatorial condition…

Algebraic Geometry · Mathematics 2015-10-14 Dmitry Doryn

By studying the weak closure of multidimensional off-diagonal self-joinings we provide a criterion for non-isomorphism of a flow with its inverse, hence the non-reversibility of a flow. This is applied to special flows over rigid…

Dynamical Systems · Mathematics 2014-05-13 K. Fraczek , J. Kulaga , M. Lemanczyk

We prove several claims made by Kontsevich about the orbifold Euler characteristic of the three types of graph homology introduced by him. For this purpose, first we develop a simplified version of the Feynman diagram method, which requires…

Quantum Algebra · Mathematics 2007-05-23 Ferenc Gerlits

The 2-blowup of a graph is obtained by replacing each vertex with two non-adjacent copies; a graph is biplanar if it is the union of two planar graphs. We disprove a conjecture of Gethner that 2-blowups of planar graphs are biplanar:…

Combinatorics · Mathematics 2024-10-29 David Eppstein

We initiate a systematic study of non-planar on-shell diagrams in N=4 SYM and develop powerful technology for doing so. We introduce canonical variables generalizing face variables, which make the dlog form of the on-shell form explicit. We…

High Energy Physics - Theory · Physics 2016-07-29 Sebastian Franco , Daniele Galloni , Brenda Penante , Congkao Wen

We propose a categorical framework to reason about scientific explanations: descriptions of a phenomenon meant to translate it into simpler terms, or into a context that has been already understood. Our motivating examples come from systems…

Logic in Computer Science · Computer Science 2023-08-01 Leo Lobski , Fabio Zanasi

The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back…

Computational Geometry · Computer Science 2017-07-21 Stephen G. Kobourov , Giuseppe Liotta , Fabrizio Montecchiani

In quantum electrodynamics, optical processes are theoretically described by double-sided Feynman diagrams. This formalism is powerful in the case of molecules but proves inappropriate to account for light-matter interactions within complex…

Optics · Physics 2019-06-10 T. Noblet , C. Humbert

We present significant evidence that the powerful property of Yangian invariance extends to a new large class of conformally invariant Feynman integrals. Our results apply to planar Feynman diagrams in any spacetime dimension dual to an…

High Energy Physics - Theory · Physics 2025-07-01 Vladimir Kazakov , Fedor Levkovich-Maslyuk , Victor Mishnyakov

Negative dimensional integration is a step further dimensional regularization ideas. In this approach, based on the principle of analytic continuation, Feynman integrals are polynomial ones and for this reason very simple to handle,…

High Energy Physics - Theory · Physics 2009-10-30 Alfredo T. Suzuki , Alexandre G. M. Schmidt

In the present paper, we proceed the study of framed $4$-graph minor theory initiated in ``Framed $4$-valent Graph Minor Theory I. Intoduction. Planarity Criterion '' and justify the planarity theorem for arbitrary framed 4-graphs; besides,…

Combinatorics · Mathematics 2014-03-10 Vassily Olegovich Manturov