On a conjecture on sparse binomial-type polynomials by Brown, Dilcher and Manna

TL;DR

This paper proves a conjecture regarding the asymptotic behavior of sparse binomial-type polynomials, which are connected to the expected number of independent sets in a graph, advancing understanding in graph theory and polynomial analysis.

Contribution

The paper provides a proof of a conjecture on the asymptotics of sparse binomial-type polynomials related to graph theory, a novel result in this mathematical area.

Findings

Confirmed the conjecture on asymptotic behavior

Connected polynomial properties to graph independent sets

Enhanced understanding of sparse binomial-type polynomials

Abstract

We prove a conjecture by Brown, Dilcher and Manna on the asymptotic behavior of sparse binomial-type polynomials arising naturally in a graph theoretical context in connection with the expected number of independent sets of a graph.