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

2013/10/19 by Wolfgang Gawronski, Gawronski, Wolfgang, Thorsten Neuschel +1
Mathematics · #Advanced Combinatorial Mathematics #Classical Analysis and ODEs (math.CA) #FOS: Mathematics #Graph theory and applications #Markov Chains and Monte Carlo Methods #Mathematical functions and polynomials #Stochastic processes and statistical mechanics #math.CA

paper · pdf · doi:10.48550/arxiv.1310.5256

12 pages

openalex publication_date 2013/10/19 · arxiv created 2014/02/27 · arxiv updated 2014/02/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Some Properties of a Class of Sparse Polynomials
• On the asymptotics of a sequence of lacunary binomial-type polynomials
• A graph polynomial for independent sets of bipartite graphs
• Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
• Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph