Riesz means and Greedy Sums
Classical Analysis and ODEs
2012-12-05 v1
Abstract
One introduces the concept of greedy k-summability in such a way, that the direct product of one greedy k-summable numeric array onto another greedy n-summable numeric array to be greedy (n+k+1)-summable.
Keywords
Cite
@article{arxiv.1212.0821,
title = {Riesz means and Greedy Sums},
author = {Evgeny Shchepin},
journal= {arXiv preprint arXiv:1212.0821},
year = {2012}
}