Stable multivariate generalizations of matching polynomials

arXiv1905.02264MaRDI QIDQ6318302FDOQ6318302

Authors: Nima Amini 

Publication date: 6 May 2019

Abstract: The first part of this note concerns stable averages of multivariate matching polynomials. In proving the existence of infinite families of bipartite Ramanujan $d$-coverings, Hall, Puder and Sawin introduced the $d$-matching polynomial of a graph $G$, defined as the uniform average of matching polynomials over the set of $d$-sheeted covering graphs of $G$. We prove that a natural multivariate version of the $d$-matching polynomial is stable, consequently giving a short direct proof of the real-rootedness of the $d$-matching polynomial. Our theorem also includes graphs with loops, thus answering a question of said authors. Furthermore we define a weaker notion of matchings for hypergraphs and prove that a family of natural polynomials associated to such matchings are stable. In particular this provides a hypergraphic generalization of the classical Heilmann-Lieb theorem.

Mathematics Subject Classification ID

Graph polynomials (05C31) Algebraic combinatorics (05E99) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)

This page was built for publication: Stable multivariate generalizations of matching polynomials

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