Riesz representation theorem and weak compactness

. , .     

OnU ϕ-sets of trigonometric integrals

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

НАИЛУЧШЕЕ ПРИБЛИЖЕ НИЕ УГЛОМ И ПРИБЛИЖЕНИЕ УГЛОМ ИЗ СИНГУЛЯРНЫХ ИНТЕГРАЛОВ ФУНКЦИЙf∈L p (R n ),2<P<∞

. .     

Continuation of functionals on ultradifferentiable function spaces

, c _k b _k . . . .

---

---

This work is supported by N.B.H.M. grant No. 48/1/94-R&D-II.     

О предельном распределении для сумм независимых слууайных велиуин на бикомпактных коммутативных топологиуеских группах

,      

Some expansion formulae for Fox'sH-function of two variables involving associated Legendre functions

H- .     

Exact convergence rates in strong approximation laws for large increments of partial sums

Summary Consider partial sumsS _n of an i.i.d. sequenceX ₁ X ₂, ..., of centered random variables having a finite moment generating function in a neighborhood of zero. The asymptotic behaviour of is investigated, where 1b _n n denotes an integer sequence such thatb _n /logn asn. In particular, ifb _n =o(log ^p n) asn for somep>1, the exact convergence rate ofU _n /b _{n n} =1 +0 (1) is determined, where _n depends uponb _n and the distribution ofX ₁. In addition, a weak limit law forU _n is derived. Finally, it is shown how strong invariance takes over if b _n (loglogn)²/log³ n=.     

On equivalence of rearrangements of the Haar system in dyadic Hardy and BMO spaces

H={h ₁,I } — , . : , I ¦(I)¦=¦I¦, ¦I¦ — I. H H ={h _(I),I} . , , . L ^p .

---

---

Dedicated to Professor B. Szökefalvi-Nagy on his 75th birthday

---

This research was supported in part by MTA-NSF Grants INT-8400708 and 8620153.     

An embedding theorem for a limiting exponent

We consider the function space B _p ^l () of functionsf(x), defined on the domain of a certain class and characterized by specific differential-difference properties in L_p(). We prove a theorem on the embedding B _p,q ^l () L_q in the case whenl=n/p –n/q >0 and its generalization for vectorl, p, q.Translated from Matematicheski Zametki, Vol. 6, No. 2, pp. 129–138, August, 1969.     

An isolation theorem for decomposable forms of purely real algebraic fields of degree n⩾3

Let M be a complete module of a purely algebraic field of degree n3, let be the lattice of this module and let F(X) be its form. By we denote any lattice for which we have = , where is a nondiagonal matrix satisfying the condition ¦-I¦ , I being the identity matrix. The complete collection of such lattices will be denoted by {}. To each lattice we associate in a natural manner the decomposable form F(X). The complete collection of forms, corresponding to the set {}, will be denoted by {F} It is shown that for any given arbitrarily small interval (N–, N+), one can select an such that for each F(X) from {F} there exists an integral vector X₀ such that N– < F(X₀) < N+.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 112, pp. 167–171, 1981.     

On the eigenvalues of the matrix pencilA+μB

Summary The number of independent invariants ofn×n matricesA, B and their products on which the eigenvalues () of the matrix pencilA+B depend is determined by means of the theory of algebraic invariants and combinatorial analysis. Formulas are displayed for coefficients for the calculation of () forn5.

---

Zusammenfassung Wir bestimmen die Anzahl der unabhängigen Invarianten dern×n MatrizenA, B und ihrer Produkte, von denen die Eigenwerte () der MatrixbüschelA+B abhängen, mittels der Theorie der algebraischen Invarianten und mittels kombinatorischer Analyse. Formeln für Koeffizienten zur Berechnung von () werden angegeben fürn5.

     

A survey of pseudo (v,k, λ)-designs

This work is an attempt to give a complete survey of all known results about pseudo (v, k, )-designs. In doing this, the author hopes to bring more attention to his conjecture given in Section 6; an affirmative answer to this conjecture would settle completely the existence and construction problem for a pseudo (v, k, )-design in terms of the existence of an appropriate (v, k, )-design.     

Almost flat locally finite coverings of the sphere

For any subset A of the unit sphere of a Banach space X and for [0,2) the notion of -flatness is introduced as a measure of non-flatness of A. For any positive , construction of locally finite tilings of the unit sphere by -flat sets is carried out under suitable -renormings of X in a quite general context; moreover, a characterization of spaces having separable dual is provided in terms of the existence of such tilings. Finally, relationships between the possibility of getting such tilings of the unit sphere in the given norm and smoothness properties of the norm are discussed.     

On a class of orthogonal series

, [0, 1], (n+1) n-. . [2]. — (. 5.4 5.6). . 6.4 2 [5]. , [4]. , , [6] [7]. [1].     

Orthonormal systems satisfying an inequality of S. M. Nikol'skii

N- (p, q) (1 pN-, L _p - L _q -. , , , L L _q - , , .     

On the boundedness of Weyl sums

Leta be irrational and letf:[0,1] be Riemann-integrable with integral zero. Letf _n (x) denote the Weyl sumf _n (x):= _k=0 ^n–1 f({x k>}),x/[0,1[,n. We prove criteria for the boundedness of the sequence (f _n ) _n1 and discuss the relation of this question to irregularities of the distribution of sequences.     

Experiments with an interactive paired comparison simplex method for molp problems

In this paper, an interactive paired comparison simplex based method formultipleobjectivelinearprogramming (MOLP) problems is developed and compared to other interactive MOLP methods. Thedecisionmaker (DM)'s utility function is assumed to be unknown, but is an additive function of his known linearized objective functions. A test for utilityefficiency for MOLP problems is developed to reduce the number of efficient extreme points generated and the number of questions posed to the DM. The notion of strength ofpreference is developed for the assessment of the DM's unknown utility function where he can express his preference for a pair of extreme points as strong, weak, or almost indifferent. The problem of inconsistency of the DM is formalized and its resolution is discussed. An example of the method and detailed computational results comparing it with other interactive MOLP methods are presented. Several performance measures for comparative evaluations of interactive multiple objective programming methods are also discussed.All rights reserved. This study, or parts thereof, may not be reproduced in any form without written permission of the authors.     

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.     

Asymptotic Density and the Asymptotics of Partition Functions

Let A be a set of positive integers with gcd (A) = 1, and let p _A (n) be the partition function of A. Let c ₀ = 2/3. If A has lower asymptotic density and upper asymptotic density , then lim inf log p _A (n)/c ₀ n and lim sup log p _A (n)/c ₀ n . In particular, if A has asymptotic density > 0, then log p _A (n) c₀n. Conversely, if > 0 and log p _A (n) c ₀ n, then the set A has asymptotic density .     

Legitimate colorings of projective planes

For a projective plane _n of ordern, let( _n ) denote the minimum numberk, so that there is a coloring of the points of _n ink colors such that no two distinct lines contain precisely the same number of points of each color. Answering a question of A. Rosa, we show that for all sufficiently largen, 5 ( _n ) 8 for every projective plane _n of ordern. Research supported in part by Allon Fellowship and by a grant from the United States Israel Binational Science Foundation