Related papers: Some Remarks on Non-Planar Diagrams
The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
We revisit recent results on integrable cases for higher-dimensional generalizations of the 2D pentagram map: short-diagonal, dented, deep-dented, and corrugated versions, and define a universal class of pentagram maps, which are proved to…
This paper is an introduction to the language of Feynman Diagrams. We use Reshetikhin-Turaev graphical calculus to define Feynman diagrams and prove that asymptotic expansions of Gaussian integrals can be written as a sum over a suitable…
The theory of graph limits is only understood to any nontrivial degree in the cases of dense graphs and of bounded degree graphs. There is, however, a lot of interest in the intermediate cases. It appears that the most important…
This paper contains an attempt to formulate rigorously and to check predictions in enumerative geometry of curves following from Mirror Symmetry. The main tool is a new notion of stable map. We give an outline of a contsruction of…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
A broad class of contour gauges is shown to be determined by admissible contractions of the geometrical region considered and a suitable equivalence class of curves is defined. In the special case of magnetostatics, the relevant…
It follows from the work of Tait and the Four-Color-Theorem that a planar cubic graph is 3-edge-colorable if and only if it contains no bridge. We consider the question of which planar graphs are subgraphs of planar cubic bridgeless graphs,…
Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of non-planar graphs in terms of forbidden crossing configurations. Aim of this survey is to describe the main research…
A T-dualized selfdual inspired formulation of massive vector fields coupled to arbitrary matter is generated; subsequently its perturbative series modeling a spontaneously broken gauge theory is analyzed. The new Feynman rules and external…
In this paper, we study the mean curvature flow of graphs with Neumann boundary condition. The main aim is to use the maximum principle to get the boundary gradient estimate for solutions. In particular, we obtain the corresponding…
The Feynman identity (FI) of a planar graph relates the Euler polynomial of the graph to an infinite product over the equivalence classes of closed nonperiodic signed cycles in the graph. The main objectives of this paper are to compute the…
An efficient way to calculate one-loop counterterms within the Feynman diagrammatic approach and dimensional regularization is to expand the propagators in the integrands of the Feynman integrals around vanishing external momentum. In this…
In this paper, we give a polynomial-time algorithm for deciding whether an input bipartite graph admits a 2-layer fan-planar drawing, resolving an open problem posed in several papers since 2015.
In a decision problem, observations are said to be material if they must be taken into account to perform optimally. Decision problems have an underlying (graphical) causal structure, which may sometimes be used to evaluate certain…
We extend the duality between acyclic orientations and totally cyclic orientations on planar graphs to dualities on graphs on orientable surfaces by introducing boundary acyclic orientations and totally bi-walkable orientations. In…
We state some remarks on `$n$-dimensional Feynman diagrams' ($n\in\N$). There are different features between in the case of $n$-dimensional Feynman diagrams($n\geqq3$) and in the 1-, 2-dimensional case.
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…
A graph is \emph{fan-crossing free} if it has a drawing in the plane so that each edge is crossed by independent edges, that is the crossing edges have distinct vertices. On the other hand, it is \emph{fan-crossing} if the crossing edges…