Infinitesimal obstructions to weakly mixing

Let ^t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M ⁿ , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d ^t and, for each x M, we define a smooth real function _x (t) : (1 + _i (t)), where the _i(t) are the eigenvalues of AA ^T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d^2t , restricted to v at the point _x ^-t M ⁿ.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that _x ^' (t) 0 for all x M and real t; then, if _x ^t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.     

The Lattice of Interpretability Types of Cantor Varieties

For integers 1 m < n, a Cantor variety with m basic n-ary operations _i and n basic m-ary operations _k is a variety of algebras defined by identities _k(₁( ), ... , _m( )) = _k and i(₁( ), ... ,_n( )) = y _i, where = (x ₁., ... , x _n) and = (y ₁, ... , y _m). We prove that interpretability types of Cantor varieties form a distributive lattice, , which is dual to the direct product ₁ × ₂ of a lattice, ₁, of positive integers respecting the natural linear ordering and a lattice, ₂, of positive integers with divisibility. The lattice is an upper subsemilattice of the lattice of all interpretability types of varieties of algebras.     

Das Entscheidungsproblem der Klasse von Formeln,die höchstens zwei Primformeln enthalten

For classes of formulas containing at most two atomic sub-formulas the decision problem of first-order predicate logic with identity and function variables is treated. The class of all formulas of the form Q ( ), where Q is prefix and , are atomic formulas or negated atomic formulas, is decidable with respect to satisfiability. The class of all formulas of the form x₁...x₆( ) is a conservative reduction class and therefore is undecidable.

---

---

Dieser Aufsatz beruht auf Resultaten der Dissertation [13], die der Universität München im Sommersemester 1976 vorgelegt wurde.     

A general minimax theorem

This paper is concerned with minimax theorems for two-person zero-sum games (X, Y, f) with payofff and as main result the minimax equality inf supf (x, y)=sup inff (x, y) is obtained under a new condition onf. This condition is based on the concept of averaging functions, i.e. real-valued functions defined on some subset of the plane with min {x, y}< (x, y)x, y} forx y and (x, x)=x. After establishing some simple facts on averaging functions, we prove a minimax theorem for payoffsf with the following property: Forf there exist averaging functions and such that for any x₁, x₂ X, > 0 there exists x₀ X withf (x₀, y) > f (x₁,y),f (x₂,y))– for ally Y, and for any y₁, y₂ Y, > 0 there exists y₀ Y withf (x, y₀) (f (x, y₁),f (x, y₂))+. This result contains as a special case the Fan-König result for concave-convex-like payoffs in a general version, when we take linear averaging with (x, y)=x+(1–)y, (x, y)=x+(1–)y, 0 <, < 1.Then a class of hide-and-seek games is introduced, and we derive conditions for applying the minimax result of this paper.

---

Zusammenfassung In dieser Arbeit werden Minimaxsätze für Zwei-Personen-Nullsummenspiele (X, Y,f) mit Auszahlungsfunktionf behandelt, und als Hauptresultat wird die Gültigkeit der Minimaxgleichung inf supf (x, y)=sup inff (x, y) unter einer neuen Bedingung an f nachgewiesen. Diese Bedingung basiert auf dem Konzept mittelnder Funktionen, d.h. reellwertiger Funktionen, welche auf einer Teilmenge der Ebene definiert sind und dort der Eigenschaft min {x, y} < < (x, y)x, y} fürx y, (x, x)=x, genügen. Nach der Herleitung einiger einfacher Aussagen über mittelnde Funktionen beweisen wir einen Minimaxsatz für Auszahlungsfunktionenf mit folgender Eigenschaft: Zuf existieren mittelnde Funktionen und, so daß zu beliebigen x₁, x₂ X, > 0 mindestens ein x₀ X existiert mitf (x₀,y) (f (x ₁,y),f (x₂,y)) – für alley Y und zu beliebigen y₁, y₂ Y, > 0 mindestens ein y₀ Y existiert mitf (x, y₀) (f (x, y₁),f (x, y ₂))+ für allex X. Dieses Resultat enthält als Spezialfall den Fan-König'schen Minimaxsatz für konkav-konvev-ähnliche Auszahlungsfunktionen in einer allgemeinen Version, wenn wir lineare Mittelung mit (x, y)=x+(1–)y, (x, y)= x+(1–)y, 0 <, < 1, betrachten.Es wird eine Klasse von Suchspielen eingeführt, welche mit dem vorstehenden Resultat behandelt werden können.

     

On the equation of similar profiles

Summary Considerf+ ff+ (1–f²)+ f=0 together with the boundary conditionsf(0)=f(0)=0,f ()=1. If=–1,>0, arbitrary there is at least one solution which satisfies 0<f<1 on (0, ). By the additional conditionf>0 on (0, ) or, alternately 0<1, the uniqueness of the solution is demonstrated.If=1,<0, arbitrary the existence of solutions for which –1<f<0 in some initial interval (0,t) and satisfying generallyf>1 is established. In both problems, bounds forf (0) and qualitative behavior of the solutions are shown.

---

Sommario Si consideri il problema definito dall'equazionef+ f f+ (1–f²)+ f=0 e dalle condizioni al contornof(0)=f (0)=0,f()=1. Assumendo=–1,>0, arbitrario si dimostra che esiste almeno una soluzione che soddisfa 0<f<1 nell'intervallo (0, ). Se in aggiunta si ipotizzaf>0 in (0, ), oppure 0<=1, l'unicità délia soluzione è assicurata.Successivamente si considéra il problema di valori al contorno con=1,<0, arbitrario. In questo caso esiste un'intera classe di soluzioni che soddisfano –1<f<0 in un intorno dell'origine e tali chef>1, in generale.Di detti problemi viene studiato il comportamento délle soluzioni e vengono determinate dalle maggiorazioni e minorazioni del valoref(0).

     

Einige Aspekte in der Zuordnungstheorie

Zusammenfassung Gegeben seien endliche MengenX, Y undZ X × Y, Z _x ={y¦(x,y) Z},Z _y ={x¦(x,y) Z}.Man nenntA X (bzw.B Y)zuordenbar, wenn es eine Injektion:A Y (bzw.: B X) mit(x) Z _x (bzw.(y) Z _y ) gibt, und (A, B) mit #A=#B > 0 einZuordnungspaar, wenn eine Bijektionf:A B mitf(x)Z _x B (bzw.f ^–1 (y) Z _y A) existiert. Die Bijektionf heißtZuordnungsplan fürA, B.In der vorliegenden Arbeit werden Fragen nach der Existenz von optimal zuordenbaren Mengen und optimalen Zuordnungspaaren behandelt, wenn man auf den MengenX undY Ordnungen vorgibt, wobei auch Nebenbedingungen berücksichtigt werden. In manchen Fällen lassen sich anhand der Beweise Zuordnungspläne oder ihre Berechnungsvorschrift explizit angeben.Zum Schluß werden die Aussagen an konkreten, dem Bereich der Wirtschaftswissenschaften entnommenen Beispielen erläutert.

---

Summary LetX, Y be finite sets andZ X × Y, Z _x ={y¦(x,y) Z},Z _y ={x¦(x,y)Z}. A X (resp.B Y) is calledassignable if there is an injection: A Y (resp.: B X) with (x) Z _x (resp.(y) Z _y ), (A, B) with #A=#B > 0 anassigned pair if there is a bijection f:A B withf (x) Z _x B (resp.f ^–1(y) Z _y A). The bijectionf is called aplan forA andB.In this paper problems are discussed concerning the existence of optimal assignable sets and optimal assigned pairs ifX andY are totally ordered, additional constraints are also considered. In some cases the proofs give explicit constructions of plans. The results are illustrated by application to problems occurring in Operations Research.

---

---

Diese Arbeit ist mit Unterstützung des Sonderforschungsbereiches 72 an der Universität Bonn entstanden.     

Sensitivity analysis of the greatest eigenvalue of a symmetric matrix via the ɛ-subdifferential of the associated convex quadratic form

LetA(·) be ann × n symmetric affine matrix-valued function of a parameteruR ^m , and let (u) be the greatest eigenvalue ofA(u). Recently, there has been interest in calculating (u), the subdifferential of atu, which is useful for both the construction of efficient algorithms for the minimization of (u) and the sensitivity analysis of (u), namely, the perturbation theory of (u). In this paper, more generally, we investigate the Legendre-Fenchel conjugate function of (·) and the -subdifferential (u) of atu. Then, we discuss relations between the set (u) and some perturbation bounds for (u).The author is deeply indebted to Professor J. B. Hiriart-Urruty who suggested this study and provided helpful advice and constant encouragement. The author also thanks the referees and the editors for their substantial help in the improvement of this paper.     

Regressions and monotone chains II: The poset of integer intervals

A regressive function (also called a regression or contractive mapping) on a partial order P is a function mapping P to itself such that (x)x. A monotone k-chain for is a k-chain on which is order-preserving; i.e., a chain x ₁<...ksuch that (x ₁)...(x_k). Let P _nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P _nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x ^t(x,j–1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) < f(K) <t( + _k, k) , where _k 0 as k. Alternatively, the largest k such that every regression on P _nis guaranteed to have a monotone k-chain lies between lg^*(n) and lg^*(n)–2, inclusive, where lg^*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element.     

Best approximations of continuous functions by spline functions

An investigation of the approximation on [0, 1] of functionsf (x) by spline functions s(f,; x) of degree 2r-1 and of deficiency r (r>1) depending on the vector function = ₁ (x),..., _r-1(x) and interpolatingf (x) at fixed points. For the optimal choice of the vector ₀, exact estimates are obtained of the norms f(x)-s (f, ₀; x)_C[0,1] and f (x)-s (f, ₀; x)_{L[0, 1]} on the function classes H Translated from Matematicheskie Zametki, Vol. 8, No. 1, pp. 41–46, July, 1970.In conclusion we would like to thank N. P. Korneichuk for suggesting this problem and for his valuable advice.     

Die Verteilung der schlichten Funktionen in einem Funktionenraum

We consider the set of regular functions . We construct a Borel measure and a class of outer measures _h onH. With these and _h we show that: (HS)=0 and _h (HS)=0, (S is the set of normed univalent functions). From _h (HS)=0 follows—forh=t —that the Hausdorff—Billingsley-dimension ofHS is zero.     

Some Conditions for a C0-Semigroup to Be Asymptotically Finite-Dimensional

We study the class of bounded C ₀-semigroups T=(T _t ) _t0 on a Banach space X satisfying the asymptotic finite dimensionality condition: codim X ₀(T)<, where X ₀(T):={x X:lim_t T _t x=0}. We prove a theorem which provides some necessary and sufficient conditions for asymptotic finite dimensionality.     

OnC 2-diffeomorphisms of the circle which are of type III1

For every irrational number [0, 1) which is not of constant type we construct aC ²-diffeomorphism of the circle with rotation number which is of type III₁. This diffeomorphism can be chosen arbitrarily close to the rotationR . Our methods also allow us to construct, for every Liouville number [0, 1), aC -diffeomorphism of the circle with rotation number which is of type III₁.     

Stochastic algorithms with armijo stepsizes for minimization of functions

Stochastic algorithms for optimization problems, where function evaluations are done by Monte Carlo simulations, are presented. At each iteratex _i, they draw a predetermined numbern(i) of sample points from an underlying probability space; based on these sample points, they compute a feasible-descent direction, an Armijo stepsize, and the next iteratex _i+1. For an appropriate optimality function , corresponding to an optimality condition, it is shown that, ifn(i) , then (x _i) 0, whereJ is a set of integers whose upper density is zero. First, convergence is shown for a general algorithm prototype: then, a steepest-descent algorithm for unconstrained problems and a feasible-direction algorithm for problems with inequality constraints are developed. A numerical example is supplied.     

Estimates of Entire Functions of Exponential Type Less than π in Terms of Logarithmic Sums over Real Duffin and Schaeffer Sequences

We give uniform estimates of entire functions of exponential type less than having sufficiently small logarithmic sums over real sequences { _n } satisfying | _n –n|L and _n+1– _n for fixed positive constants L and . We thereby generalize results about logarithmic sums over the set of integers and so-called relatively h-dense sequences.     

Derivatives of the Spectral Function and Sobolev Norms of Eigenfunctions on a Closed Riemannian Manifold

Let e(x, y, ) be the spectral function and the unit spectral projection operator, with respect to the Laplace–Beltrami operator on a closed Riemannian manifold M. We generalize the one-term asymptotic expansion of e(x, x, ) by Hörmander (Acta Math. 88 (1968), 341–370) to that of _{x y} e(x,y,)| _x=y for any multiindices , in a sufficiently small geodesic normal coordinate chart of M. Moreover, we extend the sharp (L ²,L ^p) (2 p) estimates of by Sogge (J. Funct. Anal. 77 (1988), 123–134; London Math. Soc. Lecture Note Ser. 137, Cambridge University Press, Cambridge, 1989; Vol. 1, pp. 416–422) to the sharp (L ², Sobolev L ^p) estimates of .     

Familien komplexer räume zu gegebenen infinitesimalen deformationen

Let M be a domain in the complex plane, :XM a flat family of reduced complex spaces, (X_o, _o) the fibre over a point OM, and x_o the sheaf of (1,O)-forms over X_o. The family defines an element (Ext¹ (_Xo, _o))_x for every point xX. We prove: If (X_o, _o) is a normal complex space, x a point in X_o such that (Ext² (_Xo, _o))_x=O, then for each infinitesimal deformation (Ext¹ (_Xo, _o))_x there exists a flat reduced family with =. This statement is analogous to a result of KODAIRA-NIRENBERG-SPENCER in the theory of deformations of compact complex manifolds.     

Epsilon efficiency

This paper considers the extension of -optimality for scalar problems to vector maximization problems, or efficiency problems, which havem objective functions defined on a set .It is shown that the natural extension of the scalar -optimality concepts [viz, given >0, given a solution setS, ifxS there exists an efficient solutiony with f(x)–f(y), and given an efficient solutiony, there exists anxS with f(x)–f(y)] do not hold for some methods used. Six concepts of -efficient sets are introduced and examined, to a very limited extent, in the context of five methods used for generating efficient points or near efficient points.In doing so, a distinction is drawn between methods in which the surrogate optimizations are carried out exactly, and those where terminal -optimal solutions are obtained.The author would like to thank the referees whose thoroughness was extremely helpful for the revised paper.     

OnU ϕ-sets of trigonometric integrals

, (t) >0 E(–, +),E<, , ¦f(t)¦ (t) xE, f(t)=0 (–, +).     

Approximate first-order and second-order directional derivatives of a marginal function in convex optimization

Given a convex functionf: ^p × ^q (–, +], the marginal function is defined on ^p by (x)=inf{f(x, y)|y ^q }. Our purpose in this paper is to express the approximate first-order and second-order directional derivatives of atx ₀ in terms of those off at (x ₀,y ₀), wherey ₀ is any element for which (x ₀)=f(x ₀,y ₀).The author is indebted to one referee for pointing out an inaccuracy in an earlier version of Theorem 4.1.     

Lipschitz and darbo conditions for the superposition operator in ideal spaces

Summary In this paper we give necessary and sufficient conditions for the superposition operator Fx(s)=f(s, x(s)) to satisfy a Lipschitz condition Fx₁ - Fx₂kx₁ - x₂ or a Darbo condition (FN)k(N) in ideal spaces of measurable functions, where is the Hausdorff measure of noncompactness. Moreover, we characterize a large class of spaces in which the above mentioned two conditions are equivalent.

---

Sunto In questo lavoro diamo delle condizioni necessarie e sufficienti perchè l'operatore di sovrapposizione Fx(s)=f (s, x(s)) soddisfi alla condizione di Lipschitz Fx₁–Fx₂ kx₁–x₂ o quella di Darbo (FN)k(N) in spazi ideali di funzioni misurabili, ove è la misura di non compattezza di Hausdorff. Inoltre, caratterizziamo un'ampia classe di spazi in cui le suddette due condizioni sono equivalenti.