Related papers: The generating function of A348410 in OEIS using t…
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.
In this work, we present a series of bijections that reveal the deep connections between the concepts of tree records, the girth of a connected endofunction, and the genesis sequence, the first sequence in the OEIS. We use these results to…
Generating functions for Clebsch-Gordan coefficients of osp(1|2) are derived. These coefficients are expressed as q goes to - 1 limits of the dual q-Hahn polynomials. The generating functions are obtained using two different approaches…
Let $\Gamma\subset PSL_2(\mathbb{R})$ be a Fuchsian group of the first kind which has a cusp $i\infty$ of width one. In this paper, we first consider a generating function formed with the Niebur--Poincar\'e series $\{F_{m,s}(\tau)\}_{m\ge…
Gessel's famous Bessel determinant formula gives the generating function of the number of permutations without increasing subsequences of a given length. Ekhad and Zeilberger proposed the challenge of finding a suitable generalization for…
We describe two general mechanisms for producing pairing bijections (bijective functions defined from N x N to N). The first mechanism, using n-adic valuations results in parameterized algorithms generating a countable family of distinct…
The double sum sum_(j=0)^m sum_(i=0)^j (-1)^(j-i) C(m,j) C(j,i) C(j+k+qi,j+k) with free nonnegative integer parameters k and q is rewritten as hypergeometric series. Efficient formulas to generate the C-finite ordinary generating functions…
We discuss a method for computing the generating function for the multiplicity distribution in field theories with strong time dependent external sources. At leading order, the computation of the generating function reduces to finding a…
We compute the numbers g(n,2,2) of nilpotent groups of order n, of class at most 2 generated by at most 2 generators, by giving an explicit formula for the Dirichlet generating function \sum_{n=1}^\infty g(n,2,2)n^{-s}.
This paper introduces a class of extended central factorial numbers generated by a parity-dependent recurrence relation, termed the "flickering operator". We demonstrate that the resulting triangular structure, now indexed as OEIS A395021,…
This is the first of two articles devoted to a comprehensive exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product…
Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into distinct parts is relatively easy (in fact it equals the…
The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size -3,-5,-7,... . For such paths, we find the generating functions of them, according to length, ending at level $i$,…
In a 1977 paper, Diaconis and Graham studied what Knuth calls the total displacement of a permutation $w$, which is the sum of the distances $|w(i)-i|$. In recent work of the first author and Tenner, this statistic appears as twice the type…
The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…
We deduce asymptotic formulas for the alternating sums $\sum_{n\le x} (-1)^{n-1} f(n)$ and $\sum_{n\le x} (-1)^{n-1} \frac1{f(n)}$, where $f$ is one of the following classical multiplicative arithmetic functions: Euler's totient function,…
Lame equation arises from deriving Laplace equation in ellipsoidal coordinates; in other words, it's called ellipsoidal harmonic equation. Lame function is applicable to diverse areas such as boundary value problems in ellipsoidal geometry,…
This paper analyzes over 30 types of q-series and the asymptotic behavior of their expansions. A method is described for deriving further asymptotic formulas using convolutions of generating functions with subexponential growth. All…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
We establish an alternative, ``perpendicular" collection of generating functions for the coefficients of Gaussian polynomials, $\begin{bmatrix}N+m\\m\end{bmatrix}_q$. We provide a general characterization of these perpendicular generating…