Binomial sums and properties of the Bernoulli transform

Abstract

In this paper, we study the binomial sum Sn(q):=% nk=0Σ aknk( 1-q) kqn-k for a given sequence ( an) of real or complex numbers. We express Sn(q) in function of the powers of q, and, we explicit it when the sequence ( an) is the sequence of Fibonacci numbers, Laguerre polynomials, Meixner polynomials, binomial coefficients and the sequence [ n] p. We establish later some properties, relations, probabilistic interpretations and generating functions between Sn(q) and Sn(x+q-xq). Further identities related to Appell polynomials are also given in the last of the paper.

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…