Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Stable multivariate generalizations of matching polynomials (1905.02264v2)

Published 6 May 2019 in math.CO

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.

Summary

We haven't generated a summary for this paper yet.