A Bound for Stieltjes Constants
Sebastian Pauli, Filip Saidak
TL;DR
This paper improves bounds on Stieltjes constants by applying the steepest descent method to derive tighter estimates, advancing understanding of these mathematical constants.
Contribution
It introduces a refined approach using steepest descent to obtain better bounds for Stieltjes constants, building on prior approximation methods.
Findings
Derived improved bounds for Stieltjes constants
Applied steepest descent method effectively in this context
Enhanced accuracy of approximations for mathematical analysis
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Advanced Physical and Chemical Molecular Interactions