This paper studies stability of the Ekman boundary layer. We utilize a new approach, developed by the authors in a precedent paper, based on Fourier transformed finite vector Radon measures, which yields exponential stability of the Ekman spiral. By this method we can also derive very explicit bounds for solutions of the linearized and the nonlinear Ekman systems. For example, we can prove these bounds to be uniform with respect to the angular velocity of rotation, which has proved to be relevant for several aspects. Another advantage of this approach is that we obtain well-posedness in classes containing nondecaying vector fields such as almost periodic functions. These outcomes give respect to the nature of boundary layer problems and cannot be obtained by approaches in standard function spaces such as Lebesgue, Bessel-potential, Hölder or Besov spaces.

It is proved that the classical Laplace transform is a continuous valuation which is positively GL(n) covariant and logarithmic translation covariant. Conversely, these properties turn out to be sucient to characterize this transform.

No abstract uploaded!

Yuan’s theorem of the alternative is an important theoretical tool in optimization, which provides a checkable certificate for the infeasibility of a strict inequality system involving two homogeneous quadratic functions. In this paper, we provide a tractable extension of Yuan’s theorem of the alternative to the symmetric tensor setting. As an application, we establish that the optimal value of a class of nonconvex polynomial optimization problems with suitable sign structure (or more explicitly, with essentially nonpositive coefficients) can be computed by a related convex conic programming problem, and the optimal solution of these nonconvex polynomial optimization problems can be recovered from the corresponding solution of the convex conic programming problem. Moreover, we obtain that this class of nonconvex polynomial optimization problems enjoy exact sum-of-squares relaxation, and so, can be solved via a single semidefinite programming problem.

For any dynamical system T : X → X of a compact metric space X with g-almost product property and uniform separation property, under the assumptions that the periodic points are dense in X and the periodic measures are dense in the space of invariant measures, we distinguish various periodiclike recurrences and find that they all carry full topological entropy and so do their gap-sets. In particular, this implies that any two kind of periodic-like recurrences are essentially different. Moreover, we coordinate periodic-like recurrences with (ir)regularity and obtain lots of generalized multifractal analyses for all continuous observable functions. These results are suitable for all β-shifts (β > 1), topological mixing subshifts of finite type, topological mixing expanding maps or topological mixing hyperbolic diffeomorphisms, etc. Roughly speaking, we combine many different “eyes” (i.e., observable functions and periodic-like recurrences) to observe the dynamical complexity and obtain a Refined Dynamical Structure for Recurrence Theory and Multi-fractal Analysis.