Complete monotonicity for inverse powers of some combinatorially defined polynomials

From MaRDI portal
Publication:483372

DOI10.1007/S11511-014-0121-6zbMATH Open1304.05074arXiv1301.2449OpenAlexW3101233038WikidataQ56892981 ScholiaQ56892981MaRDI QIDQ483372FDOQ483372


Authors: Alan D. Sokal, Alex Scott Edit this on Wikidata


Publication date: 17 December 2014

Published in: Acta Mathematica (Search for Journal in Brave)

Abstract: We prove the complete monotonicity on (0,infty)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 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 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 for some 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.


Full work available at URL: https://arxiv.org/abs/1301.2449




Recommendations




Cites Work


Cited In (15)





This page was built for publication: Complete monotonicity for inverse powers of some combinatorially defined polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q483372)