Mappings of Domains in Rn and Their Metric Tensors

We consider quasi-isometric mappings of domains in multidimensional Euclidean spaces. We establish that a mapping depends continuously in the sense of the topology of Sobolev classes on its metric tensor to within isometry of the space. In the space of metric tensors we take the topology determined by means of almost everywhere convergence. We show that if the metric tensor of a mapping is continuous then the length of the image of a rectifiable curve is determined by the same formula as in the case of mappings with continuous derivatives. (Continuity of the metric tensor of a mapping does not imply continuity of its derivatives.)     

A minimization method for the sum of a convex function and a continuously differentiable function

This paper presents a method for finding the minimum for a class of nonconvex and nondifferentiable functions consisting of the sum of a convex function and a continuously differentiable function. The algorithm is a descent method which generates successive search directions by solving successive convex subproblems. The algorithm is shown to converge to a critical point.The authors wish to express their appreciation to the referees for their careful review and helpful comments.     

Properties of the density for a three-dimensional stochastic wave equation

We consider a stochastic wave equation in space dimension three driven by a noise white in time and with an absolutely continuous correlation measure given by the product of a smooth function and a Riesz kernel. Let pt,x(y) be the density of the law of the solution u(t,x) of such an equation at points (t,x)∈]0,T]×R³. We prove that the mapping (t,x)?pt,x(y) owns the same regularity as the sample paths of the process {u(t,x),(t,x)∈]0,T]×R³} established in [R.C. Dalang, M. Sanz-Solé, Hölder-Sobolev regularity of the solution to the stochastic wave equation in dimension three, Mem. Amer. Math. Soc., in press]. The proof relies on Malliavin calculus and more explicitly, the integration by parts formula of [S. Watanabe, Lectures on Stochastic Differential Equations and Malliavin Calculus, Tata Inst. Fund. Res./Springer-Verlag, Bombay, 1984] and estimates derived from it.     

On Metric and Calmness Qualification Conditions in Subdifferential Calculus

The paper contains two groups of results. The first are criteria for calmness/subregularity for set-valued mappings between finite-dimensional spaces. We give a new sufficient condition whose subregularity part has the same form as the coderivative criterion for “full” metric regularity but involves a different type of coderivative which is introduced in the paper. We also show that the condition is necessary for mappings with convex graphs. The second group of results deals with the basic calculus rules of nonsmooth subdifferential calculus. For each of the rules we state two qualification conditions: one in terms of calmness/subregularity of certain set-valued mappings and the other as a metric estimate (not necessarily directly associated with aforementioned calmness/subregularity property). The conditions are shown to be weaker than the standard Mordukhovich–Rockafellar subdifferential qualification condition; in particular they cover the cases of convex polyhedral set-valued mappings and, more generally, mappings with semi-linear graphs. Relative strength of the conditions is thoroughly analyzed. We also show, for each of the calculus rules, that the standard qualification conditions are equivalent to “full” metric regularity of precisely the same mappings that are involved in the subregularity version of our calmness/subregularity condition. The research of Jiří V. Outrata was supported by the grant A 107 5402 of the Grant Agency of the Academy of Sciences of the Czech Republic.     

Homogenization of periodic linear degenerate PDEs

It is well known under the name of ‘periodic homogenization’ that, under a centering condition of the drift, a periodic diffusion process on Rd converges, under diffusive rescaling, to a d-dimensional Brownian motion. Existing proofs of this result all rely on uniform ellipticity or hypoellipticity assumptions on the diffusion. In this paper, we considerably weaken these assumptions in order to allow for the diffusion coefficient to even vanish on an open set. As a consequence, it is no longer the case that the effective diffusivity matrix is necessarily non-degenerate. It turns out that, provided that some very weak regularity conditions are met, the range of the effective diffusivity matrix can be read off the shape of the support of the invariant measure for the periodic diffusion. In particular, this gives some easily verifiable conditions for the effective diffusivity matrix to be of full rank. We also discuss the application of our results to the homogenization of a class of elliptic and parabolic PDEs.     

On some nonlinear problems induced by an abstract maximal element principle

In this paper, by applying an abstract maximal element principle on quasi-ordered sets established by Lin and Du, we obtain a generalized Brézis–Browder principle, system (vectorial) versions of Ekeland's variational principle and maximal element principle and a vectorial version of Takahashi's nonconvex minimization theorem. Moreover, we investigate the equivalence between scalar versions and vectorial versions of these results.     

A coding method for a sequent calculus of propositional logic

The paper deals with a coding method for a sequent calculus of the propositional logic. The method is based on the sequent calculus. It allows us to determine if a formula is derivable in the calculus without constructing a derivation tree. The main advantage of the coding method is its compactness in comparison with derivation trees of the sequent calculus. The coding method can be used as a decision procedure for the propositional logic.     

PSPACE complexity of modal logic <Emphasis Type="Italic">K D</Emphasis>45<Subscript>n</Subscript>

We study sequent calculus for multi-modal logic K D45_n and its complexity. We introduce a loop-check free sequent calculus. Loop-check is eliminated by using the marked modal operator □_i^•, which is used as an alternative to sequents with histories ([8], [3], [5]). All inference rules are invertible or semi-invertible. To get this, we use or branches beside common and branches. We prove the equivalence between known sequent calculus and our newly introduced efficient sequent calculus. We concentrate on the complexity analysis of the introduced sequent calculus for multi-modal logic K D45_n. We prove that the space complexity of the given calculus is polynomial (O(l ³)). We show the maximum height of the constructed derivation tree that leads to the reduction of the time and space complexity. We present a decision algorithm for multi-modal logic K D45_n and some nontrivial examples to improve the introduced loop-check free sequent calculus.     

Equality of multiplicity free skew characters

In this paper we show that two skew diagrams λ/μ and α/β can represent the same multiplicity free skew character [λ/μ]=[α/β] only in the the trivial cases when λ/μ and α/β are the same up to translation or rotation or if λ=α is a staircase partition λ=(l,l−1,…,2,1) and λ/μ and α/β are conjugate of each other.