Complete monotonicity of log-functions
Rourou Ma, Julian Weigert

TL;DR
This paper explores the complete monotonicity property of a family of multivariate log-functions, establishing a connection with non-negative polynomials and providing an algorithm to determine monotonicity.
Contribution
It introduces a linear isomorphism between the family of functions and polynomial space, linking complete monotonicity to non-negative polynomials and showing the cone is semi-algebraic.
Findings
Established a linear isomorphism between function family and polynomial space
Identified the cone of completely monotone functions with non-negative polynomials
Provided a finite algorithm to decide complete monotonicity
Abstract
In this article we investigate the property of complete monotonicity within a special family of functions in variables involving logarithms. The main result of this work provides a linear isomorphism between and the space of real multivariate polynomials. This isomorphism identifies the cone of completely monotone functions with the cone of non-negative polynomials. We conclude that the cone of completely monotone functions in is semi-algebraic. This gives a finite time algorithm to decide whether a function in is completely monotone
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
TopicsPolynomial and algebraic computation · Mathematical functions and polynomials · Advanced Optimization Algorithms Research
