Solution of an extremal problem for sets using resultants of polynomials

A new, short proof is given of the following theorem of Bollobás: LetA ₁,..., A_h andB ₁,..., B_h be collections of sets with _i ¦A _i¦=r,¦B_i¦=s and ¦A _iB_j¦=Ø if and only ifi=j, thenh( _s ^r+s ). The proof immediately extends to the generalizations of this theorem obtained by Frankl, Alon and others.     

Aleksandrov reflection and nonlinear evolution equations,I: The n-sphere and n-ball

We consider the (degenerate) parabolic equationu _t =G(u + ug, t) on then-sphereS ⁿ . This corresponds to the evolution of a hypersurface in Euclidean space by a general function of the principal curvatures, whereu is the support function. Using a version of the Aleksandrov reflection method, we prove the uniform gradient estimate ¦u(·,t)¦ <C, whereC depends on the initial conditionu(·, 0) but not ont, nor on the nonlinear functionG. We also prove analogous results for the equationu _t =G(u +cu, ¦x¦,t) on then-ballB ⁿ , wherec ₂(B ⁿ ).     

Approximation of expected returns and optimal decisions under uncertainty using mean and mean absolute deviation

We consider economic decision problems under uncertainty consisting of choosing an optimal decisionX, so as to maximize to expected value of an objective function depending on a stochastic parameterp. The paper establishes an optimal policy intervalX _A X ¹ X _B, where the boundsX _A,X _B are given in terms of simple parameters of the distribution ofp, in particular the mean, and the mean absolute deviationd=E ¦p– ¦. The convexity assumptions needed to establish such bounds are shown to hold naturally in some classical problems of production under uncertainty.

---

Zusammenfassung Wir betrachten wirtschaftliche Entscheidungsprobleme mit Unsicherheit, in denen eine optimale EntscheidungX so getroffen werden soll, daß der Erwartungswert einer Zielfunktion, abhängig von einem stochastischen Parameterp, maximiert werden soll. In dieser Arbeit wird ein IntervallX _A X ¹ X _B für die optimale Politik angegeben, wobei die SchrankenX _A,X _B durch einfache Größen der Verteilung vonp ausgedrückt werden, im besonderen durch den Mittelwert und die mittlere absolute Abweichungd=E ¦p– ¦. Ferner wird gezeigt, daß die für die Herleitung der Schranken benötigten Konvexitätsannahmen in natürlicher Weise für einige klassische Produktionsprobleme mit Unsicherheit gelten.

---

---

Supported by BARD Project No. I-10-79 and by Technion VPR Fund-Lawrence Deutsch Research Fund.     

Strong monotonicity of operator functions

LetA, B be bounded selfadjoint operators on a Hilbert space. We will give a formula to get the maximum subspace such that is invariant forA andB, and . We will use this to show strong monotonicity or strong convexity of operator functions. We will see that when 0≤A≤B, andB−A is of finite rank,A ^t ≤B ^t for somet>1 if and only if the null space ofB−A is invariant forA.     

Chaos in almost periodic systems

Let be an almost periodic differential equation with a hyperbolic almost periodic solutionu(t) and another hyperbolic solutionv(t) satisfying ¦v(t)–u(t)¦0 as ¦t¦. It is shown that the solutions of such an equation exhibit chaotic behavior.

---

Zusammenfassung Sei eine fastperiodische Differentialgleichung mit einer fastperiodischen hyperbolischen Lösungu(t) und seiv(t) eine weitere hyperbolische Lösung für welche ¦v(t)–u(t)¦0 für ¦t¦. Es wird gezeigt, daß die Differentialgleichung unter diesen Bedingungen chaotisches Verhalten aufweist.

     

Nonlinear one-parametric bottleneck linear programming

We consider the one-parametric linear bottleneck problem min {c (x, t) ¦ x P (t)} where the bottleneck objectivec (x, t):=max {c_j (t) ¦ x_j>0} is minimized subject to linear constraints, i.e. P(t):={x ¦A (t) ·x=b (t), x0}. All coefficients are assumed to be continuous functions of one real parametert which varies in a real intervalS. A method is developed for constructing a partition ofS into subintervals on which either a basis stays optimal or the problem stays infeasible. Finiteness of the partition is due to certain finiteness assumptions on the zeroes of particular combinations of the coefficient functions. Using a lexicographic refinement of the objective function a characterization of the optimality interval of a fixed basis is derived which is independent on explicit information about other bases.

---

Zusammenfassung Es werden einparametrische lineare Engpaßprobleme min {c (x, t) ¦x P (t)} betrachtet, wobei die Engpaßzielfunktionc (x, t):=max {c_j (t) ¦ x_j >0} unter linearen Nebenbedingungen, die durch P(t):={x ¦A (t) ·x=b (t), x0} gegeben sind, minimiert wird. Dabei wird angenommen, daß alle Koeffizienten stetige Funktionen eines reellen Parameterst aus einem IntervallS R sind. Es wird eine Methode entwickelt,S derart in Teilintervalle zu zerlegen, daß entweder eine Basis in solch einem Teilintervall optimal oder das Problem unzulässig bleibt. Die Endlichkeit dieser Partition vonS ergibt sich aus Endlichkeitsvoraussetzungen für die Nullstellen von Funktionen, die sich als gewisse Kombinationen der Koeffizientenfunktionen schreiben lassen. Durch eine lexikographische Verfeinerung der Zielfunktion gelingt es, das Intervall zu charakterisieren, in dem eine feste Basis optimal ist. Diese Charakterisierung ist unabhängig von expliziten Informationen über andere Basen.

     

Lokalkompakte Fastkörper

It is shown that every locally compact, disconnected nearfield (F,) possesses a non-archimedean, discrete valuation ¦ ¦, which induces . The valuation nearringR of ¦ ¦ only has one maximal idealP, and the quotient groupR/P is finite. If the kernelK ofF is infinite and ifE is an infinite subfield ofK, thenR/P may be considered as a right vector space over the residue field of (E, ¦ ¦). Based on this assumption the ramification index and the residual degree are introduced and studied.

---

---

Herrn Professor Helmut Karzel zum 60. Geburtstag     

A remark on blocking sets of almost Rédei type

In [1] it is shown that ifB is a minimum size blocking set in PG(2,p),p prime, such that there is a lineL meetingB in at least s|B|–p–p+45/20 points, thenB/L consists ofp, p + 1 orp + 2 points. It has been known for a long time that for anyp > 2 there is a unique example with ¦B/L¦= p [2]. In [3] the authors prove that ¦B/L¦ =p + 1 can only occur whenp 7. Here we show that if¦B/L¦= p+2, thenp = 3, 5 or 7, and all examples are classical ones. Besides combinatorial arguments we use polynomials over finite fields and a formula that generalizes the Newton formulae relating power sums and elementary symmetric polynomials.Research of the author was supported by OTKA Grants F-016302, T-019367 and COST Grant 3314/96.     

Factoring by Cyclic and Simulated Subsets

Let G be a finite abelian group whose p-component is an elementary p-group for each prime divisor p of ¦G¦. Assume that B, A₁,..., A_n are subsets of G such that each ¦A_i¦ is a prime, ¦B¦ is a product of two primes, and each A_i is either cyclic or simulated. If the product BA₁ ... A_n is direct and is equal to G, then at least one of the factors B, A₁, ..., A_n is periodic.     

The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet

Summary Let X={1,..., a} be the input alphabet and Y={1,2} be the output alphabet. Let X ^t =X and Y ^t =Y for t=1,2,..., X _n = X ^t and Y _n = Y ^t . Let S be any set, C=={w(·¦·¦)s)¦sS} be a set of (a×2) stochastic matrices w(··¦s), and S ^t=S, t=1,..., n. For every s _n =(s ¹,...,s ⁿ ) S ^t define P(·¦·¦s _n)= w(y ^t ¦x ^t ¦s ^t ) for every x _n=x ¹, , x ⁿX _n and every y _n=(y ¹, , y ⁿ)Y _n. Consider the channel C _n ={P(·¦·¦)s _n )¦s _n S _n } with matrices (·¦·¦s), varying arbitrarily from letter to letter. The authors determine the capacity of this channel when a) neither sender nor receiver knows s _n, b) the sender knows s _n, but the receiver does not, and c) the receiver knows s _n, but the sender does not.Research of both authors supported by the U.S. Air Force under Grant AF-AFOSR-68-1472 to Cornell University.     

Relative stability and the strong law of large numbers

Summary LetX ₁,X ₂,..., be i.i.d. random variables andS _n=X ₁+X ₂+. +X _n. In this paper we simplify Rogozin's condition forS _n/B _n ±1for someB _n+, which generalises Hinin's condition for relative stability ofS _n. We also consider convergence of subsequences ofS _n/B _n. As an application of our methods, we extend a result of Chow and Robbins to show thatS _n/B _n±1 a.s. for someB _n + if and only if 0<¦EX¦E¦X¦<+ .     

Ordnungsfunktionen in Miquelschen Möbiusebenen und Ihre Beziehungen zu Algebraischen Anordnungen

In this paper we investigate the relations between the geometrical ordering of a Miquelian Möbius-planeM(K, Q) and the ordering of the underlying field K. Every semi-ordering of K induces an order function ofM(K, Q), and conversely, if ¦k¦ >2, every semi-ordering of K is induced by exactly two ()-normal order functions ofM(K, Q). Moreover the normal order functions correspond to. those semi-orderings > of K for which is Q(x, y) >0 for all (x, y) (K × K){(0, 0)}. Full orderings ofM(K, Q) are defined similar to those in projective geometry.

---

---

Diese Arbeit wurde von der Deutschen Forschungsgemeinschaft gefördert.     

The absolute convergence of weighted sums of dependent sequences of random variables

Summary The sum a _n X _n of a weighted series of a sequence {X _n } of identically distributed (not necessarily independent) random variables (r.v.s.) is a.s. absolutely convergent if for some in 0<1, ¦a _n ¦ < and E¦X _n ¦ < ; if a _n =z ⁿ for some ¦z¦<1 then it suffices that E(log¦X _n ¦)₊<. Examples show that these sufficient conditions are not necessary. For mutually independent {X _n } necessary conditions can be given: the a.s. absolute convergence of X _n z ⁿ (all ¦z¦<1) then implies E(log¦X _n ¦)₊ < , while if the X _n are non-negative stable r.v.s. of index , ¦a _n X _n ¦< if and only if ¦a _n ¦ < .     

On extending Pollard’s theorem for <Emphasis Type="Italic">t</Emphasis>-representable sums

Let t ≥ 1, let A and B be finite, nonempty subsets of an abelian group G, and let $ A\mathop + \limits_i B $ A\mathop + \limits_i B denote all the elements c with at least i representations of the form c = a + b, with a ∈ A and b ∈ B. For |A|, |B| ≥ t, we show that either

Über die Projektivitätengruppen von Semikörperebenen gerader Ordnung

Let S be a finite proper semifield of even order and II the group of projectivities of the projective plane over S.We prove that if S is commutative or of Knuth-type II, III or IV and ¦S¦>16 then consists of even permutations only. On the other hand we give examples of semifields of order 16, 32 and 64 whose corresponding groups contain odd permutations.

---

---

Dieser Artikel entstand als Kurzfassung einer von Hr. Prof. Dr. J. Joussen vergebenen Diplomarbeit.

---

Nicht nur für die Betreuung während der Diplomarbeit, sondern auch für die Hilfe bei der Erstellung dieser Kurzfassung, bin ich Hr. Prof. Dr. J. Joussen sehr dankbar.     

Finite extinction time for some perturbed Hamilton-Jacobi equations

In this paper we study initial value problems likeu _t–R¦u¦^m+u^q=0 in ⁿ× ₊, u(·,0⁺)=u_o(·) in ^N, whereR > 0, 0 <q < 1,m 1, andu _o is a positive uniformly continuous function verifying –R¦u _o¦^m+u ₀ ^q 0 in ^N . We show the existence of the minimum nonnegative continuous viscosity solutionu, as well as the existence of the function t(·) defined byu(x, t) > 0 if 0<t<t (x) andu(x, t)=0 ift t (x). Regularity, extinction rate, and asymptotic behavior of t(x) are also studied. Moreover, form=1 we obtain the representation formulau(x, t)=max{([(u _o(x – t))^1–q –(1–q)t]₊)^1/(1–q): ¦¦R}, (x, t) ₊ ^N+1 .Partially supported by the DGICYT No. 86/0405 project.     

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.     

Some inequalities of the V. A. Markov type

Let B be a domain in the complex plane, let p_n(z) and P_n(z) be polynomials of degree n where the zeros of P_n(z) lie in , let(z) be a finite function,(z) 0, z . We consider the problem of estimating from above the functions L[p_n(z)]=(z)p_n(z) – wp_n(z), z , if ¦p_n(z)¦ ¦P_n(z)¦ for zB. Under some very general conditions on B, z, (z), and w we prove the inequality ¦L[p_n(z)]¦ ¦L[P_n(z)]¦.Translated from Matematicheskie Zametki, Vol. 3, No. 4, pp. 431–440, April, 1968.     

Radii of convexity and close-to-convexity of certain integral representations

Strict upper bounds are determined for ¦s(z)¦, ¦Re s(z)¦, and ¦Im s(z) ¦ in the class of functions s(z)=a _nzⁿ+a_n+1zⁿ⁺¹+... (n¹) regular in ¦z¦<1 and satisfying the condition ¦u (₁) –u (₂) ¦K¦ ₁- ₂¦, where U()=Re s (eⁱ ), K>0, and ₁ and ₂ are arbitrary real numbers. These bounds are used in the determination of radii of convexity and close-to-convexity of certain integral representations.Translated from Matematicheskie Zametki, Vol. 7, No. 5, pp. 581–592, May, 1970.The author wishes to thank L. A. Aksent'ev for his guidance in this work.     

Sums of linear operators of parabolic type: a priori estimates and strong solutions

Summary We study the equation (A – ) x + (B–)x=y, with unknown x, in a Banach space X. y Xis the datum, > 0, A and B are linear closed unbounded operators in X with domains D_A, D_B. In the non commutative case, under assumptions already considered in the literature (see [7]), we show that for large values of any solution x D_A D_B satisfies an a priori estimate ¦|x¦|c^–1¦|y||and we prove that for any y X there exists a unique strong solution x, i.e. there exist x_nD_A D_B such that x_n x, (A–) x_n+(B–) x_ny in X. We also study regularity properties of strong solutions and we show that they belong to suitable interpolation spaces between D_A (or D_B) and X.