Related papers: The three-point function of general planar maps
In this paper, we discuss some problems of elementary plane differential geometry and kinematics. Although the results are not new, the consistent use of complex-valued functions (plane curves) of a real variable (parameter) allows to…
A random geometric graph, $G(n,r)$, is formed by choosing $n$ points independently and uniformly at random in a unit square; two points are connected by a straight-line edge if they are at Euclidean distance at most $r$. For a given…
We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…
We study the relation between an R-Cartan structure {\alpha} and an (I, J, K)- generalized Finsler structure on a 3-manifold showing the difficulty in finding a general transformation that maps these structures each other. In some…
Using the method of moving frames we analyze the algebra of differential invariants for surfaces in three-dimensional affine geometry. For elliptic, hyperbolic, and parabolic points, we show that if the algebra of differential invariants is…
Bipolar orientations of planar maps have recently attracted some interest in combinatorics, probability theory and theoretical physics. Plane bipolar orientations with $n$ edges are known to be counted by the $n$th Baxter number $b(n)$,…
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. The tripartite-circle crossing number of…
We present a new algorithm to rapidly compute the two-point (2PCF), three-point (3PCF) and n-point (n-PCF) correlation functions in roughly O(N log N) time for N particles, instead of O(N^n) as required by brute force approaches. The…
Approximation of entire functions by their pad\'e approximants has been examined in the past. It is true that generically such an approximation holds. However, examining this problem from another viewpoint, we obtain stronger generic…
A reflection mapping is a singular holomorphic mapping obtained by restricting the quotient mapping of a complex reflection group. We study the analytic structure of double point spaces of reflection mappings. In the case where the image is…
For every integer $\ell$, we construct a cubic 3-vertex-connected planar bipartite graph $G$ with $O(\ell^3)$ vertices such that there is no planar straight-line drawing of $G$ whose vertices all lie on $\ell$ lines. This strengthens…
We provide an elementary derivation of an orthogonal coordinate system for boundary layers around evolving smooth surfaces and curves based on the signed-distance function. We go beyond previous works on the signed-distance function and…
We propose to relax the classic Cauchy-Riemann equations for a mapping. We support the interest of such a proposal by looking at one specific situation in 3D, and proving the existence of pairs of harmonic conjugate functions with respect…
We obtain sufficient conditions for existence of unique fixed point of Kannan type mappings on complete metric spaces and on generalized complete metric spaces depended an another function.
Let f be a generic polynomial mapping mapping from the plane to the plane. There are constructed quadratic forms whose signatures determine the number of positive and negative cusps of f.
We define a generalized vector partition function and derive an identity for generating series of such functions associated with solutions of basic recurrence relation of combinatorial analysis. As a consequence, we obtain the generating…
Manifolds occur naturally as configuration spaces of robotic systems. They provide global descriptions of local coordinate systems that are common tools in expressing positions of robots. The purpose of this survey is threefold. Firstly, we…
Several important algorithms for machine learning and data analysis use pairwise distances as input. On Riemannian manifolds these distances may be prohibitively costly to compute, in particular for large datasets. To tackle this problem,…
We consider the following problem: Given a set $S$ of $n$ distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on $S$? Each spanning path must be crossing-free, but edges from different paths…
We recursively compute the Gromov-Witten invariants of the Hilbert scheme of two points in the plane. By studying the space of stable maps and computing virtual contributions, we use these invariants to enumerate hyperelliptic plane curves…