The correctness problem for best approximations by trigonometric polynomials in the class W o r H[ω]C

Suppose thatk, rz₊, W _o ^r H[]_C= {ff is a 2-periodic function,f C^r [–, ], (f^(r), ) ()}, T_k is the space of trigonometric polynomials of order k, p_k(f)T_k is the polynomial of best uniform approximation to f, and E_k(f) is the error of the best approximation. It is shown that for an arbitrary > 0 we have,where for 0<&#x2A7D;(1),k > 0.R () is the root of the equation , and for k = 0 or > (1) we have R()=.Translated from Matematicheskie Zametki, Vol. 22, No. 1, pp. 85–101, July, 1977.The author thanks S. B. Stechkin for posing the problem and for his attention to this work.     

über Wurzeln und Logarithmen beschrÄnkter Ma\e

Ohne ZusammenfassungBezeichnungen und Symbole G lokalkompakte topologische Gruppe - M(G)/R(G)/P(G)/ regulÄre komplexe/reelle/positive Ma\e/ - Q(G)/W(G) Ma\e mit · l/Wahrscheinlichkeitsma\e - _x Punktma\: _x(f)=f(x) - v Faltung, — Bekanntlich bildet M(G) bezüglich der Faltung eine Banachalgebra; - Involution in M(G), , wobei — die Komplexkonjugierte bezeichnet - × diskreter Anteil eines Ma\es, - T _gm Faltungsoperator auf L ² (G) (bezüglich des linken Haarschen Ma\es), f.ü. - p(·)/q(·)/u(·) - exp(·.) Exponentialfunktion, exp - normal/unitÄr/symmetrisch/positiv definit bezeichnet man ein Ma\ , wenn der Faltungsoperator T diese Eigenschaft besitzt - invertierbar hei\t M(G), wenn ein vM(G) existiert, so da\ v = v= _e - _1/n n-te Wurzel von ₁ hei\t wenn( _1/n)ⁿ= ₁ - ₁ hei\t unendlich teilbar wenn zu jedem natürlichen n eine n-te Wurzel _1/n von existiert - N Menge der natürlichen Zahlen     

Decompositions of complete graphs into isomorphic bipartite subgraphs

Let |E(G)|= andf, a 1-1 mapping ofV(G) into {0,1,...,}. Thenf is called a -valuation ofG if the induced function given by , for alluvE(G) is 1-1. A -valuationf is called an -valuation ofG if there exists a nonnegative number such that for everyuvE(G) withf(u)<f(v),f(u)<f(v). Let denote the graph of then-dimensionalG-cube. ForG=K _{3, 3},K _{4, 4}, andP _k ,it is shown that for any positive integern, then-dimensionalG-cube has an -valuation. This gives rise to decompositions of some complete graphs into certain bipartite graphs.     

New extremal properties for constructing conformal mappings

Summary It is well known that for a given simply connected regionR containing zero the uniform norm attains its minimum in the class of all holomorphic functions normalized byf(0)=0 andf(0)=1 only for the conformal mappingfRD(r)={z|z|}. It is shown that this theorem is still valid if one replaces the ordinary modulus | | on by any other norm on . For instance it is possible to obtain direct mappings ofR onto parallelograms, rectangles and ellipses. For the special norms |₁ and | this leads to a simple and fast computational technique involving linear programming methods. Several numerical examples are given.     

Signed Total Domination Nnumber of a Graph

The signed total domination number of a graph is a certain variant of the domination number. If is a vertex of a graph G, then N() is its oper neighbourhood, i.e. the set of all vertices adjacent to in G. A mapping f: V(G)-1, 1, where V(G) is the vertex set of G, is called a signed total dominating function (STDF) on G, if for each V(G). The minimum of values , taken over all STDF's of G, is called the signed total domination number of G and denoted by _st(G). A theorem stating lower bounds for _st(G) is stated for the case of regular graphs. The values of this number are found for complete graphs, circuits, complete bipartite graphs and graphs on n-side prisms. At the end it is proved that _st(G) is not bounded from below in general.     

Almost Fredholm operators in von Neumann algebras

LetA be a von Neumann algebra,J be the ideal of compact operators relative toA and letF ₊ be the left-Fredholm class ofA. We call almost left-Fredholm the class = {A A: if P A is a projection and AP J then P J}. Then and the inclusion is proper unlessA is semifinite and has a non-large center. satisfies all of the algebraic properties ofF ₊ but it is generally not open. IfA is semifinite then A iff there are central projectionsG with G = I such that AG F₊(AG). Let :A A/J. Then the left almost essential spectrum ofA A, , coincides with the set of eigenvalues of (A)     

Matching Polynomials And Duality

Let G be a simple graph on n vertices. An r-matching in G is a set of r independent edges. The number of r-matchings in G will be denoted by p(G, r). We set p(G, 0) = 1 and define the matching polynomial of G by and the signless matching polynomial of G by .It is classical that the matching polynomials of a graph G determine the matching polynomials of its complement . We make this statement more explicit by proving new duality theorems by the generating function method for set functions. In particular, we show that the matching functions and are, up to a sign, real Fourier transforms of each other.Moreover, we generalize Foatas combinatorial proof of the Mehler formula for Hermite polynomials to matching polynomials. This provides a new short proof of the classical fact that all zeros of µ(G, x) are real. The same statement is also proved for a common generalization of the matching polynomial and the rook polynomial.     

Sharp Constants in Inequalities for Intermediate Derivatives (the Gabushin Case)

We solve Tikhomirov's problem on the explicit computation of sharp constants in the Kolmogorov type inequalities

Optimal solution of nonlinear equations satisfying a Lipschitz condition

Summary For a given nonnegative we seek a pointx ^* such that |f(x ^*)| wheref is a nonlinear transformation of the cubeB=[0,1] ^m into (or ^p ,p>1) satisfying a Lipschitz condition with the constantK and having a zero inB.The information operator onf consists ofn values of arbitrary linear functionals which are computed adaptively. The pointx ^* is constructed by means of an algorithm which is a mapping depending on the information operator. We find an optimal algorithm, i.e., algorithm with the smallest error, which usesn function evaluations computed adaptively. We also exhibit nearly optimal information operators, i.e., the linear functionals for which the error of an optimal algorithm that uses them is almost minimal. Nearly optimal information operators consists ofn nonadaptive function evaluations at equispaced pointsx _j in the cubeB. This result exhibits the superiority of the T. Aird and J. Rice procedure ZSRCH (IMSL library [1]) over Sobol's approach [7] for solving nonlinear equations in our class of functions. We also prove that the simple search algorithm which yields a pointx ^*=x _k such that is nearly optimal. The complexity, i.e., the minimal cost of solving our problem is roughly equal to (K/) ^m .     

Two consistency results concerning thin-tall Boolean algebras

In this paper we show that the following is relatively consistent withZFC +CH: There is no superatomic Boolean algebra of height ₂+1 and width, and there is no superatomic Boolean algebraA with for 0<<₁ and Presented by J. Mycielski.     

Analog of the Akhiezer–Krein–Favard Sums for Periodic Splines of Minimal Defect

Let be the space of 2-periodic functions whose (r – 1)th-order derivative is absolutely continuous on any segment and rth-order derivative belongs to L _p, S _2n,m is the space of 2-periodic splines of order m of minimal defect over the uniform partition . In this paper, we construct linear operators such that

Uniform Convergence of the Generalized Bieberbach Polynomials in Regions with Zero Angles

Let C be the extended complex plane; G C a finite Jordan with 0 G; w= (z) the conformal mapping of G onto the disk normalized by . Let us set , and let be the generalized Bieberbach polynomial of degree n for the pair (G,0), which minimizes the integral in the class of all polynomials of degree not exceeding n with . In this paper we study the uniform convergence of the generalized Bieberbach polynomials with interior and exterior zero angles and determine its dependence on the properties of boundary arcs and the degree of their tangency.     

Description of Simple Exceptional Sets in the Unit Ball

For z B ⁿ, the boundary of the unit ball in . If the exceptional set for f. In this note we give a tool for describing such sets. Moreover we prove that if Eis a G and F subset of the projective (n– 1)-dimensional space then there exists a holomorphic function fin the unit ball B ⁿso that E(f) = E.     

On One Extremal Problem for a Seminorm on the Space l<Subscript>1</Subscript> with Weight

Let be a nondecreasing sequence of positive numbers and let l _1,α be the space of real sequences for which . We associate every sequence ξ from l _1,α with a sequence , where ϕ(·) is a permutation of the natural series such that , j ∈ ℕ. If p is a bounded seminorm on l _1,α and , then

On the Range of the Aluthge Transform

Let be the algebra of all bounded linear operators on a complex separable Hilbert space For an operator let be the Aluthge transform of T and we define for all where T = U|T| is a polar decomposition of T. In this short note, we consider an elementary property of the range of Δ. We prove that R(Δ) is neither closed nor dense in However R(Δ) is strongly dense if is infinite dimensional. An erratum to this article is available at .     

Exact constants in inequalities of the jackson type for quadrature formulas

We prove that if is the error of a simple quadrature formula and ω(ε, δ)₁ is the integral modulus of continuity, then, for any δ ≥/π andn,r = 1, 2, …, the following equality is true: whereD _r is the Bernoulli kernel.     

Fehlerabschätzungen für Gauß-Quadraturformeln

Summary We consider Gauss quadrature formulaeQ _n ,n, approximating the integral ,w an even weight function. Let be analytic inK _r :={z:|z|<r},r>1, and . The error functionalR _n :=I-Q _n is continuous with respect to |·|_r and the relation , q_2k (x):=x ^2k holds.In this paper estimates for R _n are given. To this end we first derive two new representations of R _n which are essential for our further investigations. The R _n =r ² R _n (), with (x):=1/(r ²-x ²), is estimated in various ways by using the best uniform approximation of in P_2n-1, and also the expansion of with respect to Chebyshe polynomials of the first and second kind. Forw(x)=(1-x ²), =±1/2, R _n is calculated. The asymptotic behaviour, forr1+, of R _n and of the derived error bounds is also discussed. Finally, we compare different error bounds and give numerical examples.

     

An explicit Lévy-Hinčin formula for convolution semigroups on locally compact groups

LetG be a locally compact group and (_t)_{t 0} a continuous convolution semigroup of probability measures onG. We show that an operatorN is the infinitesimal generator of (_t)_{t 0} iffN is defined at least on the spaceC ₂(G) of twice right differentiable functions and if

On Interpolation Sequences of One Class of Functions Analytic in the Unit Disk

We establish a criterion for the existence of a solution of the interpolation problem f( _n ) = b _n in the class of functions f analytic in the unit disk and satisfying the relation