Related papers: Computing boundary extensions of conformal maps
We study the boundary correspondence under $\mu$-homeomorphisms $f$ of the open upper half-plane onto itself. Sufficient conditions are given for $f$ to admit a homeomorphic extension to the closed half-plane with prescribed boundary…
We use the methods developed with M. Lyubich for proving complex bounds for real quadratics to extend E. De Faria's complex a priori bounds to all critical circle maps with an irrational rotation number. The contracting property for…
Length-constrained expander decompositions are a new graph decomposition that has led to several recent breakthroughs in fast graph algorithms. Roughly, an $(h, s)$-length $\phi$-expander decomposition is a small collection of length…
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
The paper is concerned with a posteriori estimates for approximations of boundary value problems generated by the spectral fractional Laplace operator. The derivation is based upon the Stinga--Torrea extension, which generalizes the…
We prove \emph{uniform solvability estimates} for certain families of elliptic problems posed in a bounded family of domains (for example, a sequence that converges to another domain). We provide uniform estimates both in weighted and in…
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…
In this paper we study differentiability properties of the map $T\mapsto\phi(T)$, where $\phi$ is a given function in the disk-algebra and $T$ ranges over the set of contractions on Hilbert space. We obtain sharp conditions (in terms of…
In this article we present an algorithm to compute bounds on the marginals of a graphical model. For several small clusters of nodes upper and lower bounds on the marginal values are computed independently of the rest of the network. The…
Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems with lengths, distances…
We study the question of local and global uniqueness of completions, based on null geodesics, of Lorentzian manifolds. We show local uniqueness of such boundary extensions. We give a necessary and sufficient condition for existence of…
The Ahlfors-Weill extension of a conformal mapping of the disk is generalized to the lift of a harmonic mapping of the disk to a minimal surface, producing homeomorphic and quasiconformal extensions. The extension is obtained by a…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
This paper addresses the approximation of fractional harmonic maps. Besides a unit-length constraint, one has to tackle the difficulty of nonlocality. We establish weak compactness results for critical points of the fractional Dirichlet…
Let D be a bounded, finitely connected domain in the complex plane without isolated points in the boundary and let f be a continuous function on the boundary bD. Let F be a continuous extension of f to the closure of D. We prove that f…
Given a conformal mapping $f$ of the unit disk $\mathbb D$ onto a simply connected domain $D$ in the complex plane bounded by a closed Jordan curve, we consider the problem of constructing a matching conformal mapping, i.e., the mapping of…
We present the following reflexivity-like result concerning the automorphism group of the $C^*$-algebra B(H), H being a separable Hilbert space. Let $\phi:B(H)\to B(H)$ be a multiplicative map (no linearity or continuity is assumed) which…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
In this note, we characterize the sharp boundary condition such that the fractional harmonic extensions with H\"older regularity up to the boundary is globally H\"older continuous. The proofs are based on estimates of fractional harmonic…
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…