Reverse Functional Inequalities and Their Applications to Nonlinear Elliptic Boundary Value Problems

We establish some reverse inequalities. We give applications to nonlinear elliptic boundary value problems containing a parameter which have two branches of solutions u (0) and U (>0) of which the first is continuous at the origin and the second increases indefinitely as 0.     

Factorization of a selfadjoint nonanalytic operator function II. Single spectral zone

We consider a selfadjoint and smooth enough operator-valued functionL() on the segment [a, b]. LetL(a)0,L(b)0, and there exist two positive numbers and such that the inequality |(L()f, f)|< ([a, b] f=1) implies the inequality (L'()f, f)>. Then the functionL() admits a factorizationL()=M()(I-Z) whereM() is a continuous and invertible on [a, b] operator-valued function, and operatorZ is similar to a selfadjoint one. This result was obtained in the first part of the present paper [10] under a stronge conditionL()0 ( [a,b]). For analytic functionL() the result of this paper was obtained in [13].     

A sandwich theorem and Hyers—Ulam stability of affine functions

It is shown that two real functionsf andg, defined on a real intervalI, satisfy the inequalitiesf(x + (1 – )y) g(x) + (1 – )g(y) andg(x + (1 – )y) f(x) + (1 – )f(y) for allx, y I and [0, 1], iff there exists an affine functionh: I such thatf h g. As a consequence we obtain a stability result of Hyers—Ulam type for affine functions.     

On dominant operators

This paper is devoted to the study of dominant operators with an emphasis on their spectral properties. In particular the equation (T–)f() x (T a dominant or hyponormal operator on the Hilbert space ,x andf a function from the open setU to ) is investigated in an effort to discover necessary and/or sufficient conditions for the analyticity off.Supported in part by the National Science Foundation.     

J-pseudo-spectral andJ-inner-pseudo-outer factorizations for matrix polynomials

For a comonic polynomialL() and a selfadjoint invertible matrixJ the following two factorization problems are considered: firstly, we parametrize all comonic polynomialsR() such that . Secondly, if it exists, we give theJ-innerpseudo-outer factorizationL()=()R(), where () isJ-inner andR() is a comonic pseudo-outer polynomial. We shall also consider these problems with additional restrictions on the pole structure and/or zero structure ofR(). The analysis of these problems is based on the solution of a general inverse spectral problem for rational matrix functions, which consists of finding the set of rational matrix functions for which two given pairs are extensions of their pole and zero pair, respectively.The work of this author was supported by the USA-Israel Binational Science Foundation (BSF) Grant no. 9400271.     

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.     

Two-Phase Obstacle Problem

On the basis of the monotonicity formula due to Alt, Caffarelli, and Friedman, the boundedness of the second-order derivatives D ² u of solutions to the equation

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 .     

Preassigning the boundary of diametrically-complete sets

In a Minkowski space with unit ballS, a setD() is diametrically complete ifD()={. In this paper a method is given for generating such setsD() which contain an arbitrary setX. This technique is then employed to find necessary and sufficient conditions for a setA to lie on the boundary of some suchD() and bounds are given on the acceptable values of .     

The spectral bound of Schrödinger operators

Let V: R ^N [0, ] be a measurable function, and >0 be a parameter. We consider the behaviour of the spectral bound of the operator 1/2–V as a function of . In particular, we give a formula for the limiting value as , in terms of the integrals of V over subsets of R ^N on which the Laplacian with Dirichlet boundary conditions has prescribed values. We also consider the question whether this limiting value is attained for finite .     

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.     

Orthogonal systems

An equidistant permutation array (E.P.A.)A(r, v) is av × r array in which every row is a permutation of the integers 1, 2, ,r such that any two distinct rows have precisely columns in common. In this paper we introduce the concept of orthogonality for E.P.A.s. A special case of this is the well known idea of a set of pairwise orthogonal latin squares. We show that a set of these arrays is equivalent to a particular type of resolvable (r, )-design. It is also shown that the cardinality of such a set is bounded byr – with the upper bound being obtained only if = 0. A brief survey of related orthogonal systems is included. In particular, sets of pairwise orthogonal symmetric latin squares, sets of orthogonal Steiner systems and sets of orthogonal skeins.     

Holomorphic Solutions of Some Functional Equations II

We study a certain type of functional equation, which is of significance from the view point of systems of difference equations. Let the characteristic values of the system be and The case that either || > 1 or 0 < || < 1 has been treated in a former paper. The case that = 1, || = 1 with 1 will be given in another paper. The present note deals with the case = = 1, the most difficult case.AMS Subject Classification (1991): 39A10 39B05     

A Proof of the Jungnickel-Tonchev Conjecture on Quasi-Multiple Quasi-Symmetric Designs

A proof of the following conjecture of Jungnickel and Tonchev on quasi-multiple quasi-symmetric designs is given: Let D be a design whose parameter set (v,b,r,k,) equals (v,sv,sk,k, s) for some positive integer s and for some integers v,k, that satisfy (v-1) = k(k-1) (that is, these integers satisfy the parametric feasibility conditions for a symmetric (v,k,)-design). Further assume that D is a quasi-symmetric design, that is D has at most two block intersection numbers. If (k, (s-1)) = 1, then the only way D can be constructed is by taking multiple copies of a symmetric (v,k, )-design.     

On the Multiplicity of Eigenvalues of the Laplacian on Surfaces

We show that the multiplicity of the eigenvalues of the Laplace Beltrami operator on compact Riemannian surfaces with genus zero is bounded by m(k) 2k – 3 for k 3. Here we label the eigenvalues in the following way: 0 = 1 < 2 3 . . ..     

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.     

The core of a chain complete poset with no one-way infinite fence and no tower

Like dismantling for finite posets, a perfect sequence = P : of a chain complete posetP represents a canonical procedure to produce a coreP . It has been proved that if the posetP contains no infinite antichain then this coreP is a retract ofP andP has the fixed point property iffP has this property. In this paper the condition of having no infinite antichain is replaced by a weaker one. We show that the same conclusion holds under the assumption thatP does not contain a one-way infinite fence or a tower.Supported by a grant from The National Natural Science Foundation of China.     

Sharp parameter ranges in the uniform anti-maximum principle for second-order ordinary differential operators

We consider the equation (pu)-qu+wu = f in (0,1) subject to homogenous boundary conditions at x = 0 and x = 1, e.g., u(0) = u(1) = 0. Let ₁ be the first eigenvalue of the corresponding Sturm-Liouville problem. If f 0 but 0 then it is known that there exists > 0 (independent on f) such that for (₁, ₁ + ] any solution u must be negative. This so-called uniform anti-maximum principle (UAMP) goes back to Clément, Peletier [4]. In this paper we establish the sharp values of for which (UAMP) holds. The same phenomenon, including sharp values of , can be shown for the radially symmetric p-Laplacian on balls and annuli in ⁿ provided 1 n < p. The results are illustrated by explicitly computed examples.     

A property of entire functions with real taylor coefficients

Suppose thatf(z) is an entire transcendental function with real Taylor coefficients, M(r)= max¦f(z)¦on¦z¦=r, and {_n} is the sequence of sign changes of the coefficients. We will show that if (1/_n)<, then .Translated from Matematicheskie Zametki, Vol. 18, No. 3, pp. 395–402, September, 1975.The author thanks A. A. Gol'dberg for his useful comments.     

(v,k, λ)-Graphs and polarities of (v,k, λ)-designs

In 2.1 it is established that there is a one-to-one correspondence between (v, k, )-graphs and polarities, with no absolute points, of (v, k, )-designs. This is used to show that the parameters of a (v, k, )-graph are of the form ((s/a)((s + a)²–1), s(s+a), sa) where s and a are positive integers with a dividing s(s²–1) (Theorem 3.4) but strictly less than s(s²–1) (Proposition 4.3). Some consequences of this parametrization are discussed and in particular, it is shown that for fixed 2 there are only finitely many non-isomorphic (v, k, )-graphs. In 4. it is shown that (v, k, )-graphs can also be constructed using polarities, with all points absolute, of certain designs. In 5. isomorphisms and automorphisms of graphs and designs are discussed. Many examples of (v, k, )-graphs, including some apparently new ones, are given.Dedicated to Peter Dembowski, 28 January 1971