Related papers: Counting planar diagrams with various restrictions
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar…
A convenient integral representation for zig-zag four-point and two-point planar Feynman diagrams relevant to the bi-scalar D-dimensional fishnet field theory is obtained. This representation gives a possibility to evaluate exactly diagrams…
We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to…
We describe a general analytic-numerical reduction scheme for evaluating any 2-loop diagrams with general kinematics and general renormalizable interactions, whereby ten special functions form a complete set after tensor reduction. We…
We further develop an algorithmic and diagrammatic computational framework for very general exact renormalization groups, where the embedded regularisation scheme, parametrised by a general cutoff function and infinitely many higher point…
A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithms, it is in the class $AC^1$. In this paper we improve the…
Let $\Delta =\{ \delta_1,\delta_2,...,\delta_m \} $ be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function $D_{\Delta }(z,u_1,u_2,...,u_m),$ which counts polygon dissections and marks…
In network theory, a triad census is a method designed to categorize and enumerate the various types of subgraphs with three nodes and their connecting edges within a network. Triads serve as fundamental building blocks for comprehending…
We consider embeddings of planar graphs in $R^2$ where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar…
A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq…
A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…
A graph $G$ is $k$-degenerate if it can be transformed into an empty graph by subsequent removals of vertices of degree $k$ or less. We prove that every connected planar graph with average degree $d \ge 2$ has a 4-degenerate induced…
A coarse-grained description of the restricted primitive model is considered in terms of the local charge- and number-density fields. Exact reduction to a one-field theory is derived, and exact expressions for the number-density correlation…
We perform Monte Carlo calculation of correlation functions in 4d N=4 super Yang-Mills theory on R*S^3 in the planar limit. In order to circumvent the well-known problem of lattice SUSY, we adopt the idea of a novel large-N reduction, which…
This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgraph. We provide explicit measurement constructions for several…
Solving the exact renormalisation group equation a la Wilson-Polchinski perturbatively, we derive a power-counting theorem for general matrix models with arbitrarily non-local propagators. The power-counting degree is determined by two…
We study the impact of forbidding short cycles to the edge density of $k$-planar graphs; a $k$-planar graph is one that can be drawn in the plane with at most $k$ crossings per edge. Specifically, we consider three settings, according to…
We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentations can be recognised algorithmically. As a…
We study the renormalized perturbation theory of the single-impurity Anderson model, particularly the high-order terms in the expansion of the self-energy in powers of the renormalized coupling $\tilde{U}$. Though the presence of…