Related papers: Two Useful Facts About Generating Functions
A fundamental computational task in probabilistic programming is to infer a program's output (posterior) distribution from a given initial (prior) distribution. This problem is challenging, especially for expressive languages that feature…
We define impulse response sequence in the set of all linear recurring sequences satisfying a linear recurrence relation of order $r$. The generating function and expression of the impulse response sequence are presented. Some identities of…
The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…
We connect a broad class of generative models through their shared reliance on sequential decision making. Motivated by this view, we develop extensions to an existing model, and then explore the idea further in the context of data…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
In this paper, we study a family of generating functions whose coefficients are polynomials that enumerate partitions in lower order ideals of Young's lattice. Our main result is that this family satisfies a rational recursion and are…
We sum multivariate generating functions composed of products of Chebyshev polynomials of the first and the second kind. That is, we find closed forms of expressions of the type $\sum_{j\geq0}\rho^{j}\prod_{m=1}^{k}T_{j+t_{m}}%…
In this short note we present a set of interesting and useful properties of a one-parameter family of sequences including factorial and subfactorial, and their relations to the Gamma function and the incomplete Gamma function.
We recover Gessel's determinantal formula for the generating function of permutations with no ascending subsequence of length m+1. The starting point of our proof is the recursive construction of these permutations by insertion of the…
A simple permutation is one that does not map a nontrivial interval onto an interval. It was recently proved by Albert and Atkinson that a permutation class with only finitely simple permutations has an algebraic generating function. We…
We use generating functions to express orthogonality relations in the form of $q$-beta integrals. The integrand of such a $q$-beta integral is then used as a weight function for a new set of orthogonal or biorthogonal
The generating function method that we had developing has various applications in physics and not only interress undergraduate students but also physicists. We solve simply difficult problems or unsolved commonly used in quantum, nuclear…
The generating function method is applied to the trace of the heat kernel and the one-loop effective action derived from the covariant perturbation theory. The basis of curvature invariants of second order for the heat kernel (Green…
Main purpose of this paper is to reconstruct generating function of the Bernstein type polynomials. Some properties this generating functions are given. By applying this generating function, not only derivative of these polynomials but also…
In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide…
We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…
Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by $u_1^{j/k} + u_2^{j/k} + ... + u_l^{j/k}$, $u_i \in \mathbb{Z}^+$, the number of values less than or equal to…
We consider generating functionals for computing correlators in quantum field theories with random potentials. Examples of such theories include condensed matter systems with quenched disorder (e.g. spin glass) or cosmological systems in…
The main focus of the present paper is to investigate several generating functions for a certain classes of functions associated to the Fox-Wright functions. In particular, certain generating functions for a class of function involving the…
The main object of this paper is to construct a new generating function of the (q-) Bernstein type polynomials. We establish elementary properties of this function. By using this generating function, we derive recurrence relation and…