Entire solutions of semilinear elliptic equations in and a conjecture of De Giorgi

In 1978 De Giorgi formulated the following conjecture. Let be a solution of in all of such that and 0$"> in . Is it true that all level sets of are hyperplanes, at least if ? Equivalently, does depend only on one variable? When , this conjecture was proved in 1997 by N. Ghoussoub and C. Gui. In the present paper we prove it for . The question, however, remains open for . The results for and 3 apply also to the equation for a large class of nonlinearities .

     

单峰偏好下马斯金单调性与联盟防策略的等价性

本文证明了在单峰偏好域上Maskin单调性与防策略条件是等价的,并进一步证明了Maskin单调性与联盟防策略是等价的.从而推广了Muller-Satterthwaite(1977)在无限制强序域上得到的结论.在此基础上,利用Mollin(1980)在单峰偏好域上提出的防策略社会选择函数特征化定理,证明了在单峰偏好域上能够突破Muller-Satterthwaite不可能性定理所预示的消极结论.     

Prevalent Behavior of Strongly Order Preserving Semiflows

Classical results in the theory of monotone semiflows give sufficient conditions for the generic solution to converge toward an equilibrium or toward the set of equilibria (quasiconvergence). In this paper, we provide new formulations of these results in terms of the measure-theoretic notion of prevalence, developed in Christensen (Israel J. Math., 13, 255–260, 1972) and Hunt et al. (Bull. Am. Math. Soc., 27, 217–238, 1992). For monotone reaction–diffusion systems with Neumann boundary conditions on convex domains, we show the prevalence of the set of continuous initial conditions corresponding to solutions that converge to a spatially homogeneous equilibrium. We also extend a previous generic convergence result to allow its use on Sobolev spaces. Careful attention is given to the measurability of the various sets involved.     

Completeness properties of the pseudocompact-open topology on <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">X</Emphasis>)

This is a study of the completeness properties of the space C _ps (X) of continuous real-valued functions on a Tychonoff space X, where the function space has the pseudocompact-open topology. The properties range from complete metrizability to the Baire space property. Dedicated to Professor Robert A. McCoy     

Monotonicity and best approximation in Orlicz-Sobolev spaces with the Luxemburg norm

Criteria for strict monotonicity, upper (lower) locally uniform monotonicity and uniform monotonicity of Orlicz-Sobolev spaces with the Luxemburg norm are given. Some applications to best approximation are presented.     

Alternatingly Hyperexpansive Operator Tuples

The notion of an alternatingly hyperexpansive operator on a Hilbert space is generalized to that of an alternatingly hyperexpansive operator tuple, which necessitates exploring the theory of absolutely monotone functions as defined on the m-fold product N ^m of the semi-group N of non-negative integers and as defined on semi-open cubes in the m-dimensional real Euclidean space R ^m. The multi-variable Laplace transform and the Stieltjes Moment Problem make a natural appearance in the development of the relevant theory, which also highlights the close connections of alternatingly hyperexpansive operator tuples with completely hyperexpansive and subnormal ones. In particular, if T is subnormal and the joint (Taylor) spectrum of its minimal normal extension is contained in a certain subset of the Hermitian space C ^m, then T turns out to be alternatingly hyperexpansive. In the context of multi-variable weighted shifts, the last assertion can be related to the notion of a Stieltjes Moment Net. The general characterization of an alternatingly hyperexpansive m-variable weighted shift T, however, requires a certain net of (positive) numbers associated with T to be absolutely monotone on N ^m and allows for such a T to be non-subnormal.     

ON L^P-MATRICIALLY NORMED SPACES

1Introduction and PreliminariesThroughout this paper,we consider linear spaces over the complex numbers C.Given alinear space X and integers m and n,let Mm,n(X)=X?Mm,n denote the linear space ofm×n matricesx=?????x.x..m1,1,1.x..xm1,n,n?????with entries x…     

Dual characterization of properties of risk measures on Orlicz hearts

We extend earlier representation results for monetary risk measures on Orlicz hearts. Then we give general conditions for such risk measures to be Gateaux-differentiable, strictly monotone with respect to almost sure inequality, strictly convex modulo translation, strictly convex modulo comonotonicity, or monotone with respect to different stochastic orders. The theoretical results are used to analyze various specific examples of risk measures. We thank Andreas Hamel and Michael Kupper for fruitful discussions and helpful comments. P. Cheridito has been supported by NSF Grant DMS-0642361, a Rheinstein Award and a Peek Fellowship. T. Li has been supported by a Marshall Scholarship and a Merage Fellowship.     

On Representations Associated with Completely n-Positive Linear Maps on Pro-C^＊-Algebras

It is shown that an n × n matrix of continuous linear maps from a pro-C^＊-algebra A to L（H）, which verifies the condition of complete positivity, is of the form [V^＊TijФ（·）V]^n i,where Ф is a representation of A on a Hilbert space K, V is a bounded linear operator from H to K, and j=1,[Tij]^n i,j=1 is a positive element in the C^＊-algebra of all n×n matrices over the commutant of Ф（A） in L（K）. This generalizes a result of C. Y.Suen in Proc. Amer. Math. Soc., 112（3）, 1991, 709-712. Also, a covariant version of this construction is given.     

Testing monotonicity over graph products

We consider the problem of monotonicity testing over graph products. Monotonicity testing is one of the central problems studied in the field of property testing. We present a testing approach that enables us to use known monotonicity testers for given graphs G₁, G₂, to test monotonicity over their product G₁ × G₂. Such an approach of reducing monotonicity testing over a graph product to monotonicity testing over the original graphs, has been previously used in the special case of monotonicity testing over [n]^d for a limited type of testers; in this article, we show that this approach can be applied to allow modular design of testers in many interesting cases: this approach works whenever the functions are boolean, and also in certain cases for functions with a general range. We demonstrate the usefulness of our results by showing how a careful use of this approach improves the query complexity of known testers. Specifically, based on our results, we provide a new analysis for the known tester for [n]^d which significantly improves its query complexity analysis in the low‐dimensional case. For example, when d = O(1), we reduce the best known query complexity from O(log ²n/ε) to O(log n/ε). © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008