Locally constant dyadic derivatives

We show that in order for a Walsh series to be locally constant it is necessary for certain blocks of that series to sum to zero. As a consequence, we show that a functionf with a somewhat sparse Walsh—Fourier series is necessarily a Walsh polynomial if its strong dyadic derivative is constant on an interval. In particular, if a Rademacher seriesR is strongly dyadically differentiable and if that derivative is constant on any open subset of [0, 1], thenR is a Rademacher polynomial.     

一般随机富里叶级数

人们通常是在随机系数对称条件下，研究随机富里叶级数的，例文南[1]。本文不要对称性假设，研究一般随机富里叶级数一些性质，并得到一些重要成果。     

A Family of Approximation Formulas and some Applications

The general scheme, suggested in [1] using a basis of an infinite-dimensional space and allowing to construct finite-dimensional orthogonal systems and interpolation formulas, is improved in the paper. This results particularly in a generalization of the well-known scheme by which periodic interpolatory wavelets are constructed. A number of systems which do not satisfy all the conditions for multiresolution analysis but have some useful properties are introduced and investigated.

Starting with general constructions in Hilbert spaces, we give a more careful consideration to the case connected with the classic Fourier basis.

Convergence of expansions which are similar to partial sums of the summation method of Fourier series, as well as convergence of interpolation formulas are considered.

Some applications to fast calculation of Fourier coefficients and to solution of integrodifferential equations are given. The corresponding numerical results have been obtained by means of MATHEMATICA 3.0 system.     

On a problem of littlewood

The theorem on the tending to zero of coefficients of a trigonometric series is proved when theL ¹-norms of partial sums of this series are bounded. It is shown that the analog of Helson's theorem does not hold for orthogonal series with respect to the bounded orthonormal system. Two facts are given that are similar to Weis' theorem on the existence of a trigonometric series which is not a Fourier series and whoseL ¹-norms of partial sums are bounded.     

Pointwise Behavior of Double Fourier Series of Functions of Bounded Variation

We extend some recent results of S. A. Telyakovskii on the uniform boundedness of the partial sums of Fourier series of functions of bounded variation to periodic functions of two variables, which are of bounded variation in the sense of Hardy. As corollaries, we obtain the classical Parseval formula, the convergence theorem of the series involving the sine Fourier coefficients, and a lower estimate of the best approximation by trigonometric polynomials in the metric of L in a sharpened version. This research was supported by the Hungarian National Foundation for Scientific Research under Grants TS 044 782 and T 046 192.     

简化原理在Hilbert空间与可分Banach空间的一些应用

本文研究了简化原理在Hilbert空间与可分Banach空间中的一些应用,利用简化原理和独立随机元收敛准则获得了中分Banach空间随机级数的收缩原理和B-值随机Dirichlet级数简单收敛横坐标及一般随机整函数的增长性和值分布,将许多以Rademacher序列为系数的随机Tayor级数和随机Dirichlet级数的相关结果,推广到一般的具有独立对称分布系数的随机级数上去。     

A summability method for the arithmetic Fourier transform

The Arithmetic Fourier Transform (AFT) is an algorithm for the computation of Fourier coefficients, which is suitable for parallel processing and in which there are no multiplications by complex exponentials. This is accomplished by the use of the Möbius function and Möbius inversion. However, the algorithm does require the evaluation of the function at an array of irregularly spaced points. In the case that the function has been sampled at regularly spaced points, interpolation is used at the intermediate points of the array. Generally theAFT is most effective when used to calculate the Fourier cosine coefficients of an even function.In this paper a summability method is used to derive a modification of theAFT algorithm. The proof of the modification is quite independent of theAFT itself and involves a summation by primes. One advantage of the new algorithm is that with a suitable sampling scheme low order Fourier coefficients may be calculated without interpolation.     

A Levin-type algorithm for accelerating the convergence of Fourier series

A nonlinear sequence transformation is presented which is able to accelerate the convergence of Fourier series. It is tailored to be exact for a certain model sequence. As in the case of the Levin transformation and other transformations of Levin-type, in this model sequence the partial sum of the series is written as the sum of the limit (or antilimit) and a certain remainder, i.e., it is of Levin-type. The remainder is assumed to be the product of a remainder estimate and the sum of the first terms oftwo Poincaré-type expansions which are premultiplied by two different phase factors. This occurrence of two phase factors is the essential difference to the Levin transformation. The model sequence for the new transformation may also be regarded as a special case of a model sequence based on several remainder estimates leading to the generalized Richardson extrapolation process introduced by Sidi. An algorithm for the recursive computation of the new transformation is presented. This algorithm can be implemented using only two one-dimensional arrays. It is proved that the sequence transformation is exact for Fourier series of geometric type which have coefficients proportional to the powers of a numberq, |q|<1. It is shown that under certain conditions the algorithm indeed accelerates convergence, and the order of the convergence is estimated. Finally, numerical test data are presented which show that in many cases the new sequence transformation is more powerful than Wynn's epsilon algorithm if the remainder estimates are properly chosen. However, it should be noted that in the vicinity of singularities of the Fourier series the new sequence transformation shows a larger tendency to numerical instability than the epsilon algorithm.     

Refinement equations with nonnegative coefficients

In this paper we analyze solutions of the n-scale functional equation Ф(x) = Σ_k∈ℤ ^Pk Ф(nx−k), where n≥2 is an integer, the coefficients {P_k} are nonnegative and Σpk = 1. We construct a sharp criterion for the existence of absolutely continuous solutions of bounded variation. This criterion implies several results concerning the problem of integrable solutions of n-scale refinement equations and the problem of absolutely continuity of distribution function of one random series. Further we obtain a complete classification of refinement equations with positive coefficients (in the case of finitely many terms) with respect to the existence of continuous or integrable compactly supported solutions.     

Explicit and Efficient Formulas for the Lattice Point Count in Rational Polygons Using Dedekind—Rademacher Sums

Abstract. We give explicit, polynomial-time computable formulas for the number of integer points in any two-dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of our formulas are Dedekind—Rademacher sums , which are polynomial-time computable finite Fourier series. As a by-product we rederive a reciprocity law for these sums due to Gessel, which generalizes the reciprocity law for the classical Dedekind sums. In addition, our approach shows that Gessel's reciprocity law is a special case of the one for Dedekind—Rademacher sums, due to Rademacher.     

On random power series with nonidentically distributed coefficients

The distribution of the radius of convergence r(ω) of a random power series with nonidentically distributed coefficients is considered. The results obtained here extend the well-known work in the identically distributed case.     

Korobov Spaces with Respect to Digital Orthonormal Bases

 For an orthonormal basis (ONB) of we define classes of functions according to the order of decay of the Fourier coefficients with respect to the considered ONB . The rate is expressed in the real parameter α. We investigate the following problem: What is the order of decay, if any, when we consider with respect to another ONB ? If the function is expressable as an absolutely convergent Fourier series with respect to , we give bounds for the new order of decay, which we call . Special attention is given to digital orthonormal bases (dONBs) of which the Walsh and Haar systems are examples treated in the present paper. Bounding intervals and in several cases explicit values for are given for the case of dONBs. An application to quasi-Monte Carlo numerical integration is mentioned. (Received 21 February 2000; in revised form 19 October 2000)     

Extension of a theorem of Fejér to double Fourier-Stieltjes series

A theorem of Fejér states that if a periodic function F is of bounded variation on the closed interval [0, 2π], then the nth partial sum of its formally differentiated Fourier series divided by n converges to π^-1[F(x+0)-F(x-0)] at each point x. The generalization of this theorem for Fourier-Stieltjes series of (nonperiodic) functions of bounded variation is also well known. The aim of the present article is to extend these results to the (m, n)th rectangular partial sum of double Fourier or Fourier-Stieltjes series of a function F(x, y) of bounded variation over the closed square [0, 2π]×[0, 2π] in the sense of Hardy and Krause. As corollaries, we also obtain the following results:

Sharp Gaussian regularity on the circle, and applications to the fractional stochastic heat equation

A sharp regularity theory is established for homogeneous Gaussian fields on the unit circle. Two types of characterizations for such a field to have a given almost-sure uniform modulus of continuity are established in a general setting. The first characterization relates the modulus to the field's canonical metric; the full force of Fernique's zero-one laws and Talagrand's theory of majorizing measures is required. The second characterization ties the modulus to the field's random Fourier series representation. As an application, it is shown that the fractional stochastic heat equation has, up to a non-random constant, a given spatial modulus of continuity if and only if the same property holds for a fractional antiderivative of the equation's additive noise; a random Fourier series characterization is also given.     

The banach algebra A and its properties

Beurling’s algebra is considered. A* arises quite naturally in problems of summability of the Fourier series at Lebesgue points, whereas Wiener’s algebra A of functions with absolutely convergent Fourier series arises when studying the norm convergence of linear means. Certainly, both algebras are used in some other areas. A* has many properties similar to those of A, but there are certain essential distinctions. A* is a regular Banach algebra, its space of maximal ideals coincides with[−π, π], and its dual space is indicated. Analogs of Herz’s and Wiener-Ditkin’s theorems hold. Quantitative parameters in an analog of the Beurling-Pollard theorem differ from those for A. Several inclusion results comparing the algebra A* with certain Banach spaces of smooth functions are given. Some special properties of the analogous space for Fourier transforms on the real axis are presented. The paper ends with a summary of some open problems.     

Fourier coefficients of functions with a given modulus of continuity

In this paper, we study the role of the convexity condition for the modulus of continuity in the problem of finding an upper bound for the Fourier coefficients taken over the class of functions with a given modulus of continuity. Also, we solve the problem of the Fourier coefficients for the Rademacher system.     

Fourier Series with Linear Splines on an Interval

We construct orthonormal bases of linear splines on a finite interval [a, b] and then we study the Fourier series associated to these orthonormal bases. For continuous functions defined on [a, b], we prove that the associated Fourier series converges pointwisely on (a, b) and also uniformly on [a, b], if it convergences pointwisely at a and b.     

Gibbs' phenomenon and arclength

The arclengths of the graphs Γ(s_N(f)) of the partial sums s_N(f) of the Fourier series of a piecewise smooth function f with a jump discontinuity grow at the rate O(logN). This problem does not arise if f is continuous, and can be removed by using the standard summability methods.     

General monotone sequences and trigonometric series

In this article, we establish a norm equivalence satisfied by general monotone sequences. This is then used to show norm equivalences involving such sequences and trigonometric series with the elements of these sequences as coefficients. These equivalences generalize earlier results of Hardy and Littlewood, Askey and Wainger, Sagher, and Tikhonov.     

Decreasing rearranged Fourier series

There exists a continuous function whose Fourier sum, when taken in decreasing order of magnitude of the coefficients, diverges unboundedly almost everywhere.