Related papers: The two-point function of bicolored planar maps
We consider the problem of $2$-coloring geometric hypergraphs. Specifically, we show that there is a constant $m$ such that any finite set of points in the plane $\mathcal{S} \subset {\mathbb R}^2$ can be $2$-colored such that every…
We address the enumeration of q-coloured planar maps counted bythe number of edges and the number of monochromatic edges. We prove that the associated generating function is differentially algebraic,that is, satisfies a non-trivial…
We apply our previous work on Green's functions for the four-dimensional quaternionic Taub-NUT manifold to obtain a scalar two-point function on the homogeneously squashed three-sphere (otherwise known as the Berger sphere), which lies at…
Closed-form generating functions for counting one-face rooted hypermaps with a known number of darts by number of vertices and edges is found, using matrix integral expressions relating to the reduced density operator of a bipartite quantum…
Drawings of non-planar graphs always result in edge crossings. When there are many edges crossing at small angles, it is often difficult to follow these edges, because of the multiple visual paths resulted from the crossings that slow down…
We construct a class of backgrounds with a warp factor and anti-de Sitter asymptotics, which are dual to boundary systems that have a ground state with a short-range two-point correlation function. The solutions of probe scalar fields on…
Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and…
A vertex coloring of a graph $G$ is said to be a 2-distance coloring if any two vertices at distance at most $2$ from each other receive different colors, and the least number of colors for which $G$ admits a $2$-distance coloring is known…
This paper presents an analysis on the effects of floating-point arithmetic on the constructing bifurcation diagram of the quadratic map. More precisely, we are interested in showing the dependence of initial conditions to obtain some…
Given a metric space and a set of distances, one constructs the associated distance graph by taking as vertices the points of the space and as edges the pairs whose distance is in the given set. It is a longstanding open question to…
This paper concerns random bipartite planar maps which are defined by assigning weights to their faces. The paper presents a threefold contribution to the theory. Firstly, we prove the existence of the local limit for all choices of weights…
We developed a modification to the calculation of the two-point correlation function commonly used in the analysis of large scale structure in cosmology. An estimator of the two-point correlation function is constructed by contrasting the…
We discuss the enumeration of planar graphs using bijections with suitably decorated trees, which allow for keeping track of the geodesic distances between faces of the graph. The corresponding generating functions obey non-linear recursion…
We establish two-point distortion theorems for sense-preserving planar harmonic mappings $f=h+\overline{g}$ which satisfies the univalence criteria in the unit disc such that, Becker's and Nehari`s harmonic version. In addition, we find the…
The two-point gauge-invariant correlation function of gluonic field strengths, which is the main input in the stochastic vacuum model, is derived by using its relation to the Green functions of one- and two-gluon gluelumps. These Green…
A {\bf $\mathbf{k}$-majority coloring} of a digraph $D=(V,A)$ is a coloring of $V$ with $k$ colors so that each vertex $v\in V$ has at least as many out-neighbours of color different from its own color as it has out-neighbours with the same…
In the problem of 2-coloring without monochromatic triangles (or triangle-tree 2-coloring), vertices of the simple, connected, undirected graph are colored with either 'black' or 'white' such that there are no 3 mutually adjacent vertices…
The topic of this paper is related to the well-known notion of unit distance graphs. Take a graph with its edges coloured red and blue such that for some $d$ it can be mapped into the plane with all vertices going to distinct points, the…
We consider a situation where the density and peculiar velocities in real space are linear, and we calculate \xi_s the two-point correlation function in redshift space, incorporating all non-linear effects which arise as a consequence of…
We derive a novel deterministic equivalence for the two-point function of a random matrix resolvent. Using this result, we give a unified derivation of the performance of a wide variety of high-dimensional linear models trained with…