A Bound for Stieltjes Constants

Filip Saidak; Sebastian Pauli

REVIEW

A Bound for Stieltjes Constants

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 2301.11209 v2 pith:PMSNFHXN submitted 2023-01-26 math.NT cs.NAmath.NA

Sebastian Pauli , Filip Saidak This is my paper · ORCID

classification math.NTcs.NAmath.NA

keywords constantsstieltjesappliedapproximateavailableboundboundscoffey

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

The goal of this note is to improve on the currently available bounds for Stieltjes constants using the method of steepest descent applied by Coffey and Knessl to approximate Stieltjes constants.

Discussion (0). Continue with ORCID to comment.

Pith tools