Alphabet splitting
This is one of the papers in the recent series in which the author develops that symmetric functions are lurking behind many parts of combinatorial and special functions theory where one would not expect them. The principal message is that many calculations become much more transparent, and often easier and less surprising, when recast in the language of symmetric functions, more precisely: in the language of \(\lambda\)-ring calculus. In the paper under review, he devotes himself to umbral calculus. The backbone of this theory is the Lagrange inversion formula. The author shows that the Lagrange inversion formula has a very elegant formulation in terms of \(\lambda\)-ring calculus. In this formulation, the addition of alphabets is the basic ingredient, which, together with its inverse, the splitting of alphabets, is the main focus of this article. On the basis of that, several examples are given how classical identities and facts can be reformulated, seen, respectively proved in this alternative language, and how sometimes more general statements can be made. Occasionally, curious side results are obtained, such as an interesting determinantal representation for the Bernoulli numbers. But, as the author says: It will be much easier for me to give a longer list of examples when \(\lambda\)-rings are taught at school. For the entire collection see [Zbl 0956.00018].
This page was built for publication: Alphabet splitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2704226)
