Morera type theorems on the unit disc

, . . : , , , , .     

On an application of infinitely divisible distributions to quadrature problems

— - , .     

Ultrafilter translations

We develop a method for extending results about ultrafilters into a more general setting. In this paper we shall be mainly concerned with applications to cardinality logics. For example, assumingV=L, Gödel's Axiom of Constructibility, we prove that if > then the logic with the quantifier there exist many is (,)-compact if and only if either is weakly compact or is singular of cofinality<. As a corollary, for every infinite cardinals and , there exists a (,)-compact non-(,)-compact logic if and only if either < orcf<cf or < is weakly compact.Counterexamples are given showing that the above statements may fail, ifV=L is not assumed.However, without special assumptions, analogous results are obtained for the stronger notion of [,]-compactness.     

Minimax filtration of linear transformations of stationary sequences

We will consider the problem of determining a linear, mean-square optimal estimate of the transformation of a stationary random sequence (k) with density f() from observations of the sequence (k) + n(k) withk0, where (k) is a stationary sequence not correlated with (k) with density g(). The least favorable spectral densities and minimax (robust) spectral characteristics of an optimal estimate A for different classes of densities are found.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 43, No. 1, pp. 92–99, January, 1991.     

Phragmén-Lindelöf theorems for second-order quasilinear elliptic equations

Analogues are formulated of the well-known, in the theory of analytic functions, Phragmen-Lindelöf theorem for the gradients of solutions of a broad class of quasilinear equations of elliptic type. Examples are given illustrating the accuracy of the results obtained for the gradients of solutions of the equations of the form div(|U|^–2u)=f(x, u, u), where f(x, u, u) is a function locally bounded in ²ⁿ⁺¹. f(x, 0, u)=0, uf(x, u, u) c¦u¦1+q(1+ ¦u|), > 1, c > 0, q > 0, is an arbitrary real number, and n >- 2. The basic role in the technique employed in the paper is played by the apparatus of capacitary characteristics.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 44, No. 10, pp. 1376–1381, October, 1992.The author sincerely appreciates E. M. Landis's permanent attention and numerous useful discussions.     

Sum of Divisors in a Ring of Gaussian Integers

We construct an asymptotic formula for a sum function for _a (), where _a () is the sum of the ath powers of the norms of divisors of the Gaussian integer on an arithmetic progression ₀ (mod ) and in a narrow sector ₁ arg < ₂. For this purpose, we use a representation of _a (n) in the form of a series in the Ramanujan sums.     

Converse theorems for multidimensional Kantorovich operators

L _p [0, l]. . . - .

---

---

Supported by National Science Foundation, Zhejiang Provincial Science Foundation of China, and Alexander von Humboldt Foundation of Germany.     

Estimation of the Coefficient of Multiple Determination

Assume that we have iid observations on the random vector X = (X ,...,X ) following a multivariate normal distribution N (,) where both R and (p.d.) are unknown. Let denote the multiple correlation coefficient between X and (X ,...,X ). The parameter = , called the multiple coefficient of determination, indicates the proportion of variability in X explained by its best linear fit based on (X ,..., X ). In this paper we consider the point estimation of under the ordinary squared error loss function. The usual estimators (MLE, UMVUE) have complicated risk expressions and hence it is quite difficult to get exact decision-theoretic results. We therefore follow the asymptotic decision theoretic approach (as done by Ghosh and Sinha (1981, Ann. Statist., 9, 1334-1338)) and study Second Order Admissibility of various estimators including the usual ones.     

The Parameters of Bipartite Q-polynomial Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Suppose ₀, ₁, ..., _D is a Q-polynomial ordering of the eigenvalues of . This sequence is known to satisfy the recurrence _{i – 1} – _i + _{i + 1} = 0 (0 > i > D), for some real scalar . Let q denote a complex scalar such that q + q ^–1 = . Bannai and Ito have conjectured that q is real if the diameter D is sufficiently large.We settle this conjecture in the bipartite case by showing that q is real if the diameter D 4. Moreover, if D = 3, then q is not real if and only if ₁ is the second largest eigenvalue and the pair (, k) is one of the following: (1, 3), (1, 4), (1, 5), (1, 6), (2, 4), or (2, 5). We observe that each of these pairs has a unique realization by a known bipartite distance-regular graph of diameter 3.     

Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen

Ohne Zusammenfassung Zusatz bei der Korrektur: Ein vollständiger und korrekter Beweis für die Entscheidbarkeit der eingangs angeführten Aanderaaschen Klasse ((0, ), (, , ...)) erscheint demnächst im JSL (S.O. Aanderaa/H.R.Lewis: Prefix classes of Krom formulas). Ebendort wird auch die Reduktionstypeneigenschaft für ((0, ), (0, 0, )) und ((0, )), (0, 0, )) nachgewiesen, während ((0, ), (, )) sich als entscheidbar herausgestellt hat (s. E. Börger: Eine entscheidbare Klasse von Kromformeln. ZMLG 19 (1973), 117–120.) Der Kromsche Reduktionstyp konnte mittlerweile einerseits zu ((0, ), (0, 4)) verschärft werden (s. D. Rödding, E. Börger: The undecidability of (0, 4)-formulae with binary disjunctions, vorgetragen auf dem Logic Coll. Bristol 1973, ein abstract erscheint im JSL), andererseits kündigt H.R.Lewis die Reduktionstypeneigenschaft für ((0, ), (0, 1)) an (s. H.R.Lewis: Krom formulas with one dyadic predicate letter. Notices AMS 20, 5 (1973) A-500, abstr. no. 73T-E78.)Dieser Aufsatz geht aus der Dissertation [2] hervor, die dem Fachbereich Mathematik der Mathematisch-Naturwissenschaftlichen Fakultät der Universität Münster im Sommersemester 1971 vorgelegt worden ist. Die Ergebnisse stammen aus dem Wintersemester 1970/71. Eine Ankündigung der hauptsächlichen Resultate ist in den Notices of the American Mathematical Society 19, 2 (1972) A-333 unter der abstract no. * 72T-E24 erschienen.     

A certain class of functions that are univalent in an annulus

In the class F₁ of functions f(), regular and univalent in the annulus ={<||<1} and satisfying the conditions ¦f()¦ < 1 and f() 0 for , ¦f()¦=1 ¦¦=1, for f(l)=1, one finds the set of the values D(A)=f(A): f for an arbitrary fixed point A. One makes use of the method of variations and certain facts from the theory of the moduli of families of curves.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 144, pp. 82–92, 1985.     

On convergence and summability of Fourier series

. , , –1<<0. .

---

---

The present work was written on the basis of two earlier works received byAnalysis Mathematica on January 16, 1979, and July 20, 1979.     

On the asymptotic and invariantσ-algebras of random walks on locally compact groups

Summary Consider a random walk of law on a locally compact second countable groupG. Let the starting measure be equivalent to the Haar measure and denote byQ the corresponding Markov measure on the space of pathsG . We study the relation between the spacesL (G , ^a ,Q) andL (G , ⁱ ,Q) where ^a and ⁱ stand for the asymptotic and invariant -algebras, respectively. We obtain a factorizationL (G , ^a ,Q) L (G , ⁱ ,Q)L (C) whereC is a cyclic group whose order (finite or infinite) coincides with the period of the Markov shift and is determined by the asymptotic behaviour of the convolution powers ⁿ.     

Stellare Abänderungen und Schälbarkeit von Komplexen und Polytopen

Brugesser and Mani proved that the boundary-complex of a convex polytope can be shelled. This result lead to McMullen's proof of the Upper-bound-conjecture. We show that the shellability of complexes has a close connection to the theory of stellar operations. Several results on special shelling procedures and on non-shellable complexes are obtained.     

Duality for nonconvex optimization and its applications

. . , .     

Nonnegative Hall Polynomials

The number of subgroups of type and cotype in a finite abelian p-group of type is a polynomialg with integral coefficients. We prove g has nonnegative coefficients for all partitions and if and only if no two parts of differ by more than one. Necessity follows from a few simple facts about Hall-Littlewood symmetric functions; sufficiency relies on properties of certain order-preserving surjections that associate to each subgroup a vector dominated componentwise by . The nonzero components of (H) are the parts of , the type of H; if no two parts of differ by more than one, the nonzero components of – (H) are the parts of , the cotype of H. In fact, we provide an order-theoretic characterization of those isomorphism types of finite abelian p-groups all of whose Hall polynomials have nonnegative coefficients.     

Kahl bewertete Ringe in der nichtarchimedischen Analysis

An integral domain R provided with a non-archimedean valuation | | is called bald (kahl), if there exists a real number , 0<<1, such that the value set |R| does not meet the open interval (, 1). Bald rings are important in non-archimedean analysis because the method of iteration (classical and well known for fields with discrete valuation) is convergent in these rings. In this note it is shown that each valuated field contains big bald subrings, more precisely:Let K be a completely valuated field and let denote the valuation ring. Let {a}₁ be a sequence in converging to zero. Then the smallest complete local subring of containing all a is bald.

---

---

Herrn Karl Stein zum 60. Geburtstag gewidmet     

On the solution of a generalized Schrödinger-type equation

Lu(t)+(u,F)g(t)=f(t), tS. , ( F, g). .

---

---

The authors wish to thank Professor Yu. A. Rozanov for his help and discussions.     

On power series with positive coefficients

M. . , . , ^p () (). , , .