English

G{\aa}rding Polynomials

Combinatorics 2026-05-19 v2 Analysis of PDEs Classical Analysis and ODEs Optimization and Control Probability

Abstract

We introduce G{\aa}rding polynomials, a class of real multivariate polynomials characterized by positivity regions that are invariant under translation by positive vectors and closed under strictly positive affine transformations. We prove that this geometric formulation is equivalent both to a reduction to the multi-affine setting via polarization and to a recursive criterion in terms of partial derivatives. The class of G{\aa}rding polynomials strictly extends that of real stable polynomials while preserving many of their structural properties. In particular, multi-affine G{\aa}rding polynomials with nonnegative coefficients satisfy the Rayleigh property, and their positive univariate specializations have ultra log-concave coefficient sequences. The G{\aa}rding property for several matroid generating functions is preserved under natural matroid operations. As applications, we derive new negative dependence results for generating functions associated with various classes of matroids and graphs, including examples previously beyond the scope of real stability and Lorentzian methods. We further obtain analogous results for characteristic polynomials arising from certain matrix classes.

Keywords

Cite

@article{arxiv.2604.27755,
  title  = {G{\aa}rding Polynomials},
  author = {Hao Fang and Biao Ma},
  journal= {arXiv preprint arXiv:2604.27755},
  year   = {2026}
}

Comments

84 pages, 1 figure, 1 table, 3 appendix

R2 v1 2026-07-01T12:43:26.247Z