Related papers: The three-point function of general planar maps
A geometrical approach to the calculation of N-point Feynman diagrams is reviewed. It is shown that the geometrical splitting yields useful connections between Feynman integrals with different momenta and masses. It is demonstrated how…
We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…
We study generating functions of ordinary and plane partitions coloured by the action of a finite subgroup of the corresponding special linear group. After reviewing known results for the case of ordinary partitions, we formulate a…
In one complex variable, the cross ratio is a well-known quantity associated with four given points in the complex plane that remains invariant under linear fractional maps. In particular, if one knows where three points in the complex…
We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized…
In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…
We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require $\Omega(n^\frac{2}{3})$ edges each having $\Omega(n^\frac{1}{3})$ bends in the worst case. The lower bound…
Computing the distance function to some surface or line is a problem that occurs very frequently. There are several ways of computing a relevant approximation of this function, using for example technique originating from the approximation…
This paper defines a distance function that measures the dissimilarity between planar geometric figures formed with straight lines. This function can in turn be used in partial matching of different geometric figures. For a given pair of…
Estimating a depth map from multiple views of a scene is a fundamental task in computer vision. As soon as more than two viewpoints are available, one faces the very basic question how to measure similarity across >2 image patches.…
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is…
Tensor diagrams are a handy way to depict complicated relationships between objects in projective geometry. One of the simpler ones takes two copies of a $3\times 3$ matrix and computes its adjugate. In this paper, we give a geometric…
Trivalent $2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where three sheets meet. We develop operations on their associated labeled graphs that will effectively construct from a single…
A graph drawn in the plane with straight-line edges is called a geometric graph. If no path of length at most $k$ in a geometric graph $G$ is self-intersecting we call $G$ $k$-locally plane. The main result of this paper is a construction…
We discuss a method for computing the generating function for the multiplicity distribution in field theories with strong time dependent external sources. At leading order, the computation of the generating function reduces to finding a…
We study scaling function geometry. We show the existence of the scaling function of a geometrically finite one-dimensional mapping. This scaling function is discontinuous. We prove that the scaling function and the asymmetries at the…
Let $X,Y,Z$ and $W$ be normed spaces and $f:X\times Y\times Z\longrightarrow W $ be a bounded tri-linear mapping. In this Article, we define the topological centers for bounded tri-linear mapping and we invistagate thier properties. We…
The choice of data representation is a key factor in the success of deep learning in geometric tasks. For instance, DUSt3R recently introduced the concept of viewpoint-invariant point maps, generalizing depth prediction and showing that all…
We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…
A hypermap is bipartite if its set of flags can be divided into two parts A and B so that both A and B are the union of vertices, and consecutive vertices around an edge or a face are contained in alternate parts. A bipartite hypermap is…