Related papers: Planar maps and continued fractions
We prove that the branching set of a solution to a two-dimensional two-phase Bernoulli problem with constant coefficients is locally finite. We do this via a Weierstrass representation formula, which allows to transform the problem into a…
We discuss the asymptotic behaviour of random critical Boltzmann planar maps in which the degree of a typical face belongs to the domain of attraction of a stable law with index $\alpha \in (1,2]$. We prove that when conditioning such maps…
Explicit formulas expressing the solution to non-autonomous differential equations are of great importance in many application domains such as control theory or numerical operator splitting. In particular, intrinsic formulas allowing to…
We prove a structure theorem for the solutions of nonlinear thin two-membrane problems in dimension two. Using the theory of quasi-conformal maps, we show that the difference of the sheets is topologically equivalent to a solution of the…
The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph…
We analyse uniform random cubic rooted planar maps and obtain limiting distributions for several parameters of interest. From the enumerative point of view, we present a unified approach for the enumeration of several classes of cubic…
Motivated by applications to stochastic programming, we introduce and study the expected-integral functionals, which are mappings given in an integral form depending on two variables, the first a finite dimensional decision vector and the…
We show how our recent results on compositions of d.c. functions (and mappings) imply positive results on extensions of d.c. functions (and mappings). Examples answering two natural relevant questions are presented. Two further theorems,…
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…
In this paper, we study square functions for extension operators over finite-type, planar curves endowed with the Euclidean arclength measure. We prove new results for curves of the form $(T,\phi(T))$ where $\phi(T)$ is a polynomial of…
We consider a large class of physical fields $u$ written as double inverse Fourier transforms of some functions $F$ of two complex variables. Such integrals occur very often in practice, especially in diffraction theory. Our aim is to…
In this paper, we study the problem of map matching with travel time constraints. Given a sequence of $k$ spatio-temporal measurements and an embedded path graph with travel time costs, the goal is to snap each measurement to a close-by…
Shape recognition and classification is a problem with a wide variety of applications. Several recent works have demonstrated that topological descriptors can be used as summaries of shapes and utilized to compute distances. In this…
Proximal operators with affine constraints arise in numerous models in nonconvex projection, composite optimization, and structured regularization. However, their efficient computation remains challenging due to the simultaneous presence of…
In this paper, we consider the indefinite scalar curvature problem on $R^n$. We propose new conditions on the prescribing scalar curvature function such that the scalar curvature problem on $R^n$ (similarly, on $S^n$) has at least one…
Based on the needs of convergence proofs of preconditioned proximal point methods, we introduce notions of partial strong submonotonicity and partial (metric) subregularity of set-valued maps. We study relationships between these two…
The $k$-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed $k$ when restricted to the class of planar…
We characterize the generating function of bipartite planar maps counted according to the degree distribution of their black and white vertices. This result is applied to the solution of the hard particle and Ising models on random planar…
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…
We establish bounds on a finite separable extension of function fields in terms of the relative class number, thus reducing the problem of classifying extensions with a fixed relative class number to a finite computation. We also solve the…