Related papers: The three-point function of general planar maps
We demonstrate a construction method based on a gain function that is defined on the incidence graph of an incidence geometry. Restricting to when the incidence geometry is a linear space, we show that the construction yields a generalized…
We classify the 3-point functions of local gauge-invariant single-trace operators in the scalar sector of planar N=4 supersymmetric Yang-Mills involving at least one su(3) operator. In the case of two su(3) and one su(2) operators, the…
Suppose that the 3-manifold M is given by integral surgery along a link L in S^3. In the following we construct a stable map from M to the plane, whose singular set is canonically oriented. We obtain upper bounds for the minimal numbers of…
One dimensional metrical geometry may be developed in either an affine or projective setting over a general field using only algebraic ideas and quadratic forms. Some basic results of universal geometry are already present in this…
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. We present upper and lower bounds on the…
A multigraph is exactly k-edge-connected if there are exactly k edge-disjoint paths between any pair of vertices. We characterize the class of exactly 3-edge-connected graphs, giving a synthesis involving two operations by which every…
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have been made to provide accurate models. We study here a model…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
Extracting planes from a 3D scene is useful for downstream tasks in robotics and augmented reality. In this paper we tackle the problem of estimating the planar surfaces in a scene from posed images. Our first finding is that a surprisingly…
GAP functions are useful for solving optimization problems, but the literature contains a variety of different concepts of GAP functions. It is interesting to point out that these concepts have many similarities. Here we introduce…
In this work we present a unified method of relative camera pose estimation from points and lines correspondences. Given a set of 2D points and lines correspondences in three views, of which two are known, a method has been developed for…
A general two dimensional fractional supersymmetric conformal field theory is investigated. The structure of the symmetries of the theory is studied. Then, applying the generators of the closed subalgebra generated by $(L_{-1}, L_{0},…
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 show how the theory of tangles is equivalent to that of well-connected tangles. These are drawn on a surface with boundary, and equivalent via Reidemeister moves of a restricted kind. This reworking of the graphical foundations for link…
Classical hypergeometric functions are well-known to play an important role in arithmetic algebraic geometry. These functions offer solutions to ordinary differential equations, and special cases of such solutions are periods of…
Inspired by the paper of Bonichon, Bousquet-M\'elou, Dorbec and Pennarun, we give a system of functional equations which characterise the ordinary generating function, $U(x),$ for the number of planar Eulerian orientations counted by edges.…
We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…
The paper deals with the problem of approximating the functions of several variables by branched continued fractions, in particular, multidimensional A- and J-fractions with independent variables. A generalization of Gragg's algorithm is…
A connected graph is called a multi-block graph if each of its blocks is a complete multi-partite graph. Building on the work of \cite{Bp3,Hou3}, we compute the determinant and inverse of the distance matrix for a class of multi-block…
To definite and compute differential invariants, like curvatures, for triangular meshes (or polyhedral surfaces) is a key problem in CAGD and the computer vision. The Gaussian curvature and the mean curvature are determined by the…