Page 1

Displaying 1 – 5 of 5

Showing per page

On the Fourier transform of the symmetric decreasing rearrangements

Philippe Jaming (2011)

Annales de l’institut Fourier

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 L 2 behavior of a Fourier transform of a function over a small set is controlled by the L 2 behavior of the Fourier transform of its symmetric decreasing rearrangement. In the L 1 case, the same is true if we further assume that the function has a support of finite measure.As a byproduct, we also give...

On the non-equivalence of rearranged Walsh and trigonometric systems in L p

Aicke Hinrichs, Jörg Wenzel (2003)

Studia Mathematica

We consider the question of whether the trigonometric system can be equivalent to some rearrangement of the Walsh system in L p 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.

On the order of magnitude of Walsh-Fourier transform

Bhikha Lila Ghodadra, Vanda Fülöp (2020)

Mathematica Bohemica

For a Lebesgue integrable complex-valued function f defined on + : = [ 0 , ) let f ^ be its Walsh-Fourier transform. The Riemann-Lebesgue lemma says that f ^ ( y ) 0 as y . 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 L 1 ( + ) there is a definite rate at which the Walsh-Fourier transform tends to zero. We...

Currently displaying 1 – 5 of 5

Page 1