Author
Scott, A
Sokal, A
Journal title
Acta Mathematica
DOI
10.1007/s11511-014-0121-6
Issue
2
Volume
213
Last updated
2024-01-19T14:28:48.67+00:00
Page
323-392
Abstract
We prove the complete monotonicity on (0,∞)n(0,∞)n 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 Szegő 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 P−βP-β is completely monotone on a convex cone C: 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 deletion, contraction, direct sum, parallel connection, series connection and 2-sum. The complete monotonicity of P−βP-β for some β>0β>0 can be viewed as a strong quantitative version of the half-plane property (Hurwitz stability) for P, and is also related to the Rayleigh property for matroids.
Symplectic ID
492535
Favourite
On
Publication type
Journal Article
Publication date
01 Jan 2014
Please contact us with feedback and comments about this page. Created on 11 Dec 2014 - 03:51.