New lower semicontinuity results for polyconvex integrals

Summary We study integral functionals of the formF(u, )= f(u)dx, defined foru C¹(;R ^k), R ⁿ . The functionf is assumed to be polyconvex and to satisfy the inequalityf(A) c₀¦(A)¦ for a suitable constant c₀ > 0, where (A) is then-vector whose components are the determinants of all minors of thek×n matrixA. We prove thatF is lower semicontinuous onC ¹(;R ^k) with respect to the strong topology ofL ¹(;R ^k). Then we consider the relaxed functional , defined as the greatest lower semicontinuous functional onL ¹(;R ^k ) which is less than or equal toF on C¹(;R ^k). For everyu BV(;R ^k) we prove that (u,) f(u)dx+c₀¦D^su¦(), whereDu=u dx+D^su is the Lebesgue decomposition of the Radon measureDu. Moreover, under suitable growth conditions onf, we show that (u,)= f(u)dx for everyu W^1,p(;R ^k), withp min{n,k}. We prove also that the functional (u, ) can not be represented by an inte- gral for an arbitrary functionu BV_loc(R ⁿ;R ^k). In fact, two examples show that, in general, the set function (u, ) is not subadditive whenu BV_loc(R ⁿ;R ^k), even ifu W _loc ^1,p (R ⁿ;R ^k) for everyp < min{n,k}. Finally, we examine in detail the properties of the functionsu BV(;R ^k) such that (u, )= f(u)dx, particularly in the model casef(A)=¦(A)¦.     

A Residue Calculus for Root Systems

Let V be a finite-dimensional real vector space on which a root system is given. Consider a meromorphic function on V =V+iV, the singular locus of which is a locally finite union of hyperplanes of the form V , = s, , s . Assume is of suitable decay in the imaginary directions, so that integrals of the form _+iV , d make sense for generic V. A residue calculus is developed that allows shifting . This residue calculus can be used to obtain Plancherel and Paley–Wiener theorems on semisimple symmetric spaces.     

Some best possible bounds concerning the traces of finite sets II

LetX be ann-element set and be a family of its subsets. Consider the family _x = {F – {x} : F } for a givenx X. We write(m, n) (m – k, n – 1), when for all with || m, there exists an elementx ofX such that| _x| m – k. We show that (m, n) (m – 10,n – 1) for allm 5n and (m, n) (m – 13,n – 1) for allm 29n/5.     

An evolution problem for plastic antiplanar shear

We study the parabolic problemu/t=div_{x p}() in the function space L²(0, T; BV()). Here is the linear growth functional arising from the study of plastic antiplanar shear deformations.     

On the Cesàro summability of orthogonal sequences

(C, ). , . 0<<1. 1) - ( _k ), _k =a _k , (C, ), . 2) , , (C, ) ; _k = =¦a _k ¦.     

Round-off error analysis of iterations for large linear systems

Summary We deal with the rounding error analysis of successive approximation iterations for the solution of large linear systemsA _x =b. We prove that Jacobi, Richardson, Gauss-Seidel and SOR iterations arenumerically stable wheneverA=A ^*>0 andA has PropertyA. This means that the computed resultx _k approximates the exact solution with relative error of order A·A ^–1 where is the relative computer precision. However with the exception of Gauss-Seidel iteration the residual vector Ax _k –b is of order A² A ^–1 and hence the remaining three iterations arenot well-behaved.This work was partly done during the author's visit at Carnegie-Mellon University and it was supported in part by the Office of Naval Research under Contract N00014-76-C-0370; NR 044-422 and by the National Science Foundation under Grant MCS75-222-55     

On extremal perturbations of semi-Fredholm operators

Given a bounded linear operatorA in an infinite dimensional Banach space and a compact subset of a connected component of its semi-Fredholm domain, we construct a finite rank operatorF such that –A+F is bounded below (or surjective) for each ,F ²=0 and rankF=max min{dimN(–A), codimR(–A)}, if ind(–A)0 (or ind(–A)0, respectively) for each .     

Additive functions

1<q<2 L:= _n=1 1/q ⁿ=1/q–1. [0,1] _n()=1, A _n:= _i=1 ^n–1 _i(x)/q^i+1/n x _n(x)=0, _n>. , = _{n=1 n}(x)/qⁿ. F: [0,L]R , F(x)= _{n=1 n}(x)a_n, _n=1 ¦a _n¦<. [0,L]. q(1,2), . , q(1, 2), . .     

Ergodic properties of Poisson processes with almost periodic intensity

Summary We discuss in this paper a non-homogeneous Poisson process A driven by an almost periodic intensity function. We give the stationary version A ^* and the Palm version A ⁰ corresponding to A ^*. Let (T _i ,i) be the inter-point distance sequence in A and (T _i ⁰ ,i) in A ⁰. We prove that forj, the sequence (T _i+j,i) converges in distribution to (T _i ⁰ ,i). If the intensity function is periodic then the convergence is in variation.     

Approximation of a nondifferentiable nonlinear problem related to MHD equilibria

Summary We present a simple method, based on a variant of the implicit function theorem, which leads to the existence of (a part of) a nontrivial solution branch of the nonlinear eigenvalue problem –u=u ⁺ in ,u=–1 on , where is a two-dimensional domain with boundary . The advantage of this method is that we can apply it for analysing the approximation of the above problem by a finite element method; the error analysis of the discrete problem appears immediately. We give also an iteration scheme which allows to solve the approximate problem.     

1-Homogeneous Graphs with Cocktail Party μ-Graphs

Let be a graph with diameter d 2. Recall is 1-homogeneous (in the sense of Nomura) whenever for every edge xy of the distance partition{{z V() | (z, y) = i, (x, z) = j} | 0 i, j d}is equitable and its parameters do not depend on the edge xy. Let be 1-homogeneous. Then is distance-regular and also locally strongly regular with parameters (v,k,,), where v = k, k = a ₁, (v – k – 1) = k(k – 1 – ) and c ₂ + 1, since a -graph is a regular graph with valency . If c ₂ = + 1 and c ₂ 1, then is a Terwilliger graph, i.e., all the -graphs of are complete. In [11] we classified the Terwilliger 1-homogeneous graphs with c ₂ 2 and obtained that there are only three such examples. In this article we consider the case c ₂ = + 2 3, i.e., the case when the -graphs of are the Cocktail Party graphs, and obtain that either = 0, = 2 or is one of the following graphs: (i) a Johnson graph J(2m, m) with m 2, (ii) a folded Johnson graph J¯(4m, 2m) with m 3, (iii) a halved m-cube with m 4, (iv) a folded halved (2m)-cube with m 5, (v) a Cocktail Party graph K _{m × 2} with m 3, (vi) the Schläfli graph, (vii) the Gosset graph.     

The Spectral Theory of Amenable Actions and Invariants of Discrete Groups

Let G denote a semisimple group, a discrete subgroup, B=G/P the Poisson boundary. Regarding invariants of discrete subgroups we prove, in particular, the following:(1) For any -quasi-invariant measure on B, and any probablity measure on , the norm of the operator () on L ²(B,) is equal to (), where is the unitary representation in L ²(X,), and is the regular representation of .(2) In particular this estimate holds when is Lebesgue measure on B, a Patterson–Sullivan measure, or a -stationary measure, and implies explicit lower bounds for the displacement and Margulis number of (w.r.t. a finite generating set), the dimension of the conformal density, the -entropy of the measure, and Lyapunov exponents of .(3) In particular, when G=PSL₂() and is free, the new lower bound of the displacement is somewhat smaller than the Culler–Shalen bound (which requires an additional assumption) and is greater than the standard ball-packing bound.We also prove that ()=_G() for any amenable action of G and L ¹(G), and conversely, give a spectral criterion for amenability of an action of G under certain natural dynamical conditions. In addition, we establish a uniform lower bound for the -entropy of any measure quasi-invariant under the action of a group with property T, and use this fact to construct an interesting class of actions of such groups, related to 'virtual' maximal parabolic subgroups. Most of the results hold in fact in greater generality, and apply for instance when G is any semi-simple algebraic group, or when is any word-hyperbolic group, acting on their Poisson boundary, for example.     

Small potential corrections for the discrete eigenvalues of the Sturm-Liouville problem

Summary The inverse Sturm-Liouville problem is the problem of finding a good approximation of a potential functionq such that the eigenvalue problem (^*)–y +qy=y holds on (0, ) fory(0)=y()=0 and a set of given eigenvalues . Since this problem has to be solved numerically by discretization and since the higher discrete eigenvalues strongly deviate from the corresponding Sturm-Liouville eigenvalues , asymptotic corrections for the 's serve to get better estimates forq. Let _k (1kn) be the first eigenvalues of (^*), let _k be the corresponding discrete eigenvalues obtained by the finite element method for (^*) and let _{k k} for the special caseq=0. Then, starting from an asymptotic correction technique proposed by Paine, de Hoog and Anderssen, new estimates for the errors of the corrected discrete eigenvalues are obtained and confirm and improve the knownO(kh ²)(h:=/(n+1)) behaviour. The estimates are based on new Sobolev inequalities and on Fourier analysis and it is shown that for 4+c ₂ k(n+1)/2, wherec ₁ andc ₂ are constants depending onq which tend to 0 for vanishingq.     

L 2(R n )-extremal problems on the basis of incomplete information

. ( ), R ⁿ L ₂(R ²).

---

---

The author is supported by the National Natural Science Found of China.     

Threshold theorems for a stochastic model of an epidemic with natural immunization

A stochastic model of an epidemic is investigated, taking account of the removal of ill members of the population (by death, by recovery with immunization, by isolation) and natural immunization. Limiting distributions are found for the size of the epidemic, the number immunized ₁, and their sum, under the assumption that the original number of susceptible individuals n and the number of ill individuals m , while n 1,n ₀< , where and are the coefficients for the contraction of the disease and of immunization respectively.Translated from Matematicheskie Zametki, Vol. 8, No. 3, pp. 385–392, September, 1970.     

Analytic Center Cutting-Plane Method with Deep Cuts for Semidefinite Feasibility Problems

An analytic center cutting-plane method with deep cuts for semidefinite feasibility problems is presented. Our objective in these problems is to find a point in a nonempty bounded convex set in the cone of symmetric positive-semidefinite matrices. The cutting plane method achieves this by the following iterative scheme. At each iteration, a query point that is an approximate analytic center of the current working set is chosen. We assume that there exists an oracle which either confirms that or returns a cut A S ^m {YS ^m : AY AY - } , where 0. If , an approximate analytic center of the new working set, defined by adding the new cut to the preceding working set, is then computed via a primal Newton procedure. Assuming that contains a ball with radius > 0, the algorithm obtains eventually a point in , with a worst-case complexity of O ^*(m ³/²) on the total number of cuts generated.     

On equivalence of rearrangements of the Haar system in dyadic Hardy and BMO spaces

H={h ₁,I } — , . : , I ¦(I)¦=¦I¦, ¦I¦ — I. H H ={h _(I),I} . , , . L ^p .

---

---

Dedicated to Professor B. Szökefalvi-Nagy on his 75th birthday

---

This research was supported in part by MTA-NSF Grants INT-8400708 and 8620153.     

Stability of a spline collocation method for strongly elliptic multidimensional singular integral equations

Summary We consider a spline collocation method for strongly elliptic zero order pseudodifferential equationsp _gw Au=f on a cube =(0, 1) ^m . Utilizing multilinear spline functions which are zero at the boundary we collocate at the meshpoints inside . For classical strongly elliptic translation invariant pseudodifferential operators, we verify the stability of the considered collocation method inL ²(). Afterwards, form2 and a right hand sidefH ⁸(),s>m/2, we prove an asymptotic convergence estimate.The author has been supported by a grant of Deutsche Forschungsgemeinschaft under grant number Ko 634/32-1     

Limiting behavior of weighted central paths in linear programming

We study the limiting behavior of the weighted central paths{(x(), s())} > 0 in linear programming at both = 0 and = . We establish the existence of a partition (B ,N ) of the index set { 1, ,n } such thatx _i() ands _j () as fori B , andj N , andx _N (),s _B () converge to weighted analytic centers of certain polytopes. For allk 1, we show that thekth order derivativesx ^(k) () ands ^(k) () converge when 0 and . Consequently, the derivatives of each order are bounded in the interval (0, ). We calculate the limiting derivatives explicitly, and establish the surprising result that all higher order derivatives (k 2) converge to zero when .     

Direct and inverse spectral problems for generalized strings

Let the functionQ be holomorphic in he upper half plane ⁺ and such that ImQ(z 0 and ImzQ(z) 0 ifz ⁺. A basic result of M.G. Krein states that these functionsQ are the principal Titchmarsh-Weyl coefficiens of a (regular or singular) stringS[L,m] with a (non-decreasing) mass distribution functionm on some interval [0,L) with a free left endpoint 0. This string corresponds to the eigenvalue problemdf + fdm = 0; f(0–) = 0. In this note we show that the set of functionsQ which are holomorphic in ⁺ and such that the kernel has negative squares of ⁺ and ImzQ(z) 0 ifz ⁺ is the principal Titchmarsh-Weyl coefficient of a generalized string, which is described by the eigenvalue problemdf +f dm + ² fdD = 0 on [0,L),f(0–) = 0. Here is the number of pointsx whereD increases or 0 >m(x + 0) –m(x – 0) –; outside of these pointsx the functionm is locally non-decreasing and the functionD is constant.To the memory of M.G. Krein with deep gratitude and affection.This author is supported by the Fonds zur Förderung der wissenschaftlichen Forschung of Austria, Project P 09832