Explicit, recurrent, determinantal expressions of the kth power of formal power series and applications to the generalized Bernoulli numbers

Abstract

In this work, the authors provide closed forms and recurrence expressions for computing the kth power of the formal power series, some of them in terms of a determinant of some matrices. As a consequence, we obtain the reciprocal of the unit of any formal power series. We apply these results to the generalized Bernoulli numbers and Bernoulli numbers, we derive new closed-form expressions and some recursive relations of these famous numbers. In addition, we present several identities in determinant form. Using these results, an elegant generalization of a well known identity of Euler is presented. We also note some connections between the Stirling numbers of the second kind and the generalized Bernoulli numbers.

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…