An implicit function theorem: Comment

In Ref. 1, Jittorntrum proposed an implicit function theorem for a continuous mappingF:R ⁿ ×R ^m R ⁿ, withF(x ⁰,y ⁰)=0, that requires neither differentiability ofF nor nonsingularity of _x F(x ⁰,y ⁰). In the proof, the local one-to-one condition forF(·,y):A R ⁿ R ⁿ for ally B is consciously or unconsciously treated as implying thatF(·,y) mapsA one-to-one ontoF(A, y) for ally B, and the proof is not perfect. A proof can be given directly, and the theorem is shown to be the strongest, in the sense that the condition is truly if and only if.     

A class of nonlinear complementarity problems for multifunctions

Given a continuous mapF:R ⁿ R ⁿ and a lower semicontinuous positively homogeneous convex functionh:R ⁿ R, the nonlinear complementarity problem considered here is to findxR ₊ ⁿ andyh(x), the subdifferential ofh atx, such thatF(x)+y0 andx ^T (F(x)+y)=0. Some existence theorems for the above problem are given under certain conditions on the mapF. An application to quasidifferentiable convex programming is also shown.The authors are grateful to Professor O. L. Mangasarian and the referee for their substantive suggestions.     

Density functions for prime and relatively prime numbers

Letr ^*(x) denote the maximum number of pairwiserelatively prime integers which can exist in an interval (y,y+x] of lengthx, and let ^*(x) denote the maximum number ofprime integers in any interval (y,y+x] whereyx. Throughout this paper we assume the primek-tuples hypothesis. (This hypothesis could be avoided by using an alternative sievetheoretic definition of ^*(x); cf. the beginning of Section 1.) We investigate the differencer ^*(x)—^*(x): that is we ask how many more relatively prime integers can exist on an interval of lengthx than the maximum possible number of prime integers. As a lower bound we obtainr ^*(x)—^*(x)<x ^c for somec>0 (whenx). This improves the previous lower bound of logx. As an upper bound we getr ^*(x)—^*(x)=o[x/(logx)²]. It is known that ^*(x)—(x)>const.[x/(logx)²];.; thus the difference betweenr ^*(x) and ^*(x) is negligible compared to ^*(x)—(x). The results mentioned so far involve the upper bound or maximizing sieve. In Section 2, similar comparisons are made between two types of minimum sieves. One of these is the erasing sieve, which completely eliminates an interval of lengthx; and the other, introduced by Erdös and Selfridge [1], involves a kind of minimax for sets of pairwise relatively prime numbers. Again these two sieving methods produce functions which are found to be closely related.     

Orthogonality and additivity modulo a subgroup

Summary LetE be a real inner product space of dimension at least 2,F a topological Abelian group, andK a discrete subgroup ofF. Assume also thatF is continuously divisible by 2 (that is, the functionu 2u is a homeomorphism ofF ontoF). Iff: E F fulfils the conditionf(x + y) – f(x) – f(y) K for all orthogonalx, y E and is continuous at the origin then there exist continuous additive functionsa: R F andA: E F such thatf(x) – a(x ²)– A(x) K for everyx E. Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth.     

Weight functions on the Kneser graph and the solution of an intersection problem of Sali

LetX, Y be finite sets and suppose thatF is a collection of pairs of sets (F, G),FX,GY satisfying |FF|s, |GG|t and |FF|+|GG|s+t+1 for all (F, G),F, GF. Extending a result of Sali, we determine the maximum ofF.     

On the controllability of a class of differential inclusions depending on a parameter

In this paper, we deal with the following stability problem: given a differential inclusion of the formx'F(t,x,), where is a parameter varying in a topological space , find conditions under which the set of all , such that the differential inclusion is controllable, is open in . Applying Theorem 3.1 of Ref. 3, we get a result in this direction, assuming, as leader hypotheses, thatF(t,·,) is a convex process, from into itself, and thatF(t,x,·) is lower semicontinuous.     

An automatic integration procedure for infinite range integrals involving oscillatory kernels

Let the real functionsK(x) andL(x) be such thatM(x)=K(x)+iL(x)=e^ix g(x), whereg(x) is infinitely differentiable for all largex and is non-oscillatory at infinity. We develop an efficient automatic quadrature procedure for numerically computing the integrals _a K(t)f(t) and _a L(t)f(t)dt, where the functionf(t) is smooth and nonoscillatory at infinity. One such example for which we also provide numerical results is that for whichK(x)=J (x) andL(x)=Y (x), whereJ (x) andY (x) are the Bessel functions of order . The procedure involves the use of an automatic scheme for Fourier integrals and the modified W-transformation which is used for computing oscillatory infinite integrals.     

Theorem of Bartle,Dunford, and Schwartz concerning vector measures

We show the existence, for an arbitrary vector measure: x (where X is a Banach space and gs is a-algebra of subsets of a set S) of a functional x X (X is the conjugate space of X) such that is absolutely continuous with respect to _x, _x (E)=(E)>, E gs.Translated from Matematicheskie Zametki, Vol. 7, No. 2, pp. 247–254, February, 1970.     

A remark on generalized iterates

Letf be an invertible function on the real lineR, and letZ denote the set of integers. For eachx Z, letf ^|n| denote then'th iterate off. Clearlyf ^|m|(f ^|n|(x))=f ^|m+n|(x) for allm,nZ and allxR. LetG be any group of orderc, the cardinality of the continuum, which contains (an isomorphic copy of)Z as a normal subgroup. If for eachxR, the iteration trajectory (orbit) ofx is non-periodic, then there exists a set of invertible functionsF={F ^||:G} on the real line with the properties (i)F ^||(F ^||(x))=F ^|+| (x) for allxR and (ii)F ^|n|(x)=f ^|n|(x) for allnZ andxR. That is,f can be embedded in a set ofG-generalized iterates. In particular,f can be embedded in a set of complex generalized iterates.Dedicated to Professor Janos Aczél on his 60th birthday     

Kite-freeP- andQ-polynomial schemes

LetY = (X, {R _i } _oid) denote aP-polynomial association scheme. By a kite of lengthi (2 i d) inY, we mean a 4-tuplexyzu (x, y, z, u X) such that(x, y) R ₁,(x, z) R ₁,(y, z) R ₁,(u, y) R _i–1,(u, z) R _i–1,(u, x) R _i. Our main result in this paper is the following.     

A new continuation method for complementarity problems with uniformP-functions

The complementarity problem with a nonlinear continuous mappingf from the nonnegative orthantR ₊ ⁿ ofR ⁿ intoR ⁿ can be written as the system of equationsF(x, y) = 0 and(x, y) R ₊ ²ⁿ , whereF denotes the mapping from the nonnegative orthantR ₊ ²ⁿ ofR ²ⁿ intoR ₊ ⁿ × Rⁿ defined byF(x, y) = (x ₁y₁,,x_ny_n, f₁(x) – y₁,, f_n(x) – y_n) for every(x, y) R ₊ ²ⁿ . Under the assumption thatf is a uniformP-function, this paper establishes that the mappingF is a homeomorphism ofR ₊ ²ⁿ ontoR ₊ ⁿ × Rⁿ. This result provides a theoretical basis for a new continuation method of tracing the solution curve of the one parameter family of systems of equationsF(x, y) = tF(x ⁰, y⁰) and(x, y) R ₊ ²ⁿ from an arbitrary initial point(x ⁰, y⁰) R ₊ ²ⁿ witht = 1 until the parametert attains 0. This approach is an extension of the one used in the polynomially bounded algorithm recently given by Kojima, Mizuno and Yoshise for solving linear complementarity problems with positive semi-definite matrices.     

Stabilization of solutions of certain parabolic equations and systems

This paper concerns the investigation of the stabilization of solutions of the Cauchy problem for a system of equations of the form u/t = u + f_i(u, v); v/t = v + F₂(u, v). It is proved that under certain assumptions the behavior of solutions as t is determined by mutual arrangement of the set of initial conditions {(u, v): u = f₁(x), v =f ₂(x), xRⁿ} and the trajectories of the system of ordinary differential equations du/dt = F₁(u, v), dv/dt = F₂(u, v). The question of stabilization of the solutions of a single quasilinear parabolic equation is also considered.Translated from Matematicheskie Zametki, Vol. 3, No. 1, pp. 85–92, January, 1968.     

Milnor numbers and the topology of polynomial hypersurfaces

Summary LetF: n + 1 be a polynomial. The problem of determining the homology groupsH _q (F ^–1 (c)), c , in terms of the critical points ofF is considered. In the best case it is shown, for a certain generic class of polynomials (tame polynomials), that for allc,F ^–1 (c) has the homotopy type of a bouquet of - ^c n-spheres. Here is the sum of all the Milnor numbers ofF at critical points ofF and ^c is the corresponding sum for critical points lying onF ^–1 (c). A second best case is also discussed and the homology groupsH _q (F ^–1 (c)) are calculated for genericc. This case gives an example in which the critical points at infinity ofF must be considered in order to determine the homology groupsH _q (F ^–1 (c)).     

Skew Hopf fibrations

We introduce class F_R(S²⁺¹) of analytic fibrations of sphere S²ⁿ⁺¹,n1, by great circles for which there exists a tensor R, with the algebraic properties of a curvature tensor, such that 1) for almost everyx (R ²ⁿ +2 there exists a unique plane )x, Ofith the condition R (x, u, x)=x ² u, (u x, u (); 2) for planes spanned by fibers condition R(x, u x)=x ² u, (u x, u, x () is fulfiled. We show that F_R(S²ⁿ⁺¹) consists of skew Hopf fibrations (for n=1 see Rzh. Mat. 1987, 11A822). This implies a negative answer to the conjecture expressed in Rzh. Mat. 1972, 11A559 that this class consists of Hopf fibrations. The proof is based on the following result: skew Hopf fibrations are characterized, in the class of all analytic fibrations of a sphere by great circles, by the property that for any pair of orthogonal fibers the great three-dimensional sphere containing them inherits a skew Hopf fibration.Translated from Ukrainskii Geometricheskii Sbornik, No. 33, pp. 101–104, 1990.     

The trace to subsets ofR n of Besov spaces in the general case

R ⁿ. , , , F R ⁿ, F , R ⁿ R ⁿ . ^p,q (Rⁿ), >0, 1, q, — ( ) Rⁿ. , ^p,q (Rⁿ) ^F Rⁿ. , q B ^p,q (F), = – (n–)/, >0, — « », ad — F, . , . : , F=R ^d,F— « » F— R ⁿ, « », F. .

---

---

This work has been supported in part by the Swedish Natural Science Research Council.     

On local uniqueness of the solution of boundary-value problems

In this paper we present conditions under which differentiability of the mappings F: ACⁿ(I) Lⁿ(I) and :ACⁿ(I) Rⁿ at x₀ ACⁿ(I) and the uniqueness of the solution of the boundaryvalue problem u = F(x₀)(u), (x₀)(u) = 0 imply local uniqueness of the solution x₀ of the boundary-value problem x = F(x), (x) = 0.Translated from Matematicheskie Zametki, Vol. 15, No. 6, pp. 891–895, June, 1974.The author thanks A. Ya. Lepin for the help he has given him in the preparation of this paper.     

Symmetrische Permutationsmengen

A permutation set (M, I) consisting of a setM and a set of permutations ofM, is calledsymmetric, if for any two permutations, the existence of anx M with (x) (x) and ^–1 (x) = ^–1 (x) implies ^–1 = ^–1 , andsharply 3-transitive, if for any two triples (x ₁,x ₂,x ₃), (y ₁,y ₂,y ₃) M ³ with|{x ₁,x ₂,x ₃ }| = |{y ₁,y ₂,y ₃ }| = 3 there is exactly one permutation with(x ₁) =y ₁,(x ₂) =y ₂,(x ₃) =y ₃. The following theorem will be proved.THEOREM.Let (M, ) be a sharply 3-transitive symmetric permutation set with |M|3, such that contains the identity. Then is a group and there is a commutative field K such that and the projective linear group PGL(2, K) are isomorphic.     

On the convergence of projected gradient processes to singular critical points

The projected gradient methods treated here generate iterates by the rulex _k+1=P (x _k –s _k F(x _k )),x ₁ , where is a closed convex set in a real Hilbert spaceX,s _k is a positive real number determined by a Goldstein-Bertsekas condition,P projectsX into ,F is a differentiable function whose minimum is sought in , and F is locally Lipschitz continuous. Asymptotic stability and convergence rate theorems are proved for singular local minimizers in the interior of , or more generally, in some open facet in . The stability theorem requires that: (i) is a proper local minimizer andF grows uniformly in near ; (ii) –F() lies in the relative interior of the coneK of outer normals to at ; and (iii) is an isolated critical point and the defect P (x – F(x)) –x grows uniformly within the facet containing . The convergence rate theorem imposes (i) and (ii), and also requires that: (iv)F isC ⁴ near and grows no slower than x–⁴ within the facet; and (v) the projected Hessian operatorP _{F 2} F()F is positive definite on its range in the subspaceF orthogonal toK . Under these conditions, {x _k } converges to from nearby starting pointsx ₁, withF(x _k ) –F() =O(k ^–2) and x _k – =O(k ^–1/2). No explicit or implied local pseudoconvexity or level set compactness demands are imposed onF in this analysis. Furthermore, condition (v) and the uniform growth stipulations in (i) and (iii) are redundant in ⁿ .     

On some additive mappings in rings with involution

Summary LetR be a *-ring. We study an additive mappingD: R R satisfyingD(x ²) =D(x)x ^* +xD(x) for allx R.It is shown that, in caseR contains the unit element, the element 1/2, and an invertible skew-hermitian element which lies in the center ofR, then there exists ana R such thatD(x) = ax ^* – xa for allx R. IfR is a noncommutative prime real algebra, thenD is linear. In our main result we prove that a noncommutative prime ring of characteristic different from 2 is normal (i.e.xx ^* =x ^* x for allx R) if and only if there exists a nonzero additive mappingD: R R satisfyingD(x ²) =D(x)x ^* +xD(x) and [D(x), x] = 0 for allx R. This result is in the spirit of the well-known theorem of E. Posner, which states that the existence of a nonzero derivationD on a prime ringR, such that [D(x), x] lies in the center ofR for allx R, forcesR to be commutative.     

The embedding of linearly ordered sets

It is shown that if a linearly ordered set B does not contain as subsets sets of order type and ^* then B can be embedded in 2 . We construct an example of a set satisfying the above conditions which cannot be embedded in any 2 if < . Simultaneously we show that for any ordinal, 2 ⁺¹ cannot be embedded in 2 and that there exists at least ₊₁ distinct dense order types of cardinality 2 .Translated from Matematicheskie Zametki, Vol. 11, No. 1, pp. 83–88, January, 1972.In conclusion, I wish to take the opportunity to thank Yu. L. Ershov for kindness and assistance in this work.