Generalizing Tuenter's binomial sums
From MaRDI portal
Bernoulli random walkbinomial sum identityCatalan numberDumont-Foata polynomialexplicit formulagenerating functionGenocchi numbermomentpolynomial interpolationsecant numbertangent number
Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Binomial coefficients; factorials; (q)-identities (11B65) Moment problems (44A60) Sums of independent random variables; random walks (60G50)
Abstract: Tuenter [Fibonacci Quarterly 40 (2002), 175-180] and other authors have considered centred binomial sums of the form [S_r(n) = sum_k �inom{2n}{k}|n-k|^r,] where and are non-negative integers. We consider sums of the form [U_r(n) = sum_k �inom{n}{k}|n/2-k|^r] which are a generalisation of Tuenter's sums as but is also well-defined for odd arguments . may be interpreted as a moment of a symmetric Bernoulli random walk with steps. The form of depends on the parities of both and . In fact, is the product of a polynomial (depending on the parities of and ) times a power of two or a binomial coefficient. In all cases the polynomials can be expressed in terms of Dumont-Foata polynomials. We give recurrence relations, generating functions and explicit formulas for the functions and/or the associated polynomials.
Recommendations
Cited in
(4)
This page was built for publication: Generalizing Tuenter's binomial sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5246242)