φ-Factors for Function Seminorms

Let (, A, ) be a measure space, a function seminorm on M, the space of measurable functions on , and M the space {f M : (f) < }. Every Borel measurable function : [0, ) [0, ) induces a function : M M by (f)(x) = (|f(x)|). We introduce the concepts of -factor and -invariant space. If is a -subadditive seminorm function, we give, under suitable conditions over , necessary and sufficient conditions in order that M be invariant and prove the existence of -factors for . We also give a characterization of the best -factor for a -subadditive function seminorm when is -finite. All these results generalize those about multiplicativity factors for function seminorms proved earlier.     

A complete asymptotic expansion of the jacobi functions with error bounds

In this paper we give a complete asymptotic expansion of the Jacobi functions ^{(, )} (t) as + . The method we employed to get the complete expansion follows that of Olver in treating similar problems. By using a Gronwall-Bellman type inequality for an improper integral in which the integrand is an unbounded function and contains a parameter, we get an error bound of the asymptotic approximation which is different from that of Olver's.     

Nonlinear programming,approximation, and optimization on infinitely differentiable functions

A nonnegative, infinitely differentiable function defined on the real line is called a Friedrichs mollifier function if it has support in [0, 1] and ₀ ¹ (t)dt=1. In this article, the following problem is considered. Determine _k =inf ₀ ¹ |^(k)(t)|dt,k=1, 2, ..., where ^(k) denotes thekth derivative of and the infimum is taken over the set of all mollifier functions , which is a convex set. This problem has applications to monotone polynomial approximation as shown by this author elsewhere. The problem is reducible to three equivalent problems, a nonlinear programming problem, a problem on the functions of bounded variation, and an approximation problem involving Tchebycheff polynomials. One of the results of this article shows that _k =k!2^2k–1,k=1, 2, .... The numerical values of the optimal solutions of the three problems are obtained as a function ofk. Some inequalities of independent interest are also derived.This research was supported in part by the National Science Foundation, Grant No. GK-32712.     

On lower bounds in radial basis approximation

We investigate the approximation by manifolds _n() generated by linear combinations of n radial basis functions on R^d of the form (|–a|), where is the thin-plate spline type function. We obtain exact asymptotic estimates for the approximation of Sobolev classes W^r(B^d) in the space L(B^d) on the unit ball B^d. AMS subject classification 41A25, 41A63, 65D07, 41A15     

Mittelwert der Eulerschen φ-Funktion und des Quadrates der Dirichletschen Teilerfunktion in algebraischen Zahlkörpern

LetK be an algebraic number field, and for every integer K let () andd(), respectively, denote the number of relatively prime residue classes and the number of divisors of the principal ideal (). Asymptotic equalities are proved for the sums () and d ²(), where runs through certain finite sets of integers ofK.     

Quasi-coherence of Hardy spaces in several complex variables

In this paper, we prove that the Hardy spaceH ^p (), 1p<, over a strictly pseudoconvex domain in ⁿ with smooth boundary is quasi-coherent. More precisely, we show that Toeplitz tuplesT with suitable symbols onH ^p () have property (). This proof is based on a well known exactness result for the tangential Cauchy-Riemann complex.     

Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du maximum

Résumé Certaines méthodes directes et indirectes pour le calcul de Max {x ^t Ax, (x)1} sont étudiées.Les méthodes directes sont basées sur les propriétés particulières des normes ₁, ₂ et . Ces méthodes sont très simples mais ne s'appliquent qu'à certaines familles de matrices.La méthode indirecte est la méthode autoduale introduite dans [25, 26] avec = ₁. Dans ce cas, le choix du vecteur initial pour qu'il y ait convergence vers une solution optimale est largement discuté.

---

Some methods for computing the maximum of quadratic from on the unit ball of the maximum norm

Summary Some direct and indirect methods are studied for computing Max {x ^t Ax, (x)1} whereA is symmetric definite positive.Direct methods are constructed using particular properties of ₁, ₂, norms. These methods are very simple, but uniquely suitable to certains families of matrices.The indirect method is the autodual method, introduced in [25, 26, 29] with = ₁. In this case the problem of choosing an initial vector so that convergence of the iterative sequence occurs to an optimal solution is largely discussed.

     

Divergence of orthogonal series to +∞

An overall bounded orthonormal set of functions _n (x) is constructed for which there exists a series _m =1 a_nn(x) with coefficients a_n=o(ln'n/n), which diverges to + almost everywhere. The bibliography contains 4 references.Translated from Matematicheskie Zametki, Vol. 2, No. 5, pp. 483–494, November, 1967.     

Über den algorithmischen Nachweis von Ungleichungen I

We shall develop a method to prove inequalities in a unified manner. The idea is as follows: It is quite often possible to find a continuous functional : ⁿ , such that the left- and the right-hand side of a given inequality can be written in the form (u)(v) for suitable points,v=v(u). If one now constructs a map ^{n n} , which is functional increasing (i.e. for each x ⁿ (which is not a fixed point of ) the inequality (x)<((x)) should hold) one specially gets the chain (u)( u))( ²(u))... ⁿ (u)). Under quite general conditions one finds that the sequence { ⁿ (u)} _n converges tov=v(u). As a consequence one obtains the inequality (u)(v).     

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.

     

Nonparametric Estimation in a Model with a Trend

Let Yt be a stochastic process taking values in R and defined by the model Yt=azt+(Xt)+ t where {zt} is a deterministic sequence, {Xt} is strictly stationary and strongly mixing, and {t} is i.i.d. We study asymptotic properties of nonparametric estimators of density and regression with rates of convergence, and their behavior on estimation when () is polynomial. It is shown that the estimator of the coefficients of () constructed from the nonparametric estimators of regression is consistent when the deterministic {zt} converges in Cesàro mean, and may be inconsistent when {zt} is periodic under some ordinary conditions.     

A Method of Solution for the One-Dimensional Heat Equation Subject to Nonlocal Conditions

The problem of solving the one-dimensional heat equation /t - ²/x² = f(x, t) subject to given initial and nonlocal conditions is considered. It is solved in the Laplace transform domain by taking the Laplace transform of the unknown function with respect to time t. The physical solution is recovered with the help of a numerical technique for inverting the Laplace transform.AMS Subject Classification (1991): 35K20.     

A Hubert space characterization among function spaces

— [0,1] ,E — - e=1 [0,1]. I — _E =1, E=L ₂ x _e =xL ₂ x E.

---

---

This work was prepared when the second author was a visiting professor of the CNR at the University of Firenze. He was supported by the Soros International Fund.     

Estimation of density functionals

Given a sequence of independent random variables with densityf we estimate quantities of the form = (f(x))dx, a known function, by inserting histograms and kernel density estimators for the unknownf. We obtain conditions for consistency and asymptotic normality and discuss the choice of cell size and bandwidth.     

Solution of εY″+YY′−Y=0 by a nonasymptotic method

The solution of y(x)+y(x)y(x)–y(x)=0, with the boundary conditionsy(0)=,y(1)=, is obtained by a nonasymptotic method. It is shown that the nature of the inner solution for both left-hand and right-hand boundary layers depends on the roots of a transcendental equation. From sketches of this function, the location of the roots can be found. For the left-hand boundary layer, depending on the relative size and signs of and , 13 cases exist for the possible solution of the transcendental equation. Of these cases, only five correspond to acceptable solutions. Similar remarks apply to the right-hand boundary layer solutions. Numerical experience with the method is also reported to confirm the theoretical analysis.The author expresses his thanks to Dr. J. Greenstadt for his suggestions on sketching the roots of (C).     

Quantum Poisson processes and dilations of dynamical semigroups

Summary The notion of a quantum Poisson process over a quantum measure space is introduced. This process is used to construct new quantum Markov processes on the matrix algebraM _n with stationary faithful state . If (, ) is the quantum measure space in question ( a von Neumann algebra and a faithful normal weight), then the semigroupe ^tL of transition operators on (M _n , ) has generator whereu is an arbitrary unitary element of the centraliser of (M _n ,).Supported by the Netherlands Organization for Scientific Research NWO     

A Foliation of the Space of Conjugacy Classes of Representations of a Surface Group

Let be the fundamental group of a closed orientable surface of genus g 1, and let R(, G)/G be the space of conjugacy classes of representations of into a connected real reductive Lie group G. Motivated by the theory of geometric quantization, we define a map ¯ on R(, G)/G and investigate whether the fibres of ¯ are isotropic with respect to the natural symplectic structure on R(, G)/G. If g = 2 and G = SU(2), then the foliation given by the fibres of ¯ is equivalent to a real polarization defined by Weitsman, and we reprove his result that the fibres are isotropic in this case. If g = 1 then the fibres of ¯ are also isotropic, but we give an example to show that in general they are not.     

Morphisms of the Heat Equation

In this article we consider a certain class of mappings between Riemannian manifolds of the type M × R^{+ *}, which preserve two objects associated to the heat equation. First we show that maps which pull back local solutions of the heat equation to local solutions of the heat equation, called heat equation morphisms have to be the product of a homothetic submersion and an affine map of R^{+ *}. Then using the above characterisation, we study maps which pull back the heat kernel to the heat kernel. We call such maps heat kernel morphisms. We show in Theorem 3 that, in the case of compact manifolds, a map : M × M × R^{+ *} N × N × R^{+ *} of the form (x,y,t) = ( (x), (y),h(t)), with surjective, is a heat kernel morphism if and only if is a homothetic covering of N()-sheets and constant dilation such that N() = ^m (m = dim M) and h(t) = ²t. In particular, if is bijective then it must be an isometry and h(t) = t. A similar problem was considered from a different point of view in [6].     

Fast Summation of Power Series with Coefficients Analytic at Infinity

We propose a fast summation algorithm for slowly convergent power series of the form _{j=j 0} z ^j _j j _i=1 ^s (j+ _i )^– _i , where R, _i 0 and _i C, 1is, are known parameters, and _j =(j), being a given real or complex function, analytic at infinity. Such series embody many cases treated by specific methods in the recent literature on acceleration. Our approach rests on explicit asymptotic summation, started from the efficient numerical computation of the Laurent coefficients of . The effectiveness of the resulting method, termed ASM (Asymptotic Summation Method), is shown by several numerical tests.     

Complete problems withL-samplable distributions

The average case complexity classes P, L-samplable and NL, L-samplable are defined. We show that Deterministic Bounded Halting is complete for P, L-samplable and that Graph Reachability is complete for NL-samplable, both problems with a universal logspace samplable distribution.