Riesz means and Greedy Sums
Reviewed by Pithpith:5N2F4BDUopen to challenge →
classification
math.CA
keywords
greedyarraynumericanotherconceptdirectintroducesk-summability
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.