On Bernoulli Sums and Bernstein Polynomials - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2012

On Bernoulli Sums and Bernstein Polynomials

Abstract

In the paper we discuss a technology based on Bernstein polynomials of asymptotic analysis of a class of binomial sums that arise in information theory. Our method gives a quick derivation of required sums and can be generalized to multinomial distributions. As an example we derive a formula for the entropy of multinomial distributions. Our method simplifies previous work of Jacquet, Szpankowski and Flajolet from 1999.
Fichier principal
Vignette du fichier
dmAQ0115.pdf (288.85 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01197242 , version 1 (11-09-2015)

Identifiers

Cite

Jacek Cichoń, Zbigniew Gołębiewski. On Bernoulli Sums and Bernstein Polynomials. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.179-190, ⟨10.46298/dmtcs.2993⟩. ⟨hal-01197242⟩

Collections

INSMI TDS-MACS
146 View
1503 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More