Over a million developers have joined DZone.
{{announcement.body}}
{{announcement.title}}

Log Concave Coefficients

DZone's Guide to

Log Concave Coefficients

· Big Data Zone ·
Free Resource

Hortonworks Sandbox for HDP and HDF is your chance to get started on learning, developing, testing and trying out new features. Each download comes preconfigured with interactive tutorials, sample data and developments from the Apache community.

A few days ago I wrote about the rise and fall of binomial coefficients. There I gave a proof that binomial coefficients are log-concave, and so a local maximum has to be a global maximum.

Here I’ll give a one-line proof of the same result, taking advantage of the following useful theorem.

Let p(x) = c0 + c1x + c2x2 + … + cnxn be a polynomial all of whose zeros are real and negative. Then the coefficient sequence ck is strictly log concave.

This is Theorem 4.5.2 from Generatingfunctionology, available for download here.

Now for the promised one-line proof. Binomial coefficients are the coefficients of (x + 1)n, which is clearly a polynomial with only real negative roots.

The same theorem shows that Stirling numbers of the first kinds(nk), are log concave for fixed n and k ≥ 1. This because these numbers are the coefficients of xk in

(x + 1)(x + 2) … (x + n – 1).

The theorem can also show that Stirling numbers of the second kind are log-concave, but in that case the generating polynomial is not so easy to write out.

Hortonworks Community Connection (HCC) is an online collaboration destination for developers, DevOps, customers and partners to get answers to questions, collaborate on technical articles and share code examples from GitHub.  Join the discussion.

Topics:

Published at DZone with permission of

Opinions expressed by DZone contributors are their own.

{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.urlSource.name }}