Riesz means and Greedy Sums

TL;DR

This paper introduces the concept of greedy k-summability and demonstrates that the direct product of two greedy summable arrays results in a higher-order greedy summable array, expanding the theoretical framework of summability methods.

Contribution

It defines greedy k-summability and proves a new property about the direct product of greedy summable arrays, advancing the theory of summability methods.

Findings

The direct product of greedy k-summable arrays is greedy (n+k+1)-summable.

Introduces the concept of greedy k-summability.

Establishes a new property of summability under direct product operation.

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.