Greedy Sums and Dirichlet Series
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:VE62VM2Drecord.jsonopen to challenge →
classification
math.CA
keywords
greedysumsproductarrayscomplexdirectdirichletequal
read the original abstract
We prove that the greedy sum of a direct product of two numeric arrays of complex numbers is equal to the product of the greedy sums of the factors provided that all the mentioned sums exist.
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.