Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Hard Summation, Olevskii, Tao and Walsh

Hard Summation, Olevskii, Tao and Walsh Abstract Tao has shown that hard summation (summing Fourier-type series by using terms in order of decreasing size of the Fourier coefficients) works for wavelets, but the present author has shown that it fails for classical Fourier series. This paper, which is intended for a general audience, exhibits the underlying ideas in the context of Haar and Walsh series, where many of the proofs simplify. 2000 Mathematics Subject Classification 42A20 (primary), 42C10, 42C20 (secondary). © London Mathematical Society http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Bulletin of the London Mathematical Society Oxford University Press

Hard Summation, Olevskii, Tao and Walsh

Loading next page...
 
/lp/oxford-university-press/hard-summation-olevskii-tao-and-walsh-n7NgUlEAWH

References (16)

Publisher
Oxford University Press
Copyright
© London Mathematical Society
ISSN
0024-6093
eISSN
1469-2120
DOI
10.1112/S002460930601890X
Publisher site
See Article on Publisher Site

Abstract

Abstract Tao has shown that hard summation (summing Fourier-type series by using terms in order of decreasing size of the Fourier coefficients) works for wavelets, but the present author has shown that it fails for classical Fourier series. This paper, which is intended for a general audience, exhibits the underlying ideas in the context of Haar and Walsh series, where many of the proofs simplify. 2000 Mathematics Subject Classification 42A20 (primary), 42C10, 42C20 (secondary). © London Mathematical Society

Journal

Bulletin of the London Mathematical SocietyOxford University Press

Published: Oct 1, 2006

There are no references for this article.