Using the WZ method we present simpler proofs of Koecher's, Leshchiner's and Bailey-Borwein-Bradley's identities for generating functions of the sequences $\{ζ(2n+2)\}_{n\ge 0}, \{ζ(2n+3)\}_{n\ge 0}.$ By the same method we give several new representations for these generating functions yielding faster convergent series for values of the Riemann zeta function.
Using the slow triangle map (a type of multi-dimensional continued fraction algorithm), we exhibit a method for generating any number of new identities for subsets of integer partitions.
Convolutions for Tribonacci numbers involving binomial coefficients are treated with ordinary generating functions and the diagonalization method of Hautus and Klarner. In this way, the relevant generating function can be established, which is rational. The coefficients can also be expressed. It is sketched how to extend this to Tetranacci numbers and similar quantities.
We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain overpartition pairs recently introduced by Bringmann, Lovejoy and Osburn. For example, one of our identities gives a closed-form evaluation of a double series in terms of Chebyshev polynomials of the second kind, thereby resulting in an analogue of Euler's pentagonal number theorem. Another of our results expresses a multi-sum involving $N(r, s, m, n)$ in te…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A number of weighted generalized Fibonacci number summation identities are derived this way. From these identities some infinite series, generating functions and convolution identities are obtained. In addition, some weighted generalized Fibonacci number summation identities with binomial coefficients are derived. Many examples of both types of summation identities…
We focus on writing closed forms of generating functions for the number of partitions with gap conditions as double sums starting from a combinatorial construction. Some examples of the sets of partitions with gap conditions to be discussed here are the set of Rogers--Ramanujan, Göllnitz--Gordon, and little Göllnitz partitions. This work also includes finding the finite analogs of the related generating functions and the discussion of some related series and polynomial identities. Additionally, we present a different construction and a double sum representation for the products similar to the …
In this paper, we give some new identities of Carlitz q-Bernoulli polynomials under symmetry group S 3 . The derivatives of identities are based on the q-Volkenborn integral expression of the generating function for the Carlitz q-Bernoulli polynomials and the q-Volkenborn integral equations that can be expressed as the exponential generating functions for the q-power sums.
Elliptic modular graph functions and forms (eMGFs) are defined for arbitrary graphs as natural generalizations of modular graph functions and forms obtained by including the character of an Abelian group in their Kronecker--Eisenstein series. The simplest examples of eMGFs are given by the Green function for a massless scalar field on the torus and the Zagier single-valued elliptic polylogarithms. More complicated eMGFs are produced by the non-separating degeneration of a higher genus surface to a genus one surface with punctures. eMGFs may equivalently be represented by multiple integrals ove…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $π$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of generating series. For these generating series, we derive integral representations in terms of root-valued iterated integrals. Using substitutions, we express the interated integrals as cyclotomic harmonic polylogarithms. Finally, by applying known relations among the cyclotomic harmonic polylogarithms, we derive expressions in terms of several constants.
Eigenvectors of the discrete Fourier transform can be expressed using Ramanujan theta functions. New theta function identities, Ramanujan theta function identities, and generating functions for the quadratic numbers are a consequence.
We use the method of tiling to give elementary combinatorial proofs of some celebrated $q$-series identities, such as Jacobi triple product identity, Rogers-Ramanujan identities, and some identities of Rogers. We give a tiling proof of the q-binomial theorem and a tiling interpretation of the q-binomial coefficients. A new generalized $ k $-product $q$-series identity is also obtained by employing the `tiling-method', wherein the generating function of the set of all possible tilings of a rectangular board is computed in two different ways to obtain the desired $q$-series identity. Several new…
In this paper, we prove identities for a class of generalized Appell functions which are based on the $\operatorname{A}_2$ root lattice. The identities are reminiscent of periodicity relations for the classical Appell function, and are proven using only analytic properties of the functions. Moreover they are a consequence of the blow-up formula for generating functions of invariants of moduli spaces of semi-stable sheaves of rank 3 on rational surfaces. Our proof confirms that in the latter context, different routes to compute the generating function (using the blow-up formula and wall-crossin…
In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a relation between the rank of strongly unimodal sequences and the rank of integer partitions.
In this article, a finite analogue of the generalized sum-of-tails identity of Andrews and Freitas is obtained. We derive several interesting results as special cases of this analogue, in particular, a recent identity of Dixit, Eyyyunni, Maji and Sood. We derive a new extension of Abel's lemma with the help of which we obtain a one-parameter generalization of a sum-of-tails identity of Andrews, Garvan and Liang, an identity of Ramanujan as well as two new results - one for Ramanujan's function $σ(q)$ and another for the function recently introduced by Andrews and Ballantine. Later we introduce…
The main object of the paper is to reveal connections between Chebyshev polynomials of the first and second kinds and Fibonacci polynomials introduced by Catalan. This is achieved by relating the respective (ordinary and exponential) generating functions to each other. As a consequence, we also establish new combinatorial identities for balancing polynomials and Fibonacci (Lucas) numbers.
We consider nested sums involving the Pochhammer symbol at infinity and rewrite them in terms of a small set of constants, such as powers of $π,$ $\log(2)$ or zeta values. In order to perform these simplifications, we view the series as specializations of generating series. For these generating series, we derive integral representations in terms of root-valued iterated integrals or directly in terms of cyclotomic harmonic polylogarithms. Using substitutions, we express the root-valued iterated integrals as cyclotomic harmonic polylogarithms. Finally, by applying known relations among the cyclo…
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 connection with certain deformations of the Carlitz logarithm introduced by M. Papanikolas and involve the Anderson-Thakur function and the Carlitz exponential function. They collect certain functional identities in families for a new class of L-functions introduced by the first author. This paper also deals with specializations at roots of unity of these generating…
The aim of this paper is by using generating functions to further study some identities and properties on the degenerate Stirling numbers of the second kind, the degenerate $r$-Stirling numbers of the second kind, the degenerate Stirling numbers of the first kind and the unsigned degenerate Stirling numbers of the first kind.
This paper presents both a proof method and a result. The proof method presented is particularly suitable for uniformly proving families of identities satisfied by a family of recursive sequences. To illustrate the method, we study the family of recursive sequences $F^{(k)}_n = \sum_{i=1}^k F^{(k)}_{n-i}, n \ge 0, k \ge 2,$ with $n$ a parameter varying over integers, and $k$ a parameter indexing members of the family. The main theorem states $ F^{(k)}_n = \sum_{j=1}^k P_{k,j} F^{(k)}_{n-jk},$ with $P$ a recursive triangle satisfying the triangle recursion $P_{i,j}=2P_{i-1,j}- P_{i-1,j-1},$ wit…
Recently, the numbers $Y_{n}(λ)$ and the polynomials $Y_{n}(x,λ)$ have been introduced by the second author [22]. The purpose of this paper is to construct higher-order of these numbers and polynomials with their generating functions. By using these generating functions with their functional equations and derivative equations, we derive various identities and relations including two recurrence relations, Vandermonde type convolution formula, combinatorial sums, the Bernstein basis functions, and also some well known families of special numbers and their interpolation functions such as the Apos…
This paper will primarily present a method of proving generating function identities for partitions from linked partition ideals. The method we introduce is built on a conjecture by George Andrews and that those generating functions satisfy some $q$-difference equations. We will come up with the generating functions of partitions in the Kanade--Russell conjectures to illustrate the effectiveness of this method.
In two papers, Little and Sellers introduced an exciting new combinatorial method for proving partition identities which is not directly bijective. Instead, they consider various sets of weighted tilings of a $1 \times \infty$ board with squares and dominoes, and for each type of tiling they construct a generating function in two different ways, which generates a $q$-series identity. Using this method, they recover quite a few classical $q$-series identities, but Euler's Pentagonal Number Theorem is not among them. In this paper, we introduce a key parameter when constructing the generating fu…
The main aim of this paper is to investigate and introduce relations between the numbers of k-ary Lyndon words and unified zeta-type functions which was defined by Ozden et al [15, p. 2785]. Finally, we give some identities on generating functions for the numbers of k-ary Lyndon words and some special numbers and polynomials such as the Apostol-Bernoulli numbers and polynomials, Frobenius-Euler numbers, Euler numbers and Bernoulli numbers.
In the first paper of this series, we gave infinite families of coloured partition identities which generalise Primc's and Capparelli's classical identities. In this second paper, we study the representation theoretic consequences of our combinatorial results. First, we show that the difference conditions we defined in our $n^2$-coloured generalisation of Primc's identity, which have a very simple expression, are actually the energy function with values in $\{0,1,2\}$ for the perfect crystal of the tensor product of the vector representation and its dual in $A_{n-1}^{(1)}$. Then we introduce a…
The class of Lambert series generating functions (LGFs) denoted by $L_α(q)$ formally enumerate the generalized sum-of-divisors functions, $σ_α(n) = \sum_{d|n} d^α$, for all integers $n \geq 1$ and fixed real-valued parameters $α\geq 0$. We prove new formulas expanding the higher-order derivatives of these LGFs. The results we obtain are combined to express new identities expanding the generalized sum-of-divisors functions. These new identities are expanded in the form of sums of polynomially scaled multiples of a related class of divisor sums depending on $n$ and $α$.
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 random variable $X$ is nothing but the generating function for the generalized divisor function $σ_{m-1}(n)$. Simon, Crippa, and Collenberg, in 1993, explored the $G_{n,p}$-model of a random acyclic digraph and defined a random variable $γ_n^{*}(1)$. Quite interestingly, they found links between limit of its mean and the generating function for the divisor …
Using generating functions, we derive many identities involving balancing and Lucas-balancing polynomials. By relating these polynomials to Chebyshev polynomials of the first and second kind, and Fibonacci and Lucas numbers, we offer some presumably new combinatorial identities involving these famous sequences.
We introduce the degenerate Bernoulli numbers of the second kind as a degenerate version of the Bernoulli numbers of the second kind. We derive a family of nonlinear differential equations satisfied by a function closely related to the generating function for those numbers. We obtain explicit expressions for the coefficients appearing in those differential equations and the degenerate Bernoulli numbers of the second kind. In addition, as an application and from those differential equations we have an identity expressing the degenerate Bernoulli numbers of the second kind in terms of those numb…
We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and double binomial summation identities, partial sums and ordinary generating functions. Explicit examples are given for small $n$ values.
We establish some partial fraction identities for rational functions whose denominators are implicit products of the cyclotomic polynomials. To achieve this, we first develop a general algebraic approach for partial fraction decomposition inspired by the Heaviside's cover-up method. We thus call our method the Extended Cover-Up Method. Using our method we obtain direct formulas for $q$-partial fractions for certain generating functions. As a direct consequence of our formulas one can compute the Sylvester denumerants, the Frobenius number and the Ehrhart polynomials in pseudo-polynomial time. …
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 contains both new results and literature surveys about some of the related results that have existed so far. With the aid of hypergeometric function, generating functions for a new family of the combinatorial numbers, related to finite sums of powers of binomial coefficients, are constructed. By using these generating functions, a number of new identities have…
