Related papers: The three-point function of general planar maps
Explicit expressions are considered for the generating functions concerning the number of planar diagrams with given numbers of 3- and 4-point vertices. It is observed that planar renormalization theory requires diagrams with restrictions,…
In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this…
The problem of construction of the surfaces with given sets of the points with horizontal tangential planes is considered. Such considerations are of interest in the problem of computer simulations of the waved ocean surfaces.
We investigate geometric properties of surfaces given by certain formulae. In particular, we calculate the singular curvature and the limiting normal curvature of such surfaces along the set of singular points consisting of singular points…
We study 3-point functions at finite temperature in the closed time path formalism. We give a general decomposition of the eight component tensor in terms of seven vertex functions. We derive a spectral representation for these seven…
We introduce a new type of mappings in metric space which are three-point analogue of the well-known Chatterjea type mappings, and call them generalized Chatterjea type mappings. It is shown that such mappings can be discontinuous as is the…
We consider the problem of enumerating planar constellations with two points at a prescribed distance. Our approach relies on a combinatorial correspondence between this family of constellations and the simpler family of rooted…
We discuss the calculation of two-point three-loop functions with an arbitrary number of massive propagators and one large external momentum. The relevant subdiagrams are generated automatically. The resulting massless two-point integrals…
We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.
We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…
A theory of graded manifolds can be viewed as a generalization of differential geometry of smooth manifolds. It allows one to work with functions which locally depend not only on ordinary real variables, but also on $\mathbb{Z}$-graded…
Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…
In this paper, we study the existence of fixed points for mappings defined on complete metric space (X, d) satisfying a general contractive inequality of integral type depended on another function. This conditions is analogous of Banach…
It is shown how the geometrical splitting of N-point Feynman diagrams can be used to simplify the parametric integrals and reduce the number of variables in the occurring functions. As an example, a calculation of the…
We give a construction that provides infinitely many 2-connected, cubic, bipartite, and planar graphs G with 3k vertices and such that the number of disjoint copies of a 3-vertex path in G is less than k.
This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.
This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…
We consider planar maps with three boundaries, colloquially called pairs of pants. In the case of bipartite maps with controlled face degrees, a simple expression for their generating function was found by Eynard and proved bijectively by…
We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…
In this note, we show that in planar pointsets determining many unit distances, these unit distances must span many directions. Specifically, we show that a set of $n$ points can determine only $o(n^{4/3})$ unit distances from a set of at…