On the absolute summability of series with respect to block-orthonormal systems.
Inspired by work of Montgomery on Fourier series and Donoho-Strak in signal processing, we investigate two families of rearrangement inequalities for the Fourier transform. More precisely, we show that the behavior of a Fourier transform of a function over a small set is controlled by the behavior of the Fourier transform of its symmetric decreasing rearrangement. In the case, the same is true if we further assume that the function has a support of finite measure.As a byproduct, we also give...
We consider the question of whether the trigonometric system can be equivalent to some rearrangement of the Walsh system in for some p ≠ 2. We show that this question is closely related to a combinatorial problem. This enables us to prove non-equivalence for a number of rearrangements. Previously this was known for the Walsh-Paley order only.
For a Lebesgue integrable complex-valued function defined on let be its Walsh-Fourier transform. The Riemann-Lebesgue lemma says that as . But in general, there is no definite rate at which the Walsh-Fourier transform tends to zero. In fact, the Walsh-Fourier transform of an integrable function can tend to zero as slowly as we wish. Therefore, it is interesting to know for functions of which subclasses of there is a definite rate at which the Walsh-Fourier transform tends to zero. We...