Related papers: The corona problem with two pieces of data

We study the $H^{\infty}(\mathbb{B}_{n})$ Corona problem $\sum_{j=1}^{N}f_{j}g_{j}=h$ and show it is always possible to find solutions $f$ that belong to $BMOA(\mathbb{B}_{n})$ for any $n>1$, including infinitely many generators $N$. This…

The very weak solution of the Poisson equation with $L^2$ boundary data is defined by the method of transposition. The finite element solution with regularized boundary data converges with order $1/2$ in convex domains but has a reduced…

Let $D\subset\Co$ be a bounded domain, whose boundary $B$ consists of $k$ simple closed continuous curves and $H^{\infty}(D)$ be the algebra of bounded analytic functions on $D$. We prove the matrix-valued corona theorem for matrices with…

This paper utilizes Cauchy's transform and duality for the Dirichlet-type space $D(\mu)$ with positive superharmonic weight $U_\mu$ on the unit disk $\mathbb{D}$ to establish the corona theorem for the Dirichlet-type multiplier algebra…

By modifying Cole's example, we construct explicit Riemann surfaces with large bounds on corona solutions in an elementary way.

For a domain bounded by homogeneous subsets of a Lipschitz graph, we show the Corona Theorem is affirmative.

Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving…

This paper is about the moment problem on a finite-dimensional vector space of continuous functions. We investigate the structure of the convex cone of moment functionals (supporting hyperplanes, exposed faces, inner points) and treat…

In this paper, we give some estimates of the sum of the square norm of the sections of the pluricanonical bundles over a Riemann surface with genus greater than 2 and Gauss curvature (-1). Using these estimate, we give a uniform estimate of…

Necessary and sufficient conditions of uniform consistency are explored. A hypothesis is simple. Nonparametric sets of alternatives are bounded convex sets in $\mathbb{L}_p$, $p >1$ with "small" balls deleted. The "small" balls have the…

The problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral. We characterize the existence of global optimal solutions of…

We analyse the data for the global corona virus (COVID-19) outbreak using the results of a previously studied Susceptible-Infected-Removed (SIR) model of epidemic spreading on Euclidean networks. We also directly study the correlation of…

We treat the boundary problem for complex varieties (with isolated singularities) of dimension greater than one, which are contained in a suitable class of strictly pseudoconvex, unbounded domains of C^n.

We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors…

We study two special cases of the planar least gradient problem. In the first one, the boundary conditions are imposed on a part of the strictly convex domain. In the second case, we impose the Dirichlet data on the boundary of a rectangle,…

The Gauss image problem for convex bodies asks for the existence of a convex body that "links" two given measures on the unit sphere in a certain way. We treat here a corresponding question for pseudo-cones, that is, for unbounded closed…

Coronae exist in most astrophysical objects: stars, accretion disks, and individual galaxies and clusters of galaxies. Coronae in these varied systems have some common properties: 1) hydrostatic equilibrium in background gravity is a good…

We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an $O(n\log n)$-time algorithm for the two-center…

Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for computing a 2-center of P. The first algorithm runs in O(n^3 log^5…

We introduce a new invariant, the coronal of a graph, and use it to compute the spectrum of the corona $G\circ H$ of two graphs $G$ and $H$. In particular, we show that this spectrum is completely determined by the spectra of $G$ and $H$…