arXiv Analytics

Sign in

arXiv:1310.5256 [math.CA]AbstractReferencesReviewsResources

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

Wolfgang Gawronski, Thorsten Neuschel

Published 2013-10-19, updated 2014-02-27Version 3

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.

Comments: 12 pages
Categories: math.CA
Related articles: Most relevant | Search more
arXiv:1401.6357 [math.CA] (Published 2014-01-24)
On a conjecture of Widom
arXiv:1504.03591 [math.CA] (Published 2015-04-14)
An elementary approach to asymptotic behavior in the Cesàro sense and applications to the Laplace and Stieltjes transforms
arXiv:1503.00172 [math.CA] (Published 2015-02-28)
Fourier quasicrystals and Lagarias' conjecture

Links

Toolbox