Bernoulli Appells

The defining characteristic of the Bernoulli numbers operationally is that they are the basis of the unique Appell sequence, the Bernoulli polynomials, that “translate” simply under the generalized binomial transform (Appell property) and satisfy (for an analytic function, such as the exponential or logarithm, when convergent, or order by order for a formal power series) the umbral relation

f(B.(x+1))-f(B.(x))={f}'(x)=D_x \; f(x) \; \; ,

where D_x= \frac{d}{dx} \; is the derivative w.r.t. x \; . This then determines their umbral compositional inverse, the “reciprocal polynomials”, based on the reciprocal integers. From the derivative and translation property, the Euler-Maclaurin results follow easily as well as from the reciprocal e.g.f.s in operator form of the pair of Appell polynomials–that the e.g.f.s are reciprocals of each other, the operators are inverses, and the polynomials are umbral compositional inverses are inextricably linked. What isn’t evident from the Euler-Maclaurin perspective are the intimate associations to Lie theory, matrix reps, and simplices of this reciprocal pair of polynomials. In the previous post, I show some of the connections among the Bernoulli polynomials, their umbral reciprocals, Lie theory, matrix reps, and the simplices.

Other connections of the Bernoullis to geometry/topology/physics through alternating permutations ([MOQ][2]) and hence to integrals related to volumes of certain structures can be found in these articles by N. [Elkies][3] and by A. [Hodges][4] and C. [Sukumar][5], related to quantum Weyl-Heisenberg type algebras. Note the connections of the analyses to trig functions and the connection to hyperbolic functions of the raising/creation ops of the Bernoulli and reciprocal polynomials below. It is in this sense (and there is far more) that the dance of the Bernoullis and the reciprocals explains their presence (to me at least) in some many domains of math and physics.

First, a review of the Appell formalism. Appell polynomial sequences are an extension of the Kronecker delta base sequence \delta.=\delta.(0)=(1,0,0,0, \cdots.), i.e., (\delta.)^n=\delta_n=\delta_n(0). Translating the sequence to a higher plane through the enchanted binomials, we encounter the power basis

(\delta.(0)+x)^n= \sum_{k=0}^{n} \binom{n}{k}\delta_j(0)x^{n-j}=x^n=\delta_n(x)=(\delta_.(x))^n

with lowering (destruction / annihilation) operator L=D=\frac{d}{d(\delta.(x))}=\frac{d}{dx} and raising (creation) operator R=\delta_.(x) =x, i.e., D\; \delta_n(x)=n \cdot \delta_{n-1}(x), \;\;\; R \; \delta_n(x) = \delta_{n+1}(x)\;, with commutator [L,\;R] = [D,x] = 1.

(So already we see shadows of the Heisenberg-Weyl Lie algebra in the iconic Appell sequence, and it’s no surprise that the probabilist’s Hermite (Appell) polynomials appear for the harmonic oscillator in quantum mechanics and the Bernoullis for other Q.M. domains.)

The exponential generating fct. for the Appell sequence is then

E_{\delta}(x,t) = e^{\delta.(x)t}=e^{(\delta.(0)+x)t}=e^{\delta.(0)t}e^{xt}=e^{xt}

and an ordinary generating fct. O_{\delta}(x,t) is the formal Borel-Laplace transform of the e.g.f.

\int_{0}^{\infty } e^{\delta.(x)u}e^{-\frac{u}{t}}du=\frac{t}{1- \delta.(x)t}=\sum_{k \ge 0}\delta_{n}(x)t^{n+1}=t [1-(\delta.(0)+x)t]^{-1}.

We rise to an even higher plane with the intuitive Ramanujan and use his Master Formula (the Mellin transform) to make the indices continuous

\int_{0}^{\infty } e^{-\delta.(x)u}\frac{u^{s-1}}{(s-1)!}du=\frac{1}{ (\delta.(x))^{s}}= \delta_{-s}(x) =[1-[1-(\delta.(0) + x)]]^{-s}

so we have the Mellin transform or a Newton-Gauss interpolator for extending (and analytically continuing to the complex domain) the base sequence. For the Kronecker base sequence, this is x^{-s}.

Now simply apply the formalism to the Bernoulli numbers B.(0) and out pops the Bernoulli polynomials and the Hurwitz zeta function, which specializes to the Riemann zeta for x = 1, for which B.(x=1)=-B.(x=0).

Define the umbral compositional inverse \bar{\delta}.(x) by

\delta_n(\bar{\delta}.(x))= x^n = \bar{\delta}_n(\delta.(x)).

Then use the translation property twice to give

\delta_n(\bar{\delta}.(x))= (\delta.(0)+\bar{\delta}.(0)+x)^n =x^n,

and setting x=0 defines the base sequence of the umbral inverse as

(\delta.(0) + \bar{\delta}.(0))^n = \delta_n \; .

(Relation to Grothendieck’s axiomatic formulation of Chern class, courtesy of Wikipedia.(?))

Exponentiating helps us to readily interpret this as

e^{(\delta_.(0) + \bar{\delta}.(0))t} = e^{\delta.(0)t}e^{\bar{\delta}.(0)t}=e^{\delta.t}=1.

The e.g.f.s of the base sequences are reciprocals of each other. This means the base sequences (and these could be almost any abelian numbers, operators, matrices, etc.) are connected by the combinatorics of surjections and permutohedra [A133314][6] ([A049019][7]), among other important implications.

Back to the Bernoullis extended to polynomials defined by


with the umbral inverse polynomials, their escorts, the elegant reciprocal integers,



\bar{B}_n=\frac{(x+1)^{n+1}-x^{n+1}}{n+1}   and   \bar{B}_n(0)=\frac{1}{n+1}.

The e.g.f.s morphed into operators give you the Euler-Maclaurin expansion (and more since the two e.g.f.s for the base sequence are inverse by construction, independent of their interpretation as shift operators) .For an analytic function (or term by term for a formal power series) f,

\frac{D_y}{e^{D_y}-1}e^{xD_y}f(y)=e^{B.(x)D_y}f(y)= f(B.(x+y)),


\frac{e^{D_y}-1}{D_y}e^{xD_y}f(y)=e^{\bar{B}.(x)D_y}f(y)=f(\bar{B}.(x)+y)= f(\bar{B}.(x+y))

= D_y^{-1} [f(x+y+1) - f(x+y)],

where D_y^{-1} y^n/n!= y^{n+1}/(n+1)!.

The operators are clearly an inverse pair from the umbral inverse properties and commute, so


=\frac{D_y}{e^{D_y}-1}e^{xD_y}D_y^{-1} [f(y+1) - f(y)]=D_y^{-1}[f(B.(x+y+1)) - f(B(x+y))],

giving (consistent with the op defn. of the Bernoulli polynomials)

f(B.(x+y+1)) - f(B(x+y))= f'(x+y).

Using these properties and expanding (usually with asymptotic results, see Hardy, Divergent Series),

\frac{D_y}{e^{D_y}-1}e^{xD_y}=-\sum_{k\ge 0}e^{(n+x)D_y}D_y = \sum_{k\ge 1}e^{-(n-x)D_y}D_y,

the Euler-MacLaurin series can easily be generated as well as identities such as Faulhaber’s. Faulhaber’s formula follows simply from the umbral compositional relation, or equivalently, the operational definition of the Bernoulli polynomials acting on \frac{x^{s+1}}{s+1}, using the Appell translation property and B_n(0)=(-1)^nB_n(1) , which follows easily from the e.g.f. of the polynomials:

\bar{B}_s(B.(x))= \frac{(B.(x+1))^{s+1}-(B.(x))^{s+1}}{s+1}=x^s=D_x \frac{x^{s+1}}{s+1}, so summing and telescoping gives

\sum_{k=1}^n k^s = \frac{(B.(n+1))^{s+1}-(B.(1))^{s+1}}{s+1}=\frac{(B.(1)+n)^{s+1}-B_{s+1}(1)}{s+1}=\frac{(n-B.(0))^{s+1}-(-1)^{s+1}B_{s+1}(0)}{s+1} \; .

Similarly,  the same basic relations give,


=(1-B.(0))^{s+1}-(-1)^{s+1}B_{s+1}(0) \; .

Now to the raising operators, for the Bernoullis

R_B \;B_n(x) = e^{B.(0)D_x}x\;e^{\bar{B}.(0)D_x}B_n(x)= e^{B.(0)D_x}x\;B_n(\bar{B}.(x)) = e^{B.(0)D_x}x^{n+1}=(B.(0)+x)^{n+1}=B_{n+1}(x).

Likewise for the umbral inverse,

R_{\bar{B}} = e^{\bar{B}.(0)D_x}x\;e^{B.(0)D_x},

and we are conjugating the basic raising op for the Kronecker base sequence. There’s more hidden here, and we can reveal it by invoking a commutator and the Pincherle derivative:

R_B = x-x + e^{B.(0)D_x}x \; e^{\bar{B}.(0)D_x}= x - e^{B.(0)D_x}[e^{\bar{B}.(0)D_x},x].

For a general pair of lowering and raising ops, the Pincherle derivative is


so we expect the Bernoullis to pop up in all of these algebras one way or another, and we have several further interesting relations (recall the e.g.f.s are reciprocals):

R_B = x - e^{B.(0)D}\frac{d}{dD} e^{\bar{B}.(0)D} = x - \frac{d}{dD}ln[e^{\bar{B}.(0)D}] = x + \frac{d}{dD}ln[e^{B.(0)D}]

= -\frac{d}{dt} \ln[e^{\bar{B}.(-x)t}] |_{t=D_x} = \frac{d}{dt} \ln[e^{B.(x)t}] |_{t=D_x} \; ,

and so, with a simple change of sign,

R_{\bar{B}} = x + e^{B.(0)D}\frac{d}{dD} e^{\bar{B}.(0)D} = x + \frac{d}{dD}ln[e^{\bar{B}.(0)D}] = x - \frac{d}{dD}ln[e^{B.(0)D}],

which hold for general Appell sequences. For any Appell sequence, the raising op separates into x+g(D_x), so the commutator remains invariant upon substitution of any Appell raising op for x in the commutator. The Pincherle derivative is  “conjugated” by the basic underlying e.g.f. of each Appell sequence. But be careful–the derivative must be taken before any further operations are done, so at this level the advantages of normal conjugation in simplifying powers of an op do not apply; however, the advantage returns in another manifestation of the op.

More specifically for the Bernoulli couple, working out the Pincherle derivative and bouncing between e.g.f.s lead to a pairing and back to our familiar Riemann zeta

R_B = x + B.(0) e^{-B.(0)\bar{B}.(0)D}=x + \sum_{n \ge 0}(-1)^n\frac{B_{n+1}(0)}{n+1}\frac{D^n}{n!}=x+exp[\zeta(-n)D].

(\zeta(-n) in the exponential here is meant to be shorthand for (\zeta(-.))^n=\zeta(-n).)


R_B = x + exp[\zeta(-n)D], \;\;\;\;\;\;\; R_{\bar{B}} = x - exp[\zeta(-n)D].


R_B = x - \frac{1}{2}+ \sum_{n \ge 1} \zeta(1-2n) \frac{D^{2n-1}}{(2n-1)!}= x- \frac{1}{2}+ \sum_{n \ge 1} (-1)^n \frac{2 \zeta(2n)}{(2 \pi)^{2n}} D^{2n-1}

=x- \frac{1}{2}+\frac{1}{D_x} - \frac{1}{2}\coth\left [ \frac{D_x}{2} \right ]=- \frac{d}{dt} \ln[\frac{sinh(\frac{t}{2})}{\frac{t}{2}}\; e^{-(x-\frac{1}{2})t}] |_{t=D_x}\;.

So we can see how deeply entwined the reciprocals of the integers, the Riemann zeta, and the Bernoullis are with each other and important families of operator algebras. The following notes some further applications of these relations to diverse areas of mathematics.

Using the Mellin-Riemann-Ramanujan interpolation, the natural extension of the Bernoullis is the Hurwitz zeta function

B_{-s}(x)=s \sum_{n \ge 0}\frac{1}{(n+x)^{s+1}},

which with x=1 becomes s\cdot \zeta(s+1), and for the reciprocal integers,


The two are related through umbral composition and inversion, so that the pole singularities are reflected in each other. The Gauss-Newton series and umbral composition lead to the (ultimately divergent) expansion

\displaystyle \zeta(s)=\sum_{n \ge 0}(-1)^{n+1}\;\frac{(-s)!}{n!(2-s-n)!} \frac{2^{2-s}-2^n}{2^n}C_n,

but which gives very good results truncated to just eight terms over the range of reals -6 \le s \le 2–it’s capturing the dependence of zeta on the singularity, the falling factorials of s, and zeta’s first three simple zeroes as a truncated approximation–ten terms captures the dependence on the next zero, where C.=(1,1,5/6,1/2,1/10,-1/6,-5/42,1/6,...) , with e.g.f. (\frac{t}{1-e^{-t}})^2= (\frac{t}{e^t-1)})^2 \; e^{2t}  , are determined by C_n=(1-G.)^n=[1-B.(B.(1))]^n=(-1)^nB_n(B.(0)) in which G.=(1,0,-1/6,0,1/10,0,-5/42,0,...),  with the e.g.f. ( \frac{t}{e^t-1})^2 \; e^t , come from the umbral composition of the Bernoulli polynomials with the Bernoulli numbers B_n(1)=(-1)^nB_n(0). These then are specialized values of the generalized Bernoulli polynomials. (See a later entry for more details.)

The e.g.f. derivative operators associated to the Bernoulli  and reciprocal polynomials contain the same amount of information as the raising and lowering operators and are encountered perhaps most frequently in relation to the Euler-Maclaurin series  (but they are not necessarily the shortest or even rigorous route for solving problems). At the level of umbral composition interpreted in terms of operations on functions, the Euler-Maclaurin operations are equivalent to

f(B.(x+1))-f(B.(x)) = f{'}(x)


f(\bar{B}.(x))=\int_{x}^{x+1} f(u) \; du= \int_{0}^{1} f(x+u) \; du \; .

Coates and Givental, “[Quantum cobordisms and formal group laws][11]” (pg. 15), introduce the Bernoullis through Euler-Maclaurin. In another paper, (Dunne and Schubert, “[Bernoulli numbers identities from quantum field theory and topological string theory][12]”), the Bernoullis slip in through differentiation (pg 3) and the digamma fct, which is another raising operator for another Appell sequence (the gamma genus) involving the Riemann zeta for positive integer values and cyle index polynomials,  which has all the dressings of Chern characteristic classes (MOQ-[111165][13]). Recall that there is a reflection formula for the zeta fct, pg. 3 D & S  and  [MOQ-112062][14], relating the even positive integer values of zeta to the Bernoulli numbers as in the formulas for the raising ops above.

The Bernoulli and reciprocal polynomials arise often in relation to Lie theory–not surprisingly, given their connections to the exp and log and to differentiation and integration. Several applications can be found in the references below. Often the role of the reciprocal polynomials are not explicitly recognized. For example, this reference rife with the Bernoullis (thanks to [MOQ-16169][15] and Zoran Skoda) “[A universal formula for representing Lie algebra generators as formal power series with coefficients in the Weyl algebra][16]” by Durov, Meljanec, Samsarov, and Skoda  gives an alternate briefer proof of their results using a dual approach (coderivations) that runs parallel to the Appell formalism above, no doubt unaware of the connection. Page 43 Eqn.37 is a g.f. for a.\bar{B}.(T), umbrally evaluated, with a. and T in the paper. The authors also encounter in their original approach the Fibonnaci polynomials [A011973][17] (pg. 16), with no remark on their identity, which are also the Pascal rows read along anti-diagonals (no doubt connected to the duality) and therefore connected to the e.g.f. for \bar{B}.–they are also the coefficients for the characteristic polynomials of the Coxeter adjacency matrix for A_n, related to the Chebyshev polynomials of the second kind, and to Cartan matrices, and the shifted version, well, that has exciting connections to crossing partitions, positroids, and a general Appell sequence related to compositional inversion and … . The Appell formalism should bring out sharper connections between all these structures.

The o.g.f.s associated with the umbral pair have important applications as well. The o.g.f.

O_{\bar{B}.}(x,t) = ln\left [ \frac{1-xt}{1-(1+x)t)} \right ]=ln\left [ 1 + M[t,-(x+1)]\right ]

where M(t,x)=t/(1+tx) with inverse M(t,-x), a special Mobius transformation (which is the iconic o.g.f.), has the compositional inverse

O_{\bar{B}.}^{(-1)}(x,t)=M\left [ e^t-1, (1+x) \right ]=\frac{e^t-1}{1+(1+x)(e^t-1)}.

The forms M(g(t),x) are related to colored compositions. You can read how the inverse o.g.f. is related to Eulerians, permutahedra, probablity theory, a Weierstrass elliptic function, and a formal group law, related to a generalized cohomology, through comments and references in [A008292][18] and [A074909][19]. It can also be rewritten in terms of the e.g.f.s of the Bernoullis and their umbral inverses. (The combinatorics that underlie reciprocation and compositional inversion are those of the permutahedra, associahedra, crossing partitions, and the myriad combinatoric structures related to them, so no surprise that they make an appearance in all this.)

So, we have this interplay among the Mobius transformation, reciprocation and mutiplicative inversion, umbral and regular composition, and umbral and regular compositional inversion of the logarithm and the exponential that accounts in my mind for the prevalence of the Bernoullis and pairing with the reciprocal integers, and of course the royal binomials (Pascal matrix). The Bernoullis are intimately related to differentiation and, therefore, clearly to the exponential; e^{B.(x+1)}-e^{B.(x)}=De^x=e^x defines them, and the connection of the exponential operator to Lie theory, movement around a manifold, is the fundamental action translation, which is also at the heart of the Appell formalism, in both the indices and the independent variable.

O_{\bar{B}}^{(-1)}(x,t) is an e.g.f. for signed reverse face polynomials of the permutahedra and has the infinitesimal generator

g(x,u)\frac{d}{du} = [(1-xu)(1-(1+x)u)]\;\frac{d}{du},


exp\left [ t\;g(x,u)\;\frac{d}{du} \right ]\;u\; |_{u=0} = O_{\bar{B}}^{(-1)}(x,t).

G. Rzadkowski in “[Bernoulli numbers and solitons revisited][20]” explicitly shows the links between derivatives of g(x,u) to solutions of the Ricatti differential equation, soliton solns. of the KdV equation, and the Eulerian and Bernoulli numbers. To apply the results here, let  \frac{dz}{dt}=\frac{df(t)}{dt}=g(f(t))=g(z) with z=f(x,t) =O^{(-1)}_{\bar{B}}(x,t) \; and note the ODEs in A145271; i.e.,

\frac{dz(x,t)}{dt}=\frac{dO_{\bar{B}.}^{(-1)}(x,t)}{dt}=g(x,O_{\bar{B}.}^{(-1)}(x,t))=g(x,z(x,t ))=(1-xz)(1-(1+x)z)

=1-(1+2x)z+x(1+x)z^2=x(1+x)(z-\frac{1}{x})(z-\frac{1}{1+x}) \; .

For more on the Ricatti equation, see “Lie systems: theory, generalisations, and applications”  by  Carinena and Lucas (,  “Dirac-Lie systems and Schwarzian equations” by Carinena, Grabowski, Lucas, and Sardon (, and other refs below.

In addition, the comp. inversion formula [A145271][21] connects products of derivatives of g(x,u) and the refined Eulerian numbers to O^{(-1)}_{B.}(x,t), which gives the face polynomials for the dual of the permutohedra. Or, apply the inversion method of [A134264][23] (intimately related to Appell polynomials in general and associated interpolated families of polynomials spanning the Coxeter group A_n) to

h(x,t) = \frac{t}{O_{\bar{B}.}^{(-1)}(x,t)} = (1+x)t+\frac{t}{e^t-1} = 1 + (1+x)t + 2! B_2 + 3!B_3 + \;...

and you get a relation between noncrossing partitions or Dyck lattice paths weighted by the normalized Bernoullis and the face polynomials of the simplices. (Now morph all of this into totally non-negative grassmannians, positroids, binary trees, operads, and computations of characteristic classes of genera (Hirzebruch) and you have can have an exciting math weekend. Don’t forget moments, cumulants, and continued fractions.)

For relations to Hirzebruch genera / Todd class, see my other entries here.

The formulations above apply to the symmetric functions quite nicely. The generating functions for the complete homogeneous symmetric functions,  the elementary symmetric functions, and the power sums, H(t), E(t), and P(t), respectively, (cf., e.g., Macdonald, “A new class of symmetric functions” and Newton Identities on Wikipedia) satisfy

H(t)E(-t)=1 \; , and P(t)=D_t \ln (H(t))=\frac{H{'}(t)}{H(t)},

so, for the raising ops of the symmetric polynomials, the analogs of the raising ops for the Bernoulli polynomials

R_B=x + \frac{d}{dD}ln[e^{B.(0)D}]     are

R_H=x + \frac{d}{dD}ln(H(D))=x+ P(D)\;      and

R_E=x+ \frac{d}{dD}ln(E(-D))=x - P(D) \;,

whose n’th iterates will generate Appell polynomials in x, e.g., A_H(x,t) =e^{t \; R_H}1, that when  evaluated at x=0 are proportional to the complete and elementary symmetric polynomials, i.e., n! h_n(x_1, ... ,x_k) and n! e_n(x_1, ... , x_k). The series have the generating functions

H(t)=\frac{1}{1-h.t}= \prod_i \; (1-x_it)^{-1} \; ,

E(t)=\frac{1}{1-e.t}= \prod_i \; (1+x_it) \; ,     and

 P(t)= \frac{p.}{1-p.t}=\sum_i \frac{x_i}{1-x_i t}=p_1+p_2t+p_3t^2+ \cdots \; .

By taking logs, the first two sets of symmetric polynomials can be related to the power sums through the cycle index partition polynomials of the symmetric group, expessed umbrally as

A_H(0,t)= \frac{1}{1-h.t} =e^{t\; R_H}1 \; |_{x=0}=e^{<- ln(1-p.t)>} \; ,

where \displaystyle < \cdots >  demarks the level at which umbral evaluation must occur. See the Wiki article for explicit expressions of the symmetric polynomials and my MOQ on the Riemann zeta and an Appell sequence related to fractional calculus to see how info on the simplices are encoded in the numerical coefficients . The extended elementary and complete homogeneous symmetric polynomials are Appell sequences by construction and in fact are an umbral compositional inverse pair with all the nice properties of such sequences.

Note also that e.g.f.s for Appell polynomials satisfy an evolution equation determined by the raising op:

D_t \; e^{A.(x)t} = R_A \; e^{A.(x)t} , so

e^{\nu \; D_{t}} \; e^{A.(x)t} = e^{A.(x)(t+\nu)} = e^{\nu \; R_A} \; e^{A.(x)t} \; .

If we look at the Mellin transform for the Riemann zeta function and interpret it as an interpolation of the coefficients of the e.g.f. of the Bernoulli numbers, we can make a case for Ramanujan’s method of summation of the divergent zeta series. Make these heuristic, formal associations

\frac{1}{e^t-1}=\sum_{n \ge 1}e^{-{nt}} \rightarrow \sum_{j \ge 0}\left ( \sum_{n \ge 1} n^j \right )\frac{(-t)^j}{j!}=e^{-a.t} \rightarrow \sum_{j \ge 0}\zeta (-j)\frac{(-t)^j}{j!}.

Then using Riemann’s Mellin transform definition of the Riemann zeta function

s\zeta(s+1)= \int_{0}^{\infty} \frac{t}{e^t-1} \frac{t^{s-1}}{(s-1)!} \; dt = \int_0^{\infty} e^{-B.(1)t}\frac{t^{s-1}}{(s-1)!} \; dt=B_{-s}(1) \; ,


B_n(1)=-n \zeta(1-n) \;   or  \frac{-B_{n+1}(1)}{n+1}=\frac{(-1)^{n}B_{n+1}(0)}{n+1}=\zeta(-n) \; .

Similarly, but formally,

\zeta(s)= \int_{0}^{\infty} \frac{1}{e^t-1} \frac{t^{s-1}}{(s-1)!} \; dt = \int_{0}^{\infty} e^{-a.t}\frac{t^{s-1}}{(s-1)!} \; dt=a_{-s} \; \; ,

so, from the formal definition of a_n  above,  \zeta(-n)=a_n= \sum_{k \ge 1} k^n (not literally, only formally, of course, as Hardy had the breadth, keeness, and generousity of mind to recognize), and working in reverse interchanging summations, we have our Ramanujan summation of divergent series typically resulting from the formal interchanges of summations and integrations as Euler, Heaviside,  Hardy, and Ramanujan put to such exemplary use.

You could also view the derivative component of the raising op of the Bernoulli polynomials as an associated series for a regularized Chern character (the finite part), using Faulhaber’s formula in the limit as m  tends to infinity, with

\frac{\zeta(-s)}{s!}= \frac{-B_{s+1}(1)}{(s+1)!}=\frac{1}{s!}[ \; [\sum_{k=1}^{m}k^s]-\frac{(B.(1)+m)^{s+1}}{s+1}] \; .

Compare with the Chern character for a sum of line bundles

ch(V)=e^{x_1}+ \cdots \; + e^{x_m}=\sum_{s \ge 0} \frac{1}{s!} (x_1^s+ \cdots \; + x_m^s) \; .

The remaining notes here focus on  a particular formal group law (FGL), noted in the generalized Todd class entry here, related to the Lah numbers. For other FGLs, see the other entries here on the Bernoullis. The more general Chern theory of classes seems to be related to the cycle index partition polynomials (CIP) of the symmetrc group being an Appell sequence in the indeterminate x_1 more than to specific properties of the Bernoulli polynomials; however, the Lah polynomials do appear in the discussion, and the  CIP can be considered umbral generalizations of the Lah polynomials, as I show in my notes Lagrange a la Lah.

There are several topics related to the discussion on formal group laws in the Todd class entry. First, the CIP and Lah polynomials are related to enumeration of binary trees and, I believe, therefore, to binary quadratic operads. Frederic Chapoton writes about the two, and Don Rawlings has a comprehensive view of binary trees in “A binary tree decomposition space on permutation statistics”. Tree reps for special polynomials are not unique–different tree reps fit different contexts, e.g., the Lah polynomials and CIPs can be represented by weighted Cayley forests of binary (but not strictly binary) trees  representing the iterated ops [(1+x)^2D_x]^n \;, which can also be used for Lagrange inversion.

Second, the falling factorials (x)_{n}=\frac{x!}{(x-n)!} \; , and the rising factorials (x)_{\bar{n}}=\frac{(x+n-1)!}{(x-1)!} \; are related through the signed Lah polynomials, which are in turn related to the associated Laguerre polynomials Lag^{\alpha}_n(x)= \sum_{k=0}^{n} \binom{n+\alpha}{k+\alpha} \frac{(-x)^k}{k!} \; by Lah_n(x)=n! Lag^{-1}_n(x)\; :

Lah_n((x)_{\bar{.}})=(-1)^n(x)_{n} and Lah_n(-(x).)=(x)_{\bar{n}} \; .

These can be confirmed using the Vandermonde identities and (-1)^n\binom{-x}{n} =\binom{x+n-1}{n} \;, or through the formalism of connection coefficients presented by Mullin and Rota in “On the Foundations of Combinatorial Theory III Theory of Binomial Enumeration. ” A third way is through the operational relations



=x^{-n}x(xDx)^nx^{-1}=x^{-n}(x^2D)^n=n!xLag^0_n(-:xD:)x^{-1} ,

where (:AB:)^n=A^nB^n \;, by definition, for any pair of operators. These are concommitant with the umbral inverse relationship (\phi.(x))_{n}=x^n=\phi_n((x).)\; , where \phi_n(x) \; are the Bell polynomials defined operationally by (xD)^n=\phi_n(:xD:) \; or by the e.g.f. e^{x(e^t-1)}=e^{t\phi.(x)} \; . The umbral compositional inverses of the Bell polynomials are then given by the compositional inverse of e^t-1 \; , which is ln(1+x) \;, through e^{xln(1+t)}=(1+t)^x=e^{t(x).} \;. That the rising factorial and the Bell polynomials are umbral inverses follows from the inverse pair of functions:


The signed Lah polnomials themselves are a binomial Sheffer sequence that is obviuosly self-inverse under compositional inversion, as can be seen from their series and operational definitions above as well as their e.g.f. , i.e., e^{x\frac{t}{t-1}}=e^{tLah.(x)}, which can be derived from their op definition.

Combinatorial interpretations of the rising and falling factorial polynomials can be found on the OEIS and in “Set maps, umbral calculus, and the chromatic polynomial” by G. Wiseman, “Chromatic polynomials and partition systems” by C. Lenart and  N. Ray, and “From sets to functions: three elementary examples” by  Joni and Rota, in addition to the other Rota reference.

Related stuff:

For diagrammatic presentations of the number arrays discussed here, see Robert Dickau’s website .

Note the relation of the Bernoulli numbers to the zigzag numbers OEIS-000111 (cf. Wikipedia, Hodges and Sukumar references, alternating permutations.)

Papers by Franz Lehner et al. on cumulants with relations to log of the momemt generating function, non-crossing partitions, composition, multiplicative reciprocals, and Lagrange inversion:, Relations between cumulants in noncommutative probability, Cumulants, lattice paths, and orthogonal polynomials,  Free cumulants and enumeration of connected partitions

Papers by Di Nardo et al. on cumulants and umbral calculus.

“The Magnus expansion, trees, and Knuth’s rotation correspondence” by Ebrahimi-Fard and Manchon

“Hodge Integrals and Gromov-Witten” by Faber and Pandharipande

“Quantum Barnes function as the partition function of the resolved conifold” by Koshkin

“Geometry and physics” by Atiyah, Dijkgraaf, and Hitchin

“Hopf algebras in dynamical systems theory” by Carinena, Ebrahimi-Fard, Figueroa, and Gracia-Bondi

“Functional equations and Lie algebras” by E. Petracci

“Clifford algebras and Lie groups” (2011 2009 lecture notes, 2011 version) by E. Meinrenken

“On dynamical r-matrices obtained from Dirac reduction and their generalizations to affine Lie algebras” by Feher, Gabor, and Pusztai

“A note on a canonical dynamical r-matrix” by Pusztai ad Feher

“The Kashiwara-Vergne conjecture and Drinfelds’s associators” by Alekseev and Torossian

“On triviality of the Kashiwara-Vergne conjecture for quadratic Lie algebras” by Alekseev and Torossian

For other refs on the Ricatti equation and linear fractional transformations see

“Hopf algebras in dynamical systems theory” by Carinena, Ebrahimi-Fard, Figueroa, Gracia-Bondi

“Elie Cartan and geometric duality” and “An introduction to Lie groups and symplectic geometry” by Robert Bryant

“Lie algebras, representations, and analytic semigroups through dual vector fields” by P. Feinsilver

For the Todd operator, see “Computing the continuous discretely” by Beck and Robbins

For more on relations to the Duflo isomorphism and wheel diagrammatics see “Wheeling: A diagrammatic analogue of the Duflo isomorphism” by D. Thurston and “Differential operators and the wheels power series” by Kricker

For some discussion of Kummer congruences for reciprocal pairs of Appell sequences, see “Applications of the classical umbral calculus” by Ira Gessel






















[22]: [23]:

This entry was posted in Math and tagged , , , , , , , , , , , , , , , , . Bookmark the permalink.

2 Responses to Bernoulli Appells

  1. Tom Copeland says:

    Another ref. on cotangent(x): “The relationship of the cotangent function to special relativity, silver means, p-cycles, and chaos theory” by Kappraff and Adamson.

  2. Pingback: The Pincherle Derivative and the Appell Raising Operator | Shadows of Simplicity

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s