On a conjecture on sparse binomial-type polynomials by Brown, Dilcher and Manna
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.