Greedy Sums and Dirichlet Series

Evgeny Shchepin

REVIEW

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1110.5285 v1 pith:VE62VM2D submitted 2011-10-24 math.CA

Greedy Sums and Dirichlet Series

Evgeny Shchepin This is my paper

classification math.CA

keywords greedysumsproductarrayscomplexdirectdirichletequal

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

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.

Greedy Sums and Dirichlet Series

discussion (0)