The Jacobian and the Ginzburg-Landau energy

We study the Ginzburg-Landau functional for , where U is a bounded, open subset of . We show that if a sequence of functions satisfies , then their Jacobians are precompact in the dual of for every . Moreover, any limiting measure is a sum of point masses. We also characterize the -limit of the functionals , in terms of the function space B2V introduced by the authors in [16,17]: we show that I(u) is finite if and only if , and for is equal to the total variation of the Jacobian measure Ju. When the domain U has dimension greater than two, we prove if then the Jacobians are again precompact in for all , and moreover we show that any limiting measure must be integer multiplicity rectifiable. We also show that the total variation of the Jacobian measure is a lower bound for the limit of the Ginzburg-Landau functional. Received: 15 December 2000 / Accepted: 23 January 2001 / Published online: 25 June 2001     

激光调Q CAI

从激光调Q速率方程出发,分析推导了激光调Q过程中,腔内光子数与工作物质内反转粒子数间的关系.再根据激光调Q的过程中,对腔Q值控制方式不同,将激光调Q技术分为:转镜调Q、声光调Q、电光调Q、饱和吸收调Q和脉冲透射式调Q.用C语言进行了激光调Q CAI软件的开发研制,获得了将文学、图形、动画和计算融为一体的,直观而生动地将调Q的理论和过程再现于屏幕的CAI课件.介绍了课件的内容、结构及其特点.     

Intertwining differential operators and reducibility of generalized Verma modules

Supported in part by NSF Grant DMS-8610730     

Optimal convex hull algorithms on enhanced meshes

In this paper we propose time-optimal convex hull algorithms for two classes of enhanced meshes. Our first algorithm computes the convex hull of an arbitrary set ofn points in the plane inO (logn) time on a mesh with multiple broadcasting of sizen×n. The second algorithm shows that the same problem can be solved inO (1) time on a reconfigurable mesh of sizen×n. Both algorithms achieve time lower bounds for their respective model of computation.This work was supported by NASA under grant NCCI-99.Additional support by the National Science Foundation under grant CCR-8909996 is gratefully acknowledged.     

Parabolic equations of Von Karman type on Kähler manifolds

We study a parabolic version of a system of Von Karman type on a compact Kähler manifold of arbitrary dimension. We provide local in time regular solutions, which can be extended to global bounded ones if the data of the problem are small.     

Countably compact topological group topologies on free Abelian groups from selective ultrafilters

Tkachenko showed in 1990 the existence of a countably compact group topology on the free Abelian group of size c using CH. Koszmider, Tomita and Watson showed in 2000 the existence of a countably compact group topology on the free Abelian group of size c² using a forcing model in which CH holds.Wallace's question from 1955, asks whether every both-sided cancellative countably compact semigroup is a topological group. A counterexample to Wallace's question has been called a Wallace semigroup. In 1996, Robbie and Svetlichny constructed a Wallace semigroup under CH. In the same year, Tomita constructed a Wallace semigroup from MAcountable.In this note, we show that the examples of Tkachenko, Robbie and Svetlichny, and Koszmider, Tomita and Watson can be obtained using a family of selective ultrafilters. As a corollary, the constructions presented here are compatible with the total failure of Martin's Axiom.     

Microstructural evolution of decagonal quasicrystal in the undercooled Al72Ni12Co16 alloy melts

The microstructure evolution of decagonal quasicrystals in Al₇₂Ni₁₂Co₁₆ alloy was investigated by the electromagnetic melting and cyclic superheating method. Single-phase decagonal quasicrystals have been obtained when the undercoolings were larger than 60 K. The decagonal quasicrystals formed at various undercoolings show different microstructural morphologies. Furthermore, grain refinement was found near the undercooling of 120 K. Based on current thermodynamic and dendrite growth theories, a dimensionless superheating parameter was adopted to explain the effect of processing conditions on the microstructure of Al₇₂Ni₁₂Co₁₆ alloy. The result indicate that the fine equiaxied microstructure of decagonal quasicrystal (D-phase) formed near on undercooling of 120 K originates from the break-up of dendrites.     

Predicting automobile claims bodily injury severity with sequential ordered logit models

Despite the large cost of bodily injury (BI) claims in motor insurance, relatively little research has been done in this area. Many companies estimate (and therefore reserve) bodily injury compensation directly from initial medical reports. This practice may underestimate the final cost, because the severity is often assessed during the recovery period. Since the evaluation of this severity is often only qualitative, in this paper we apply an ordered multiple choice model at different moments in the life of a claim reported to an insurance company. We assume that the information available to the insurer does not flow continuously, because it is obtained at different stages. Using a real data set, we show that the application of sequential ordered logit models leads to a significant improvement in the prediction of the BI severity level, compared to the subjective classification that is used in practice. We also show that these results could improve the insurer’s reserves notably.     

Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.