Complete monotonicity for inverse powers of some combinatorially defined polynomials
Alexander D. Scott, Alan D. Sokal

TL;DR
This paper proves complete monotonicity for inverse powers of certain combinatorial polynomials, extending previous results and connecting to harmonic analysis and matroid operations, with implications for stability and positivity properties.
Contribution
It introduces two methods for establishing complete monotonicity of inverse polynomial powers, generalizes known results, and develops constructions preserving this property for combinatorial polynomials.
Findings
Proves complete monotonicity for inverse powers of spanning-tree and basis generating polynomials.
Develops determinantal and quadratic-form methods linked to harmonic analysis.
Creates constructions that generate new polynomials with the same monotonicity property.
Abstract
We prove the complete monotonicity on for suitable inverse powers of the spanning-tree polynomials of graphs and, more generally, of the basis generating polynomials of certain classes of matroids. This generalizes a result of Szego and answers, among other things, a long-standing question of Lewy and Askey concerning the positivity of Taylor coefficients for certain rational functions. Our proofs are based on two_ab initio_ methods for proving that is completely monotone on a convex cone : the determinantal method and the quadratic-form method. These methods are closely connected with harmonic analysis on Euclidean Jordan algebras (or equivalently on symmetric cones). We furthermore have a variety of constructions that, given such polynomials, can create other ones with the same property: among these are algebraic analogues of the matroid operations of…
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.
