English
Related papers

Related papers: The generating function of A348410 in OEIS using t…

200 papers

Every binary De~Bruijn sequence of order n satisfies a recursion 0=x_n+x_0+g(x_{n-1}, ..., x_1). Given a function f on (n-1) bits, let N(f; r) be the number of functions generating a De Bruijn sequence of order n which are obtained by…

Combinatorics · Mathematics 2017-05-23 Don Coppersmith , Robert C. Rhoades , Jeffrey M. VanderKam

We use connection relations and series rearrangement to generalize generating functions for several higher continuous orthogonal polynomials in the Askey scheme, namely the Wilson, continuous dual Hahn, continuous Hahn, and…

Classical Analysis and ODEs · Mathematics 2014-10-24 Michael A. Baeder , Howard S. Cohl , Hans Volkmer

This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.

General Mathematics · Mathematics 2024-05-03 Robert Reynolds

The main aim of this paper is to provide a unified approach to deriving identities for the Bernstein polynomials using a novel generating function. We derive various functional equations and differential equations using this generating…

Classical Analysis and ODEs · Mathematics 2018-11-19 Yilmaz Simsek

This paper resolves an open problem raised by Ekhad and Zeilberger for computing $\omega(10000)$, which is related to Stern's triangle. While $\nu(n)$, defined as the sum of squared coefficients in $\prod_{i=0}^{n-1} (1 + x^{2^i} +…

Combinatorics · Mathematics 2025-06-17 Jinlong Tang , Guoce Xin

Let G be the space of generating functions of a periodic infinite order linear recurrence. In this paper we provide an explicit procedure for computing a basis of G.

Rings and Algebras · Mathematics 2013-11-08 António Bravo , Henrique M. Oliveira

We present new methods for the study of a class of generating functions introduced by the second author which carry some formal similarities with the Hurwitz zeta function. We prove functional identities which establish an explicit…

Number Theory · Mathematics 2016-01-18 Federico Pellarin , Rudolph Perkins

We revisit several hybrid multiplicative-to-additive type functions from a recent preprint article. These functions, $g(n)$ with Dirichlet generating function (DGF) $\zeta(s)^{-1} (1+P(s))^{-1}$ for $\Re(s) > 1$ where $P(s) = \sum_p p^{-s}$…

Number Theory · Mathematics 2026-04-28 Maxie Dion Schmidt

We construct a $k$-fold $q$-series as a generating function of $k$-regular partitions for each positive integer $k$. The $k=1$ case is one of Euler's $q$-series identities pertaining to the partitions into distinct parts. The construction…

Combinatorics · Mathematics 2025-02-25 Kağan Kurşungöz

Given a barrier $0 \leq b_0 \leq b_1 \leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \leq a_0 \leq a_1 \leq ... \leq a_n$ for which $a_j \leq b_j$ for all $0 \leq j \leq n$. Known formul\ae for $f(n)$ include an $n…

Combinatorics · Mathematics 2009-06-26 Robin Pemantle , Herbert S. Wilf

Let $a_n$ denote the number of ways in which a chess rook can move from a corner cell to the opposite corner cell of an $n \times n \times n$ three-dimensional chessboard, assuming that the piece moves closer to the goal cell at each step.…

Symbolic Computation · Computer Science 2011-10-03 Alin Bostan , Frédéric Chyzak , Mark van Hoeij , Lucien Pech

Given a_1,a_2,...,a_n in Z^d, we examine the set, G, of all non-negative integer combinations of these a_i. In particular, we examine the generating function f(z)=\sum_{b\in G} z^b. We prove that one can write this generating function as a…

Combinatorics · Mathematics 2015-05-08 Herbert E. Scarf , Kevin M. Woods

We construct new continued fraction expansions of Jacobi-type J-fractions in $z$ whose power series expansions generate the ratio of the $q$-Pochhamer symbols, $(a; q)_n / (b; q)_n$, for all integers $n \geq 0$ and where $a,b,q \in…

Number Theory · Mathematics 2017-08-02 Maxie D. Schmidt

Ismail and Wilson derived a generating function for Askey--Wilson polynomials which is given by a product of $q$-Gauss (Heine) nonterminating basic hypergeometric functions. We provide a generalization of that generating function which…

Classical Analysis and ODEs · Mathematics 2026-04-21 Howard Cohl , Michael Schlosser

Uchimura, in 1987, introduced a probability generating function for a random variable $X$ and using properties of this function he discovered an interesting $q$-series identity. He further showed that the $m$-th cumulant with respect to the…

Number Theory · Mathematics 2025-07-23 Archit Agarwal , Subhash Chand Bhoria , Pramod Eyyunni , Bibekananda Maji , Tanay Wakhare

We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can…

Combinatorics · Mathematics 2014-08-11 Ira M. Gessel , Yan Zhuang

A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…

Probability · Mathematics 2015-11-13 Boris L. Granovsky , Dudley Stark

In this paper we generalize an identity first given by Heinrich Eduard Heine in his treatise, {\it Handbuch der Kugelfunctionen, Theorie und Anwendungen (1881), which gives a Fourier series for $1/[z-\cos\psi]^{1/2}$, for $z,\psi\in\R$, and…

Mathematical Physics · Physics 2009-12-02 Howard S. Cohl , Diego E. Dominici

In I981, Uchimura studied a divisor generating $q$-series that has applications in probability theory and in the analysis of data structures, called heaps. Mainly, he proved the following identity. For $|q|<1$, \begin{equation*}…

Number Theory · Mathematics 2024-05-06 Archit Agarwal , Subhash Chand Bhoria , Pramod Eyyunni , Bibekananda Maji

We prove that the class of permutations generated by passing an ordered sequence $12\dots n$ through a stack of depth 2 and an infinite stack in series is in bijection with an unambiguous context-free language, where a permutation of length…

Combinatorics · Mathematics 2014-08-05 Murray Elder , Geoffrey Lee , Andrew Rechnitzer