English

Generalising Tuenter's binomial sums

Combinatorics 2015-01-28 v4

Abstract

Tuenter [Fibonacci Quarterly 40 (2002), 175-180] and other authors have considered centred binomial sums of the form Sr(n)=k(2nk)nkr,S_r(n) = \sum_k \binom{2n}{k}|n-k|^r, where rr and nn are non-negative integers. We consider sums of the form Ur(n)=k(nk)n/2krU_r(n) = \sum_k \binom{n}{k}|n/2-k|^r which are a generalisation of Tuenter's sums as Sr(n)=Ur(2n)S_r(n) = U_r(2n) but Ur(n)U_r(n) is also well-defined for odd arguments nn. Ur(n)U_r(n) may be interpreted as a moment of a symmetric Bernoulli random walk with nn steps. The form of Ur(n)U_r(n) depends on the parities of both rr and nn. In fact, Ur(n)U_r(n) is the product of a polynomial (depending on the parities of rr and nn) 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 Ur(n)U_r(n) and/or the associated polynomials.

Keywords

Cite

@article{arxiv.1407.3533,
  title  = {Generalising Tuenter's binomial sums},
  author = {Richard P. Brent},
  journal= {arXiv preprint arXiv:1407.3533},
  year   = {2015}
}

Comments

17 pages, 2 appendices, corrected typos in v2, added OEIS references in v3, corrected abstract in v4

R2 v1 2026-06-22T05:03:05.164Z