Uniqueness of nontrivially complete monotonicity for a class of functions involving polygamma functions
Feng Qi, Bai-Ni Guo

TL;DR
This paper proves that among a class of functions involving polygamma functions, only one specific function exhibits nontrivial complete monotonicity, highlighting its unique mathematical property.
Contribution
The paper establishes the uniqueness of the nontrivially completely monotonic function within a class involving polygamma functions using two different methods.
Findings
Only f_{1,2}(x) is nontrivially completely monotonic.
Functions f_{1,2}(x) and f_{m,2n-1}(x) are completely monotonic.
Other functions f_{m,2n}(x) are not monotonic or sign-preserving.
Abstract
For , let on . In the present paper, we prove using two methods that, among all for , only is nontrivially completely monotonic on . Accurately, the functions and are completely monotonic on , but the functions for are not monotonic and does not keep the same sign on .
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.
