A Bound for Stieltjes Constants

01/26/2023

∙

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.

READ FULL TEXT

A Bound for Stieltjes Constants

A Note on the Convergence of Mirrored Stein Variational Gradient Descent under (L_0,L_1)-Smoothness Condition

Lecture Note on LCSSX's Lower Bounds for Non-Adaptive Distribution-free Property Testing

A short note on an inequality between KL and TV

A Note on Echelon-Ferrers Construction

A short note on the joint entropy of n/2-wise independence

A Note on Slepian-Wolf Bounds for Several Node Grouping Configurations

Moment-Based Bound on Peak-to-Average Power Ratio and Reduction with Unitary Matrix

A Bound for Stieltjes Constants

Related Research

A Note on the Convergence of Mirrored Stein Variational Gradient Descent under (L_0,L_1)-Smoothness Condition

Lecture Note on LCSSX's Lower Bounds for Non-Adaptive Distribution-free Property Testing

A short note on an inequality between KL and TV

A Note on Echelon-Ferrers Construction

A short note on the joint entropy of n/2-wise independence

A Note on Slepian-Wolf Bounds for Several Node Grouping Configurations

Moment-Based Bound on Peak-to-Average Power Ratio and Reduction with Unitary Matrix