Fibred links and a construction of real singularities via complex geometry

This note gives a method for constructing real analytic maps from ²ⁿ into ², with an isolated critical point at 0 ²ⁿ , for alln>1. This provides infinite families of real singularities which fiber a la Milnor.Research partially supported by CONACYT, Mexico, grant 1206-E92103.     

On a Class of Convex Sets and Functions

Given a convex subset C of ⁿ, the set-valued mapping C (where 0C is, by convention, the recession cone of C) is increasing on ₊ if and only if C contains the origin, and decreasing on ₊ if and only if C is contained in its recession cone. This simple fact enables us to define a binary operation which combines a concave or convex function on ^m with a convex subset of ⁿ to produce a convex subset of ^n+m. This binary operation is the set theoretic counterpart of a functional operation introduced by the author. In this paper, we present a detailed study of the class of convex subsets which are contained in their recession cones, and we establish some remarkable properties of our binary operation.Mathematics Subject Classifications (2000) 26A51, 26B25, 26E25.     

On Non-Negative Elliptic-Type Differential Inequalities in ℝ n , Vanishing Almost Everywhere on Some Open Subset in ℝ n

It is proved in this article that any generalized solution of a sufficiently general class of elliptic-type differential inequalities in  ⁿ that is non-negative almost everywhere in  ⁿ and vanishes almost everywhere on an open set ⁿ is trivial in  ⁿ .     

Constraint decomposition algorithms in global optimization

Many global optimization problems can be formulated in the form min{c(x, y): x X, y Y, (x, y) Z, y G} where X, Y are polytopes in ^p , ⁿ , respectively, Z is a closed convex set in ^p+n, while G is the complement of an open convex set in ⁿ . The function c: ^p+n is assumed to be linear. Using the fact that the nonconvex constraints depend only upon they-variables, we modify and combine basic global optimization techniques such that some new decomposition methods result which involve global optimization procedures only in ⁿ . Computational experiments show that the resulting algorithms work well for problems with smalln.     

On local oscillatory integrals with variable Calderón-Zygmund kernels

Letp(1, ). In this paper, the authors investigate the uniformL ^p ( ⁿ ) in of the oscillatory singular integral operatorT defined by

Conditions for separately subharmonic functions to be subharmonic

Letu be a function on ^m × ⁿ , wherem2 andn2, such thatu(x, .) is subharmonic on ⁿ for each fixedx in ^m andu(.,y) is subharmonic on ^m for each fixedy in ⁿ . We give a local integrability condition which ensures the subharmonicity ofu on ^m × ⁿ , and we show that this condition is close to being sharp. In particular, the local integrability of (log⁺ u ⁺) ^m+n–2+ is enough to secure the subharmonicity ofu if >0, but not if <0.     

Random continued fractions and inverse Gaussian distribution on a symmetric cone

In this paper we introduce the inverse Gaussian and Wishart distributions on the cone of real (n, n) symmetric positive definite matricesH _n ⁺ () and more generally on an irreducible symmetric coneC. Then we study the convergence of random continued fractions onH _n ⁺ () andC by means of real Lagrangians forH _n ⁺ () and by new algebraic identities on symmetric cones forC. Finally we get a characterization of the inverse Gaussian distribution onH _n ⁺ () andC.     

On solvability of linear difference equations in smooth and real analytic vector functions of several variables

We investigate the multidimensional equations _j=1 ^q A_j(x)y(x+e _j )=f(x),e _j ⁿ wherex ⁿ andA _j : ⁿ Hom( ^p , ^m ),f : ^{n m} are given maps. Sufficient conditions for smooth and analytic solvability for anyf C ^k ,k are found.Research partially supported by the Israel Ministry of ScienceAMS classification 39B Functional equations     

A chord-stretching map of a convex loop is an isometry

Let ⁿ be n-dimensional Euclidean space, and let : [0, L] ⁿ and : [0, L] ⁿ be closed rectifiable arcs in ⁿ of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C ² curves. In this paper we prove the conjecture in general.     

Global optimization and stochastic differential equations

Let ⁿ be then-dimensional real Euclidean space,x=(x ₁,x ₂, ...,x _n)^{T n} , and letf: ⁿ R be a real-valued function. We consider the problem of finding the global minimizers off. A new method to compute numerically the global minimizers by following the paths of a system of stochastic differential equations is proposed. This method is motivated by quantum mechanics. Some numerical experience on a set of test problems is presented. The method compares favorably with other existing methods for global optimization.This research has been supported by the European Research Office of the US Army under Contract No. DAJA-37-81-C-0740.The third author gratefully acknowledges Prof. A. Rinnooy Kan for bringing to his attention Ref. 4.     

An Elementary Approach to Quasi-Isometries of Tree x ℝ n

We prove by elementary means a regularity theorem for quasi-isometries of T x ⁿ (where T denotes an infinite tree), and of many other metric spaces with similar combinatorial properties, e.g. Cayley graphs of Baumslag–Solitar groups. For quasi-isometries of T x ⁿ, it states that the image of {x} x ⁿ (xT) is uniformly close to {y} x ⁿ for some yT, and there is a well-defined surjection . Even stronger, the image of a quasi-isometric embedding of ⁿ⁺¹ in T x ⁿ is close to (a geodesic in T)T)x ⁿ.     

Wiener-Ditkin sets for certain beurling algebras

It is proved that closed subgroups of ⁿ are Wiener-Ditkin sets for the Beurling algebrasL ¹ ( ⁿ ), <1.     

On some functional equations of Goląb-Schinzel type

Summary LetE be a real Hausdorff topological vector space. We consider the following binary law * on ·E:(, ) * (, ) = (, ^k + ) for(, ), (, ) × E where is a nonnegative real number,k andl are integers.In order to find all subgroupoids of ( ·E, *) which depend faithfully on a set of parameters, we have to solve the following functional equation:f(f(y) ^k x +f(x) ^l y) =f(x)f(y) (x, y E). (1)In this paper, all solutionsf: of (1) which are in the Baire class I and have the Darboux property are obtained. We obtain also all continuous solutionsf: E of (1). The subgroupoids of (^* ·E, *) which dapend faithfully and continuously on a set of parameters are then determined in different cases. We also deduce from this that the only subsemigroup ofL _n ¹ of the form {(F(x ₂,x ₃, ,x _n ),x ₂,x ₃, ,x _n ); (x ₂, ,x _n ) ^{n – 1} }, where the mappingF: ^{n – 1 *} has some regularity property, is {1} × ^{n – 1} .We may noitice that the Gob-Schinzel functional equation is a particular case of equation (1)(k = 0, l = 1, = 1). So we can say that (1) is of Gob—Schinzel type. More generally, whenE is a real algebra, we shall say that a functional equation is of Gob—Schinzel type if it is of the form:f(f(y) ^k x +f(x) ^l y) =F(x,y,f(x),f(y),f(xy)) wherek andl are integers andF is a given function in five variables. In this category of functional equations, we study here the equation:f(f(y) ^k x +f(x) ^l y) =f(xy) (x, y f: ). (4)This paper extends the results obtained by N. Brillouët and J. Dhombres in [3] and completes some results obtained by P. Urban in his Ph.D. thesis [11] (this work has not yet been published).Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

Zur Lösung parameterabhängiger nichtlinearer Gleichungen mit singulären Jacobi-Matrizen

Summary For solving the nonlinear systemG(x, t)=0,G| ⁿ × ^{1 n} , which is assumed to have a smooth curve of solutions a continuation method with self-choosing stepsize is proposed. It is based on a PC-principle using an Euler-Cauchy-predictor and Newton's iteration as corrector. Under the assumption thatG is sufficiently smooth and the total derivative (₁ G(x, t)₂ G(x, t)) has full rankn along the method is proven to terminate with a solution (x ^N , 1) of the system fort=1. It works succesfully, too, if the Jacobians ₁ G(x, t) become singular at some points of , e.g., if has turning points. The method is especially able to give a point-wise approximation of the curve implicitly defined as solution of the system mentioned above.

     

Variations on the theme of repeated distances

We give an asymptotically sharp estimate for the error term of the maximum number of unit distances determined byn points in ^{d, d}4. We also give asymptotically tight upper bounds on the total number of occurrences of the favourite distances fromn points in ^{d, d}4. Related results are proved for distances determined byn disjoint compact convex sets in ².At the time this paper was written, both authors were visiting the Technion — Israel Institute of Technology.     

On the problem of two linearized wells

We study the behaviour of sequences of elastic deformationsy ^{n n} whose gradients approach two linearized wells, and give an application to magnetostriction.This article was processed by the author using the style filepljour1m from Springer-Verlag.     

Analogues of hadwiger's theorem in space ℝ n —Sufficient conditions for a convex domain to enclose another

We estimate the kinematic measure of one convex domain moving to another under the groupG of rigid motions in ⁿ . We first estimate the kinematic formula for the total scalar curvature D ₀gD ₁ Rdv of then–2 dimensional intersection submanifold D ₀gD ₁. Then we use Chern and Yen's kinematic fundamental formula and our integral inequality to obtain a sufficient condition for one convex domain to contain another in ⁿ (4). Forn=4, we directly obtain another sufficient condition in ⁴.     

A refinement of an estimate of the arithmetic minimum of the product of nonhomogeneous linear forms (regarding Minkowski's nonhomogeneous conjecture)

One refines an estimate of B. F. Skubenko (Tr. Mat. Inst. Akad. Nauk 148, 218–224 (1978)). Let be a point lattice of determinant d() in the n-dimensional Euclidean space ⁿ. and let L^ñ. We consider the nonhomogeneous One proves that there exists an effectively computable constant n_o such that if nn_o, then.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 82, pp. 88–94, 1979.     

Une caracterisation du type de la loi de Cauchy-conforme sur ℝ n

Résumé La loi de Cauchy-conforme est la mesure de probabilité sur ⁿ de densitéC/(1+X²)ⁿ. Le type d'une mesure sur ⁿ étant l'ensemble des mesures images de par les similitudes-translations de ⁿ et étant une mesure de probabilité sans atome, on démontre que le type de est invariant par les inversions de ⁿ si et seulement si est du type de la loi de Cauchy-conforme.

---

The conformal Cauchy law is the probability on ⁿ with densityC/(1+X²)ⁿ. It is shown that for a non-atomic measure on ⁿ the following is true: its type is invariant under inversions of ⁿ if and only if it is the type of a conformal Cauchy law. (The type of a measure is defined as the set of its images under similarities and translations.)

     

Complete controllability

A linear autonomous control system in ⁿ is said to be completely controllable iff there existsT>0 such that eachx ⁿ can be steered to anyy ⁿ in timeT. This paper presents a geometric characterization of this property in the case in which there are constraints on the values which the control maps can assume. A necessary and sufficient condition to get instant controllability (i.e., complete controllability for anyT>0) is also derived. This condition generalizes the well-known Kalman condition to the constrained case.