No abstract uploaded!

No abstract uploaded!

The existence of solution for the 2D-Keller-Segel system in the subcritical case, i.e. when the initial mass is less than 8π, is reproved. Instead of using the entropy in the free energy and free energy dissipation, which was used in the proofs (Blanchet et al. in SIAM J. Numer. Anal. 46:691–721, 2008; Electron. J. Differ. Equ. Conf. 44:32, 2006 (electronic)), the potential energy term is fully utilized by adapting Delort’s theory on 2D incompressible Euler equation (Delort in J. Am. Math. Soc. 4:553–386, 1991).

In this article, we consider the Lorentz cone complementarity problems in infinite-dimensional real Hilbert space. We establish several results that are standard and important when dealing with complementarity problems. These include proving the same growth of the FishcherBurmeister merit function and the natural residual merit function, investigating property of bounded level sets under mild conditions via different merit functions, and providing global error bounds through the proposed merit functions. Such results are helpful for further designing solution methods for the Lorentz cone complementarity problems in Hilbert space.

Varying coefficient models are a useful extension of classical linear models. They arise naturally when one wishes to examine how regression coefficients change over different groups characterized by certain covariates such as age. The appeal of these models is that the coef. cient functions can easily be estimated via a simple local regression. This yields a simple one-step estimation procedure. We show that such a one-step method cannot be optimal when different coefficient functions admit different degrees of smoothness. This drawback can be repaired by using our proposed two-step estimation procedure. The asymptotic mean-squared error for the two-step procedure is obtained and is shown to achieve the optimal rate of convergence. A few simulation studies show that the gain by the two-step procedure can be quite substantial. The methodology is illustrated by an application to an environmental data set.

We consider the Cauchy problem for the massless scalar wave equation in the Kerr geometry for smooth initial data compactly supported outside the event horizon. We prove that the solutions decay in time in <i>L</i>  _loc. The proof is based on a representation of the solution as an infinite sum over the angular momentum modes, each of which is an integral of the energy variable <i></i> on the real line. This integral representation involves solutions of the radial and angular ODEs which arise in the separation of variables.

In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature dimension inequality C D E(n, K), which can be regarded as a notion of curvature on graphs. Furthermore, we obtain some applications of Li-Yau inequality, including Harnack inequality, heat kernel bounds and Cheng's eigenvalue estimate. These are the first kind of results in this direction for unbounded Laplacian on graphs.

For a one-parameter family (V, {i}pg i=1) of general type hypersurfaces with bases of holomorphic n-forms, we construct open covers V = Spg i=1 Ui using tropical geometry. We show that after normalization, each i is approximately supported on a unique Ui and such a pair approximates a Calabi-Yau hypersurface together with its holomorphic n-form as the parameter becomes large. We also show that the Lagrangian fibers in the fibration constructed by Mikhalkin [9] are asymptotically special Lagrangian. As the holomorphic n-form plays an important role in mirror symmetry for Calabi-Yau manifolds, our results is a step toward understanding mirror symmetry for general type manifolds.

No abstract uploaded!

The polygonal approximation problem is a primary problem in computer graphics, pattern recognition, CAD/CAM, etc. In $R^2$, the cone intersection method (CIM) is one of the most eÆcient algorithms for approximating polygonal curves. With CIM Eu and Toussaint, by imposing an additional constraint and changing the given error criteria, resolve the three-dimensional weighted minimum number polygonal approximation problem with the parallel-strip error criterion (PS-WMN) under $L_2$ norm. In this paper, without any additional constraint and change of the error criteria, a CIM solution to the same problem with the line segment error criterion (LS-WMN) is presented, which is more frequently encountered than the PS-WMN is. Its time complexity is $O(n^3)$, and the space complexity is $O(n^2)$. An approximation algorithm is also presented, which takes $O(n^2)$ time and $O(n)$ space. Results of some examples are given to illustrate the eÆciency of these algorithms.