We begin by giving some results of continuity with respect to the domain for the Dirichlet problem (without any assumption of regularity on the domains). Then, following an idea of A. Beurling, a technique of subsolutions and supersolutions for the so-called quadrature surface free boundary problem is presented. This technique would apply to many free boundary problems in$R$$N$,$N$≥2, which have overdetermined Cauchy data on the free boundary. Some applications to concrete examples are also given.

The Mumford–Shah model is one of the most important image segmentation models and has been studied extensively in the last twenty years. In this paper, we propose a two-stage segmentation method based on the Mumford–Shah model. The first stage of our method is to find a smooth solution g to a convex variant of the Mumford–Shah model. Once g is obtained, then in the second stage the segmentation is done by thresholding g into different phases. The thresholds can be given by the users or can be obtained automatically using any clustering methods. Because of the convexity of the model, g can be solved efficiently by techniques like the split-Bregman algorithm or the Chambolle–Pock method. We prove that our method is convergent and that the solution g is always unique. In our method, there is no need to specify the number of segments K (K ≥ 2) before finding g. We can obtain any K-phase segmentations by choosing (K − 1) thresholds after g is found in the first stage, and in the second stage there is no need to recompute g if the thresholds are changed to reveal different segmentation features in the image. Experimental results show that our two-stage method performs better than many standard two-phase or multiphase segmentation methods for very general images, including antimass, tubular, MRI, noisy, and blurry images.

We present a version of a proof by Andy Chermak of the existence and uniqueness of centric linking systems associated with arbitrary saturated fusion systems. This proof differs from the one in [Ch2] in that it is based on the computation of derived functors of certain inverse limits. This leads to a much shorter proof, but one which is aimed mostly at researchers familiar with homological algebra.

We propose a structure-preserving doubling algorithm for a quadratic eigenvalue problem arising from the stability analysis of time-delay systems. We are particularly interested in the eigenvalues on the unit circle, which are difficult to estimate. The convergence and backward error of the algorithm are analyzed and three numerical examples are presented. Our experience shows that our algorithm is efficient in comparison to the few existing approaches for small to medium size problems.

The classification work [5], [8] left unsettled only those anomalous isoparametric hypersurfaces with four principal curvatures and multiplicity pair {4, 5}, {6, 9}, or {7, 8} in the sphere. By systematically exploring the ideal theory in commutative algebra in conjunction with the geometry of isoparametric hypersurfaces, we show that an isoparametric hypersurface with four principal curvatures and multiplicities {4, 5} in S19 is homogeneous, and, moreover, an isoparametric hypersurface with four principal curvatures and multiplicities {6, 9} in S31 is either the inhomogeneous one constructed by Ferus, Karcher, and M¨unzner, or the one that is homogeneous. This classification reveals the striking resemblance between these two rather different types of isoparametric hypersurfaces in the homogeneous category, even though the one with multiplicities {6, 9} is of the type constructed by Ferus, Karcher, and M¨unzner and the one with multiplicities {4, 5} stands alone. The quaternion and the octonion algebras play a fundamental role in their geometric structures. A unifying theme in [5], [8], and the present sequel to them is Serre’s criterion of normal varieties. Its technical side pertinent to our situation that we developed in [5], [8] and extend in this sequel is instrumental. The classification leaves only the case of multiplicity pair {7, 8} open.