A structure theorem for sum form functional equations

Summary It is proved that, iff _ij:]0, 1[ C (i = 1, ,k;j = 1, ,l) are measurable, satisfy the equation (1) (with some functionsg _it, h_jt:]0, 1[ C), then eachf _ij is in a linear space (called Euler space) spanned by the functionsx x ^j(logx) ^k (x ]0, 1[;j = 1, ,M;k = 0, ,m _j – 1), where ₁, , _M are distinct complex numbers andm ₁, , m_M natural numbers. The dimension of this linear space is bounded by a linear function ofN.     

Multiplicity of positive solutions of a nonlinear Schrödinger equation

We consider the multiple existence of positive solutions of the following nonlinear Schrödinger equation: where if N3 and p(1, ) if N=1,2, and a(x), b(x) are continuous functions. We assume that a(x) is nonnegative and has a potential well := int a^–1(0) consisting of k components and the first eigenvalues of –+b(x) on _j under Dirichlet boundary condition are positive for all . Under these conditions we show that (PM) has at least 2^k–1 positive solutions for large . More precisely we show that for any given non-empty subset , (P) has a positive solutions u(x) for large . In addition for any sequence _n we can extract a subsequence _ni along which u_ni converges strongly in H¹(R^N). Moreover the limit function u(x)=lim_iu_ni satisfies (i) For jJ the restriction u|_j of u(x) to _j is a least energy solution of –v+b(x)v=v^p in _j and v=0 on _j. (ii) u(x)=0 for .Mathematics Subject Classifications (2000):35Q55, 35J20     

Minimality of derivative chains,corresponding to a boundary value problem on a finite segment

One investigates the minimality of derivative chains, constructed from the root vectors of polynomial pencils of operators, acting in a Hilbert space. One investigates in detail the quadratic pencil of operators. In particular, for L()=L₀+L₁+²L₂ with bounded operators L₀0, L₂0 and Re L₁0, one shows the minimality in the space_173-02 of the system {x_k, _kekx_k}, where x_k are eigenvectors of L(), corresponding to the characteristic numbers _kin the deleted neighborhoods of which one has the representation L^–1()=(–_k)^–1R_K+W_K() with one-dimensional operators R_k and operator-valued functions W_K(), k=1, 2, ..., analytic for =_k.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 2, pp. 195–205, February, 1990.     

Regularity of ∫Ω|∇u|2 + λ∫Ω|u−f{2 and some gap phenomenon

We study the regularity of the minimizer u for the functional F (u,f)=|u|² + |u–f{² over all maps uH ¹(, S ²). We prove that for some suitable functions f every minimizer u is smooth in if ₀ and for the same functions f, u has singularities when is large enough.

---

Résumé On étudie la régularité des minimiseurs u du problème de minimisation min_ueH ¹(,S²)(|u|² + |u–f{². On montre que pour certaines fonctions f, u est régulière lorsque ₀ et pour les mêmes f, si est assez grand, alors u possède des singularités.

     

Minimum Divergence Estimators Based on Grouped Data

The paper considers statistical models with real-valued observations i.i.d. by F(x, ₀) from a family of distribution functions (F(x, ); ), R ^s , s 1. For random quantizations defined by sample quantiles (F _n ^–1 (₁),, F _n ^–1 ( _m–1)) of arbitrary fixed orders 0 < ₁ < _m-1 < 1, there are studied estimators _,n of ₀ which minimize -divergences of the theoretical and empirical probabilities. Under an appropriate regularity, all these estimators are shown to be as efficient (first order, in the sense of Rao) as the MLE in the model quantified nonrandomly by (F ^–1 (₁,₀),, F ^–1 ( _m–1, ₀)). Moreover, the Fisher information matrix I _m (₀, ) of the latter model with the equidistant orders = ( _j = j/m : 1 j m – 1) arbitrarily closely approximates the Fisher information J(₀) of the original model when m is appropriately large. Thus the random binning by a large number of quantiles of equidistant orders leads to appropriate estimates of the above considered type.     

Conjugation for polynomial mappings

We consider Keller's functions, namely polynomial functionsf:C ⁿ C ⁿ with detf(x)=1 at allx C ⁿ. Keller conjectured that they are all bijective and have polynomial inverses. The problem is still open.Without loss of generality assumef(0)=0 andf'(0)=I. We study the existence of certain mappingsh , > 1, defined by power series in a ball with center at the origin, such thath(0)=I andh (f(x))=h (x). So eachh conjugates f to its linear part I in a ball where it is injective.We conjecture that for Keller's functionsf of the homogeneous formf(x)=x +g(x),g(sx)=s ^dg(x),g(x)ⁿ=0,xC ⁿ,sC the conjugationh for f is anentire function.     

Symmetry and classification of certain regular group divisible designs

In this paper it is shown that a regular group divisible (GD) design, with parametersv, b, r, k, ₁, ₂ satisfyingrk – ₂ v + 1 and ₂ = ₁ + 1, must be symmetric (i.e.,v + b). Furthermore, the parameters of such symmetric regular GD designs can be expressed in terms of only two integral parameters.Supported in part by Grant 59540043 (C), Japan.     

The Real Period Function of A3 Singularity and Perturbations of the Spherical Pendulum

We prove that the Hessian matrix of the real period function () associated with the real versal deformation f (x)=±x ⁴+₂ x ²+₁ x+₀ of a singularity of type A ₃, is nondegenerate, provided that ³ does not belong to the discriminant set of the singularity. We explain the relation between this result and the perturbations of the spherical pendulum.     

Approximate Identities, Almost-Periodic Functions and Toeplitz Operators

A sequence {A } of linear bounded operators is called stable if, for all sufficiently large , the inverses of A exist and their norms are uniformly bounded. We consider the stability problem for sequences of Toeplitz operators {T(k a)}, where a(t) is an almost-periodic function on unit circle and k a is an approximate identity. A stability criterion is established in terms of the invertibility of a family of almost-periodic functions. This family of functions depends on the approximate identity used in a very subtle way, and the stability condition is, in general, stronger than the invertibility condition of the Toeplitz operator T(a).     

On the method of multipliers for mathematical programming problems

In this paper, the numerical solution of the basic problem of mathematical programming is considered. This is the problem of minimizing a functionf(x) subject to a constraint (x)=0. Here,f is a scalar,x is ann-vector, and is aq-vector, withq<n.The approach employed is based on the introduction of the augmented penalty functionW(x,,k)=f(x)+ ^T (x)+k ^T (x) (x). Here, theq-vector is an approximation to the Lagrange multiplier, and the scalark>0 is the penalty constant.Previously, the augmented penalty functionW(x, ,k) was used by Hestenes in his method of multipliers. In Hestenes' version, the method of multipliers involves cycles, in each of which the multiplier and the penalty constant are held constant. After the minimum of the augmented penalty function is achieved in any given cycle, the multiplier is updated, while the penalty constantk is held unchanged.In this paper, two modifications of the method of multipliers are presented in order to improve its convergence characteristics. The improved convergence is achieved by (i) increasing the updating frequency so that the number of iterations in a cycle is shortened to N=1 for the ordinary-gradient algorithm and the modified-quasilinearization algorithm and N=n for the conjugate-gradient algorithm, (ii) imbedding Hestenes' updating rule for the multiplier into a one-parameter family and determining the scalar parameter so that the error in the optimum condition is minimized, and (iii) updating the penalty constantk so as to cause some desirable effect in the ordinary-gradient algorithm, the conjugate-gradient algorithm, and the modified-quasilinearization algorithm. For the sake of identification, Hestenes' method of multipliers is called Method MM-1, the modification including (i) and (ii) is called Method MM-2, and the modification including (i), (ii), (iii) is called Method MM-3.Evaluation of the theory is accomplished with seven numerical examples. The first example pertains to a quadratic function subject to linear constraints. The remaining examples pertain to non-quadratic functions subject to nonlinear constraints. Each example is solved with the ordinary-gradient algorithm, the conjugate-gradient algorithm, and the modified-quasilinearization algorithm, which are employed in conjunction with Methods MM-1, MM-2, and MM-3.The numerical results show that (a) for given penalty constantk, Method MM-2 generally exhibits faster convergence than Method MM-1, (b) in both Methods MM-1 and MM-2, the number of iterations for convergence has a minimum with respect tok, and (c) the number of iterations for convergence of Method MM-3 is close to the minimum with respect tok of the number of iterations for convergence of Method MM-2. In this light, Method MM-3 has very desirable characteristics.This research was supported by the National Science Foundation, Grant No. GP-32453. The authors are indebted to Messieurs E. E. Cragg and A. Esterle for computational assistance.     

Wijsman convergence: A survey

A net A of nonempty closed sets in a metric space X, d is declaredWijsman convergent to a nonempty closed setA provided for eachx X, we haved(x, A)=lim d(x, A). Interest in this convergence notion originates from the seminal work of R. Wijsman, who showed in finite dimensions that the conjugate map for proper lower semicontinuous convex functions preserves convergence in this sense, where functions are identified with their epigraphs. In this paper, we review the attempts over the last 25 years to produce infinite-dimensional extensions of Wijsman's theorem, and we look closely at the topology of Wijsman convergence in an arbitrary metric space as well. Special emphasis is given to the developments of the past five years, and several new limiting counterexamples are presented.     

All Lambda-Designs With λ = 2 p are Type-1

A-design is a family B ₁,B ₂,...,B _v of subsets of X={1, 2,..., v} such that B _i B _j = for all i jand not all B _i are of the same size. Ryser's andWoodall's -design conjecture states thateach -design can be obtained from a symmetricblock design by a certain complementation procedure. Our mainresult is that the conjecture is true when is twice a prime number.     

Lattice Polytopes Associated to Certain Demazure Modules of sl n + 1

Let w be an element of the Weyl group of sl _{n + 1}. We prove that for a certain class of elements w (which includes the longest element w₀ of the Weyl group), there exist a lattice polytope R ^l(w) , for each fundamental weight _i of sl _{n + 1}, such that for any dominant weight = _{i = 1} ⁿ a _{i i} , the number of lattice points in the Minkowski sum _w = _{i = 1} ⁿ a _{i i} ^w is equal to the dimension of the Demazure module E _w (). We also define a linear map A ^w : R ^l(w) P _Z R where P denotes the weight lattice, such that char E _w () = e e^–A(x) where the sum runs through the lattice points x of ^w .     

The asymptotic properties of the multichannel autoregressive spectral estimates

If we fit a-vector stationary time series using observationsx(1), ...,x(T) with AR models , then the spectral densityf() of {x(t)} can be estimated byf _k ^(T) ()=(2)^– A _k ^(T) (e ^–)^–1 _k ^(T) A _k ^(T) (e ^–i)^–, where are estimates of the variance matrix of(t), the residuals of the best linear prediction. By extending some results for the scalar case, this paper treats the asymptotic properties of the estimates in the multichannel case.     

The eigenvalues of the Sinyukov mapping for geodesically equivalent metrics are globally ordered

Suppose all geodesics of two Riemannian metrics g and defined on a (connected, geodesically complete) manifold M ⁿ coincide. At each point x M ⁿ , consider the common eigenvalues ₁, ₂, ... , _n of the two metrics (we assume that _{1 2 n}) and the numbers . We show that the numbers _i are ordered over the entire manifold: for any two points x and y in M the number _k(x) is not greater than _k+1(y). If _k(x)= _k+1(y), then there is a point z M _n such that _k(z)= _k+1(z). If the manifold is closed and all the common eigenvalues of the metrics are pairwise distinct at each point, then the manifold can be covered by the torus.Translated from Matematicheskie Zametki, vol. 77, no. 3, 2005, pp. 412–423.Original Russian Text Copyright © 2005 by V. S. Matveev.This revised version was published online in April 2005 with a corrected issue number.     

On the stability properties of Brown's multistep multiderivative methods

Summary Brown introducedk-step methods usingl derivatives. We investigate for whichk andl the methods are stable or unstable. It is seen that to anyl the method becomes unstable fork large enough. All methods withk2(l+1) are stable. Fork=1,2,..., 18 there exists a _k such that the methods are stable for anyl _k and unstable for anyl < _k . The _k are given.     

An interior point multiplicative method for optimization under positivity constraints

We analyze an algorithm for the problem minf(x) s.t.x 0 suggested, without convergence proof, by Eggermont. The iterative step is given by x _j ^k+1 =x _j ^k (1-_kf(x ^k)_j) with _k > 0 determined through a line search. This method can be seen as a natural extension of the steepest descent method for unconstrained optimization, and we establish convergence properties similar to those known for steepest descent, namely weak convergence to a KKT point for a generalf, weak convergence to a solution for convexf and full convergence to the solution for strictly convexf. Applying this method to a maximum likelihood estimation problem, we obtain an additively overrelaxed version of the EM Algorithm. We extend the full convergence results known for EM to this overrelaxed version by establishing local Fejér monotonicity to the solution set.Research for this paper was partially supported by CNPq grant No 301280/86.     

Directed packings with block size 5 and even ν

Let andk be positive integers. A transitively orderedk-tuple (a ₁,a ₂,...,a _k) is defined to be the set {(a _i, a_j) 1i<jk} consisting ofk(k–1)/2 ordered pairs. A directed packing with parameters ,k and index =1, denoted byDP(k, 1; ), is a pair (X, A) whereX is a -set (of points) andA is a collection of transitively orderedk-tuples ofX (called blocks) such that every ordered pair of distinct points ofX occurs in at most one block ofA. The greatest number of blocks required in aDP(k, 1; ) is called packing number and denoted byDD(k, 1; ). It is shown in this paper that for all even integers , where [x] is the floor ofx.     

Interpolation theorem for linear operators

In generalizing a series of known results, the following theorem is proved: If K is a continuous linear operator mapping E₀ into F₀ and E₁ into F₁ (where E₀, E₁ and F₀, F₁, being ideal spaces, are Banach lattices of functions defined on ₁ and ₂ respectively), then for any . (0, 1) K maps E ₀ ^1– E ₁ into [(F ₀ )^1–(F ₁ )] and is continuous; for suitably chosen norms in the spacesE ₀ ^1– E ₁ and [(F ₀ )^1–(F ₁ )] the norm of K is a logarithmically convex function of . Six titles are cited in the bibliography.Translated from Matematicheskie Zametki, Vol. 2, No. 6, pp. 593–598, December, 1967.The author wishes to thank M. A. Krasnosel'skii, under whose direction he is working.     

Quasi-symmetric 3-designs with triangle-free graph

The following result is proved: Let D be a quasi-symmetric 3-design with intersection numbers x, y(0x<y<k). D has no three distinct blocks such that any two of them intersect in x points if and only if D is a Hadamard 3-design, or D has a parameter set (v, k, ) where v=(+2)(²+4+2)+1, k=²+3+2 and =1,2,..., or D is a complement of one of these designs.