Related papers: On the two-point function of general planar maps a…
The purpose of this article has two fold. The first is to generalize some recent second main theorems for the mappings and moving hyperplanes of $\P^n(\C)$ to the case where the counting functions are truncated multiplicity (by level $n$)…
In this article, I provide a solution to a rank computation problem related to the computation of the Hilbert-Kunz function for any disjoint-term trinomial hypersurface, over any field of characteristic 2. This rank computation problem was…
The relation between fixed point and orbit count sequences is investigated from the point of view of linear mappings on the space of arithmetic functions. Spectral and asymptotic properties are derived and several quantities are explicitly…
Using the circle method, we count integer points on complete intersections in biprojective space in boxes of different side length, provided the number of variables is large enough depending on the degree of the defining equations and…
This paper develops asymptotic methods to count faces of random high-dimensional polytopes. Beyond its intrinsic interest, our conclusions have surprising implications - in statistics, probability, information theory, and signal processing…
Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2…
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 brief communication a new method is outlined for modelling magnification patterns on an observer's plane using a first order approximation to the null geodesic path equations for a point mass lens. For each ray emitted from a…
We give a new proof of the result that if f and g are transcendental entire functions, then the composite function f(g) has infinitely many fixed points. The method yields a number of generalization of this result. In particular, it extends…
In this paper, we adapt the two topological numbers, which have been proposed to efficiently characterize simple points in specific neighborhoods for 3D binary images, to the case of 2D binary images. Unlike the 3D case, we only use a…
Constellations and hypermaps generalize combinatorial maps, i.e. embedding of graphs in a surface, in terms of factorization of permutations. In this paper, we extend a result of Jackson and Visentin (1990) stating an enumerative relation…
We prove the local convergence of uniform bipartite maps with prescribed face degrees in the high genus regime. Unlike in the previous work arxiv:2012.05813 on the subject, we do not make any assumption on the tail of the face degrees,…
The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…
We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…
Evaluation of three- and four-point diagrams with massless internal particles and arbitrary external momenta is considered. Exact results for some two-loop diagrams (planar and non-planar three-point contributions and the "double box"…
It is a well-known fact that hamiltonicity in planar cubic graphs is an NP-complete problem. This implies that the existence of an A-trail in plane eulerian graphs is also an NP-complete problem even if restricted to planar 3-connected…
An exact conservative remapping scheme requires overlaps between two meshes and a reconstruction scheme on the old cells (Lagrangian mesh). While the are intensive discussion on reconstruction schemes, there are relative sparse discussion…
There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual…
We use three different methods to count the number of lines in the plane whose intersection with a fixed general quintic has fixed cross-ratios. We compare and contrast these methods, shedding light on some classical ideas which underly…
The anisotropic 2-point correlation function (2PCF) of galaxies measures pairwise clustering as a function of the pair separation's angle to the line of sight. The latter is often defined as either the angle bisector of the…