A sharp result on global small solutions to the Cauchy problem $$u_t = \Delta u + f\left( {u,Du,D^2 u,u_t } \right)\left( {t > 0} \right),u\left( 0 \right) = u_0 $$

In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of the boundary is given either as a list of pixels, or by a Turing machine.

In this paper, we develop and analyze the Runge-Kutta discontinuous Galerkin (RKDG) method to solve weakly coupled hyperbolic multi-domain problems. Such problems involve transfer type boundary conditions with discontinuous fluxes between different domains, calling for special techniques to prove stability of the RKDG methods. We prove both stability and error estimates for our RKDG methods on simple models, and then apply them to a biological cell proliferation model \cite{EMSC}. Numerical results are provided to illustrate the good behavior of our RKDG methods.

No abstract uploaded!

We show that sparse and Carleson coefficients are equivalent for every countable collection of Borel sets and hence, in particular, for dyadic rectangles, the case relevant to the theory of bi-parameter singular integrals. The key observation is that a dual refomulation by I. E. Verbitsky for Carleson coefficients over dyadic cubes holds also for Carleson coefficients over general sets.