Symmetric functions and a natural framework for combinatorial and number theoretic sequences (Q6132979): Difference between revisions

The paper under review investigates some particular triples of power series. The author discusses Arbogast's formula (a.k.a. Faà di Bruno's formula), De Moivre polynomials, symmetric polynomials, symmetric triples (including Stirling numbers, harmonic numbers, generalized Pascal identities, and hypergeometric summation identities), \(q\)-series (including \(q\)-binomial coefficients, partition polynomials, and triangular numbers), and compositional inverses. Throughout the paper, the author provides numerous interesting and helpful examples, including those concerning binomial coefficients, Hermite polynomials, Bernoulli numbers, Bernoulli polynomials, Eulerian polynomials, hyperbolic sine, Gamma function, D'Arcais polynomials, triangular numbers, Schur's identity, Lucas sequences, and Chebyshev polynomials. The motivation and most of the background material come from \textit{I. G. Macdonald} [Symmetric functions and Hall polynomials. 2nd ed. Oxford: Clarendon Press (1995; Zbl 0824.05059)], \textit{A. De Moivre} [Philos. Trans. R. Soc. Lond. 19, No. 230, 619--625 (1697)] and \textit{Z.-H. Sun} [J. Number Theory 114, No. 1, 88--123 (2005; Zbl 1197.11021)]. Sun examined some properties of Newton-Euler pairs, and Macdonald provided a basic structure for combinatorial and number theoretic sequences, including Stirling, Bernoulli, harmonic numbers, as well as partitions of different kinds.