Related papers: Computability in Harmonic Analysis
Let $\Omega\subset \mathbb{R}^{n+1}$ be an open set, not necessarily connected, with an $n$-dimensional uniformly rectifiable boundary. We show that $\partial\Omega$ may be approximated in a "Big Pieces" sense by boundaries of chord-arc…
Let $\Omega \subset \mathbb{R}^{n+1}$, $n \geq 1$, be an open and connected set. Set $\mathcal{T}_n$ to be the set of points $\xi \in \partial \Omega$ so that there exists an approximate tangent $n$-plane for $\partial\Omega$ at $\xi$ and…
We study the problem of approximating plurisubharmonic functions on a bounded domain $\Omega$ by continuous plurisubharmonic functions defined on neighborhoods of $\bar\Omega$. It turns out that this problem can be linked to the problem of…
We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…
Conformal mapping may be the best-known topic in complex analysis. Any simply connected nonempty domain $\Omega$ in the complex plane ${{\mathbb{C}}}$ (assuming $\Omega\ne {{\mathbb{C}}}$) can be mapped bijectively to the unit disk by an…
In this paper, we provide new discrete uniformization theorems for bounded, $m$-connected planar domains. To this end, we consider a planar, bounded, $m$-connected domain $\Omega$ and let $\bord\Omega$ be its boundary. Let $\mathcal{T}$…
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…
We study the limit computability of finding a global optimum of a continuous function. We give a short proof to show that the problem of checking whether a point is a global minimum is not limit computable. Thereby showing the same for the…
We consider the question of computing invariant measures from an abstract point of view. We work in a general framework (computable metric spaces, computable measures and functions) where this problem can be posed precisely. We consider…
We extend a recent result of Avelin, Hed, and Persson about approximation of functions $u$ that are plurisubharmonic on a domain $\Omega$ and continuous on $\bar\Omega$, with functions that are plurisubharmonic on (shrinking) neighborhoods…
In the present paper we sketch the proof of the fact that for any open connected set $\Omega\subset\mathbb{R}^{n+1}$, $n\geq 1$, and any $E\subset \partial \Omega$ with $0<\mathcal{H}^n(E)<\infty$, absolute continuity of the harmonic…
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…
For a bounded domain equipped with a piecewise Lipschitz continuous Riemannian metric g, we consider harmonic map from $(\Omega, g)$ to a compact Riemannian manifold $(N,h)\subset\mathbb R^k$ without boundary. We generalize the notion of…
We show that if $n\geq 1$, $\Omega\subset \mathbb R^{n+1}$ is a connected domain with porous boundary, and $E\subset \partial\Omega$ is a set of finite and positive Hausdorff $H^{n}$-measure upon which the harmonic measure $\omega$ is…
It is well-known that quantitative, scale invariant absolute continuity (more precisely, the weak-$A_\infty$ property) of harmonic measure with respect to surface measure, on the boundary of an open set $ \Omega\subset \mathbb{R}^{n+1}$…
In the present paper we prove that for any open connected set $\Omega\subset\mathbb{R}^{n+1}$, $n\geq 1$, and any $E\subset \partial \Omega$ with $\mathcal{H}^n(E)<\infty$, absolute continuity of the harmonic measure $\omega$ with respect…
It is well known that Cauchy problem for Laplace equations is an ill-posed problem in Hadamard's sense. Small deviations in Cauchy data may lead to large errors in the solutions. It is observed that if a bound is imposed on the solution,…
We discuss computability and computational complexity of conformal mappings and their boundary extensions. As applications, we review the state of the art regarding computability and complexity of Julia sets, their invariant measures and…
While it is well known that finding approximate optima of non-convex functions is computationally intractable, we show that the problem is, in fact, uncomputable in the oracle model. Specifically, we prove that no algorithm with access only…
We assume that $\Omega \subset \mathbb{R}^{d+1}$, $d \geq 2$, is a uniform domain with lower $d$-Ahlfors-David regular and $d$-rectifiable boundary. We show that if $\mathcal{H}^d|_{\partial \Omega}$ is locally finite, then the Hausdorff…