On a conjecture on sparse binomial-type polynomials by Brown, Dilcher and Manna
classification
🧮 math.CA
keywords
binomial-typebrownconjecturedilchergraphmannapolynomialssparse
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.