Related papers: Two Useful Facts About Generating Functions
We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…
Automatic generation of sequences has been a highly explored field in the last years. In particular, natural language processing and automatic music composition have gained importance due to the recent advances in machine learning and…
This paper presents a reinterpretation of a second-order linear recurrence sequence as a sequence of continuants derived from the convergents to a continued fraction. As a result, we are able to derive the generating function and Binet…
Motivated by permutation statistics, we define for any complex reflection group W a family of bivariate generating functions. They are defined either in terms of Hilbert series for W-invariant polynomials when W acts diagonally on two sets…
Two types of finite series of products of harmonic numbers involving nonnegative integer powers are evaluated, also yielding two other important harmonic number identities. The recursion formulas for these sums are derived, which are easily…
Functional equations (FE) arise quite naturally in the analysis of stochastic systems of different kinds : queueing and telecommunication networks, random walks, enumeration of planar lattice walks, etc. Frequently, the object is to…
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.
It is shown how the generating functional method of De Dominicis can be used to solve the dynamics of the original version of the minority game (MG), in which agents observe real as opposed to fake market histories. Here one again finds…
We study here a sequence of secondary measures, so called because the set of secondary polynomials on a given term become orthogonal for the next measure. The main result is a formula making explicit the density of any term of the sequence,…
The algebra of symmetric functions contains several interesting families of symmetric functions indexed by integer partitions or skew partitions. Given a sequence $\{u_n\}$ of symmetric functions taken from one of these families such that…
We study the problem of generating interesting endings for stories. Neural generative models have shown promising results for various text generation problems. Sequence to Sequence (Seq2Seq) models are typically trained to generate a single…
We present an overview of the role of generating functions in quantum mechanical contexts, mainly in the modern theory of polarization and in the study of quantum phase transitions. Generating functions enable the derivation of moments and…
We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…
For use in calculating higher-order coherent- and squeezed- state quantities, we derive generalized generating functions for the Hermite polynomials. They are given by $\sum_{n=0}^{\infty}z^{jn+k}H_{jn+k}(x)/(jn+k)!$, for arbitrary integers…
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.
We show that the reciprocal of a partial sum with 2m terms of the alternating exponential series is the exponential generating function for permutations in which every increasing run has length congruent to 0 or 1 modulo 2m. More generally…
Sequences whose terms are equal to the number of functions with specified properties are considered. Properties are based on the notion of derangements in a more general sense. Several sequences which generalize the standard notion of…
This work concerns a construction of pattern-avoiding inversion sequences from right to left we call the generating tree growing on the left. We first apply this construction to inversion sequences avoiding 201 and 210, resulting in a new…