Conjugation for polynomial mappings

We consider Keller's functions, namely polynomial functionsf:C ⁿ C ⁿ with detf(x)=1 at allx C ⁿ. Keller conjectured that they are all bijective and have polynomial inverses. The problem is still open.Without loss of generality assumef(0)=0 andf'(0)=I. We study the existence of certain mappingsh , > 1, defined by power series in a ball with center at the origin, such thath(0)=I andh (f(x))=h (x). So eachh conjugates f to its linear part I in a ball where it is injective.We conjecture that for Keller's functionsf of the homogeneous formf(x)=x +g(x),g(sx)=s ^dg(x),g(x)ⁿ=0,xC ⁿ,sC the conjugationh for f is anentire function.     

Morera type theorems on the unit disc

, . . : , , , , .     

Some extensions of the Hewitt-Savage zero-one law

Summary Let denote the class of infinite product probability measures = ₁× ₂× defined on an infinite product of replications of a given measurable space (X, A), and let denote the subset of for which (A) =0 or 1 for each permutation invariant event A. Previous works by Hewitt and Savage, Horn and Schach, Blum and Pathak, and Sendler (referenced in the paper) discuss very restrictive sufficient conditions under which a given member , of belongs to . In the present paper, the class is shown to possess several closure properties. E.g., if and _{0 n} for some n 1, then ₀× ₁× ₂×.... While the current results do not permit a complete characterization of they demonstrate conclusively that is a much larger subset of than previous results indicated. The interesting special case X={0,1} is discussed in detail.Research supported by the National Science Foundation under grant No. MCS75-07556     

Untere und obere Schranken für den tiefsten Eigenwert der elastisch gestützten Membran

Zusammenfassung Es werden untere und obere Schranken für den tiefsten Eigenwert ₁() der elastisch gestützten schwingenden Membran hergeleitet. Die elastische Bindung der Membran am Rande wird durch charakterisiert, und wird als Parameter betrachtet.Die Verwendung des klassischen Rayleigh-Prinzipes liefert obere Schranken, mit Hilfe eines konvexen FunktionalsJ() erhält man obere und untere Schranken. Eine Zerlegungsmethode endlich gibt eine untere Schranke für ₁().

---

Summary This article is concerned with the determination of upper and lower bounds for the lowest eigenvalue ₁() of the elastically supported vibrating membrane. The elastic support on the boundary is characterized by which is regarded as a parameter.The classical Rayleigh-Principle gives upper bounds. The use of a convex functionalJ() yields upper and lower bounds for ₁(). A method of decomposition leads to a lower bound for ₁().

---

---

Neu-Technikum, Buchs SG     

On term by term dyadic differentiability of Walsh series

. . . . : {ja _j },j=1,2,... — , f(x) , , f ^[1](x) — f .     

Positive Solutions for a Singular Nonlinear Problem on a Bounded Domain in R 2

For a bounded regular Jordan domain in R ², we introduce and study a new class of functions K() related on its Green function G. We exploit the properties of this class to prove the existence and the uniqueness of a positive solution for the singular nonlinear elliptic equation u+(x,u)=0, in D(), with u=0 on and uC(), where is a nonnegative Borel measurable function in ×(0,) that belongs to a convex cone which contains, in particular, all functions (x,t)=q(x)t ^–,>0 with nonnegative functions qK(). Some estimates on the solution are also given.     

Cross-cuts in the power set of an infinite set

In the power setP(E) of a setE, the sets of a fixed finite cardinalityk form across-cut, that is, a maximal unordered setC such that ifX, Y E satisfyXY, X someX inC, andY someY inC, thenXZY for someZ inC. ForE=, ₁, and ₂, it is shown with the aid of the continuum hypothesis thatP(E) has cross-cuts consisting of infinite sets with infinite complements, and somewhat stronger results are proved for and ₁.The work reported here has been partially supported by NSERC Grant No. A8054.     

On the acceleration of limit periodic continued fractions

Summary A continued fraction (c.f.)K(a _n /1) is called limit periodic if . Fora anda(–,–1/4],a0, Thron-Waadeland (1980) examined a modification of a limit periodic c.f. for accelerating the convergence. This acceleration remains modest if thea _n converge only logarithmically. Thus it is proposed to apply an Euler summability method to the series equivalent to the c.f. Properties of the equivalent function are derived. These properties are used for choosing appropriate parameters for the summability method such that a considerable acceleration can be expected even if thea _n converge logarithmically.Dedicated to Prof. F.L. Bauer on the occasion of his 60th birthday     

A functional equation of Ih-Ching Hsu

Summary A recent note of Ih-Ching Hsu poses an unsolved problem, to wit, the general solution of the functional equation g(x₁, x₂) + g(₁(x₁), ₂(x₂)) = g(x₁, ₂(x₂)) + g(₁(x₁),x₂), where the _i are given functions. This short paper obtains the general solution. It gives conditions which imply that anycontinuous solution has form g₁(x₁) + g₂(x₂).     

Linear programming by minimizing distances

To solve the linear program (LP): minimizec ^T l subject toA l+b0, for ann×d-matrixA, ann-vectorb and ad-vectorc, the positive orthantS and the planeE(t) are defined by S={(x₁,x)ⁿ⁺¹ ¦(x₁,x)0}, E(t)={(x₁,x)ⁿ⁺¹¦x₁=–c ^c l+t, x=Al+b}. First a geometric algorithm is given to determine d(E(t),S) for fixedt, where d(·,·) denotes euclidean distance. This algorithm is used to construct a second algorithm to find the minimalt with E(t) S , and thus solve LP. It is shown that all algorithms are finite.     

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.

     

Une généralisation d'un résultat de J. Aczél et M. Hosszú sur l'équation de translation

Résumé En généralisant un résultat de J. Aczél et M. Hosszú on donne des conditions nécessaires et suffisantes pour qu'une solution de l'équation de translationF(F(, x), y) = F(, xy), oùF: × G , est un ensemble arbitraire,G forme un groupe, soit de la formeF(, x) = f ^–1(f()·1(x)), oùf est une bijection de au groupeG ₁ isomorphe avecG et 1 est un homomorphisme deG àG ₁. On considère aussi le cas oùG forme un espace vectoriel sur le corps des nombres rationels.Si est un intervalle ayant plus qu'un point etG = R ^m avec l'addition comme l'opération on trouve des conditions pour que la fonction continueF soit de la formeF(, x ₁,, x _m ) =f ^–1(f() + c ₁ x ₁ + +c _m x _m ), oùf est une homéomorphie de àR et (c ₁,,c _m ) R ^m .

---

     

Zur Interpolation und Integration differenzierbarer periodischer Funktionen

Summary Letx ₀<x ₁<...<x _n–1<x ₀+2 be nodes having multiplicitiesv ₀,...,v _n–1, 1v _k r (0k<n). We approximate the evaluation functional ,x fixed, and the integral respectively by linear functionals of the form and determine optimal weights for the Favard classesW _r C ₂. In the even case of optimal interpolation these weights are unique except forr=1,x(x _k +x _k–1)/2 mod 2. Moreover we get periodic polynomial splinesw _{k, j} (0k<n, 0j<v _k ) of orderr such that are the optimal weights. Certain optimal quadrature formulas are shown to be of interpolatory type with respect to these splines. For the odd case of optimal interpolation we merely have obtained a partial solution.

Bojanov hat in [4, 5] ähnliche Resultate wie wir erzielt. Um Wiederholungen zu vermeiden, werden Resultate, deren Beweise man bereits in [4, 5] findet, nur zitiert     

On a Test Statistic for Linear Trend

Let {W(s)} _s 0 be a standard Wiener process. The supremum of the squared Euclidian norm Y (t)², of the R²-valued process Y(t)=(1/t W(t), {12/t ³ int_{0 t} s dW (s)– {3/t} W(t)), t [, 1], is the asymptotic, large sample distribution, of a test statistic for a change point detection problem, of appearance of linear trend. We determine the asymptotic behavior P {sup _t [, 1] Y(t)² > u as u , of this statistic, for a fixed (0,1), and for a moving = (u) 0 at a suitable rate as u . The statistical interest of our results lie in their use as approximate test levels.     

On the lowest eigenvalue of the Laplacian for the intersection of two domains

IfA andB are two bounded domains in _n and (A), (B) are the lowest eigenvalues of – with Dirichlet boundary conditions then there is some translate,B _x, ofB such that (AB _x)<(A)+(B). A similar inequality holds for .There are two corollaries of this theorem: (i) A lower bound for sup _x {volume (AB _x)} in terms of (A), whenB is a ball; (ii) A compactness lemma for certain sequences inW ^1,p ( _n ).Work partially supported by U.S. National Science Foundation grant PHY-8116101 A01. AMS(MOS) Classification: 35P15     

On the uniform (C, 1)-summability of Fourier series and integrability of series with respect to multiplicative orthonormal systems

H (G), f(g)H (G) , (, 1)- OHMC G. , OHMC, A. H. . , . , OHMC, lim supp _n=, , ,n .. . , 117 234 . . -      

The odd ordér analogue of Dempwolff's B-group problem

Let be a translation plane of odd order p^2R for p a prime. Let admit at least two p-groups, B_i, i=1, 2, B₁B₂ of orders > p^R/2 which fix Baer subplanes _i, i = 1,2, ₁₂ pointwise. It is shown that under these assumptions must be a Hall plane.     

Rates of convergence for the stability of large order statistics

Forr1 and eachnr, letM _nr be therth largest ofX ₁,X ₂, ...,X _n , where {X _n ,n1} is an i.i.d. sequence. Necessary and sufficient conditions are presented for the convergence of for all >0 and some –1, where {a _n } is a real sequence. Furthermore, it is shown that this series converges for all >–1, allr1 and all >0 if it converges for some >–1, somer1 and all >0.     

A Combined Algorithm for Fractional Programming

In this paper, we present an outer approximation algorithm for solving the following problem: max _xS {f(x)/g(x)}, where f(x)0 and g(x)>0 are d.c. (difference of convex) functions over a convex compact subset S of R ⁿ . Let ()=max _xS (f(x)–g(x)), then the problem is equivalent to finding out a solution of the equation ()=0. Though the monotonicity of () is well known, it is very time-consuming to solve the previous equation, because that maximizing (f(x)–g(x)) is very hard due to that maximizing a convex function over a convex set is NP-hard. To avoid such tactics, we give a transformation under which both the objective and the feasible region turn to be d.c. After discussing some properties, we propose a global optimization approach to find an optimal solution for the encountered problem.     

Interpolation of linear operators in the Köthe dual spaces

Summary In this paper we investigate when the Köthe dual spaces Y and X are interpolation spaces with respect to couples of the Köthe dual spaces (Y₀, Y₁) and (X₀, X₁), respectively, where X and Y are interpolation spaces with respect to given couples (X₀,X₁) and (Y₀, Y₁ of Banach function spaces.