Generalising Tuenter's binomial sums

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…