Abstract

Two conjectures of Su and Wang (2008) concerning binomial coefficients are proved. For n ⩾ k ⩾ 0 and b > a > 0 , we show that the finite sequence C j = ( n + j a k + j b ) is a Pólya frequency sequence. For n ⩾ k ⩾ 0 and a > b > 0 , we show that there exists an integer m ⩾ 0 such that the infinite sequence ( n + j a k + j b ) , j = 0 , 1 , … , is log-concave for 0 ⩽ j ⩽ m and log-convex for j ⩾ m . The proof of the first result exploits the connection between total positivity and planar networks, while that of the second uses a variation-diminishing property of the Laplace transform.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.