Our paper deals about identities involving Bell polynomials. Some identities on Bell polynomials derived using generating function and successive derivatives of binomial type sequences. We give some relations between Bell polynomials and binomial type sequences in first part, and, we generalize the results obtained in [4] in second part.
Using a property of the q-shifted factorial, an identity for q-binomial coefficients is proved, which is used to derive the formulas for the q-binomial coefficient for negative arguments. The result is in agreement with an earlier paper about the normal binomial coefficient for negative arguments. Some new q-binomial summation identities are derived, and the formulas for negative arguments transform some of these summation identities into each other. One q-binomial summation identity is transformed into a new q-binomial summation identity.
We extend the digital binomial identity as given by Nguyen el al. to an identity in an arbitrary base $b$, by introducing the $b-$ary binomial coefficients. We then study the properties of these coefficients such as orthogonality, a link to Lucas' theorem and the corresponding $b-$ary Pascal triangles.
It is shown that the curious identity of Simons follows immediately from Euler's series transformation formula and also from an identity due to Ljunggren. The relation of Simons' identity to Legendre's polynomials is also discussed. At the end we use the generalized Euler series transformation to obtain two recent binomial identities of Munarini.
We establish two binomial coefficient--generalized harmonic sum identities using the partial fraction decomposition method. These identities are a key ingredient in the proofs of numerous supercongruences. In particular, in other works of the author, they are used to establish modulo $p^k$ ($k>1$) congruences between truncated generalized hypergeometric series, and a function which extends Greene's hypergeometric function over finite fields to the $p$-adic setting. A specialization of one of these congruences is used to prove an outstanding conjecture of Rodriguez-Villegas which relates a trun…
Classical binomial identities are established by giving probabilistic interpretations to the summands. The examples include Vandermonde identity and some generalizations.
When searching for Calabi.Yau differential equations, often different formulas for the coefficients give the same differential equation. The coefficients are usually sums (simple, double or triple) of products of binomial coefficients. This results in numerous binomial identities.
Using a cube tiling of $\mathbb{R}^n$ constructed by Lagarias and Shor a tiling proof of three well-known binomial identities related to the Lucas cube is given.
We obtain new combinatorial identities for integral values of binary Krawtchouk polynomials $K^{2m}_p(x)$, $0\le p\le 2m$, by computing the characters of the $p$-exterior representations on certain elements of order 2 of $\mathrm{SO}(2m)$. From this identities, we deduce several new relations for binomial coefficients and Catalan numbers.
By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several identities and summation formulæ parallel to those of the usual binomial coefficients.
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.
We give an $n$-space generalized $q$-binomial theorem, and some new $q$ series identities that resemble the traditional $q$ series partition generating functions. These identities enumerate stepping stone weighted vector partitions.
The aim of this paper is to present a general algebraic identity. Applying this identity, we provide several formulas involving the q-binomial coefficients and the q-harmonic numbers. We also recover some known identities including an algebraic identity of D. Y. Zheng on q-Apéry numbers and we establish the q-analog of Euler's formula. The proposed results may have important applications in the theory of q-supercongruences.
We establish $q$-analogs for four congruences involving central binomial coefficients. The $q$-identities necessary for this purpose are shown via the $q$-WZ method.
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The origins and the proofs of these identities are probabilistic. However, their form suggests universal applications in simplifying expressions. Many useful simplifying formulae are presented in the sequel.
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on the round complexity of the weak symmetry breaking task. Furthermore, we introduce the notion of a fundamental binomial identity and find an infinite family of values, other than the prime powers, for which no fundamental binomial identity can exist.
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…
We give a $q$-analogue of some binomial coefficient identities of Y. Sun [Electron. J. Combin. 17 (2010), #N20] as follows: {align*} \sum_{k=0}^{\lfloor n/2\rfloor}{m+k\brack k}_{q^2}{m+1\brack n-2k}_{q} q^{n-2k\choose 2} &={m+n\brack n}_{q}, \sum_{k=0}^{\lfloor n/4\rfloor}{m+k\brack k}_{q^4}{m+1\brack n-4k}_{q} q^{n-4k\choose 2} &=\sum_{k=0}^{\lfloor n/2\rfloor}(-1)^k{m+k\brack k}_{q^2}{m+n-2k\brack n-2k}_{q}, {align*} where ${n\brack k}_q$ stands for the $q$-binomial coefficient. We provide two proofs, one of which is combinatorial via partitions.
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving binomial coefficients and Fibonacci type sequences.
In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete convolution. Here we begin by introducing the notion of a binomial array and develop several "hockey stick" rules. Then we give an algorithm that generalizes the classical Vandermonde Identity; this produces infinite families of summation formulas, which we use to expand and prove certain combinatorial identities for the Catalan numbers. Finally, we recast …
In this paper, first we introduce a quantity called a partition function for a quiver mutation sequence. The partition function is a generating function whose weight is a $q$-binomial associated with each mutation. Then, we show that the partition function can be expressed as a ratio of products of quantum dilogarithms. This provides a systematic way of constructing various $q$-binomial multisum identities.
The \emph{Hosoya triangle} is a triangular array where every entry is a product of two Fibonacci numbers. We use the geometry of this triangle to find new identities related to Fibonacci numbers. We give geometric interpretation for some well-known identities of Fibonacci numbers. For instance, the Cassini identity and the Catalan identity. We also extend some identities that hold in the Pascal triangle to the Hosoya triangle. For instance, the hockey stick extends from binomials to products of Fibonacci numbers and the rhombus property extends a binomial identity from the Pascal triangle to a…
We consider a special class of binomial sums involving harmonic numbers and we prove three identities by using the elementary method of the partial fraction decomposition. Some applications to infinite series and congruences are given.
In terms of the telescoping method, a simple binomial sum is given. By applying the derivative operators to the equation just mentioned, we establish several general harmonic number identities including some known results.
We discuss closed-form formulas for the (n; k)-th partial Bell polynomials derived in Cvijovic. We show that partial Bell polynomials are special cases of weighted integer compositions, and demonstrate how the identities for partial Bell polynomials easily follow from more general identities for weighted integer compositions. We also provide short and elegant probabilistic proofs of the latter, in terms of sums of discrete integer-valued random variables. Finally, we outline further identities for the partial Bell polynomials.
Unlike in the case of Fibonacci and Lucas numbers, there is a paucity of literature dealing with summation identities involving the Padovan and Perrin numbers. In this paper, we derive various summation identities for these numbers, including binomial and double binomial identities. Our results derive from the rich algebraic properties exhibited by the zeros of the characteristic polynomial of the Padovan/Perrin sequence.
We present a different proof of the following identity due to Munarini, which generalizes a curious binomial identity of Simons. \begin{align*} \sum_{k=0}^{n}\binomα{n-k}\binom{β+k}{k}x^k &=\sum_{k=0}^{n}(-1)^{n+k}\binom{β-α+n}{n-k}\binom{β+k}{k}(x+1)^k, \end{align*} where $n$ is a non-negative integer and $α$ and $β$ are complex numbers, which are not negative integers. Our approach is based on a particularly interesting combination of the Taylor theorem and the Wilf-Zeilberger algorithm. We also generalize a combinatorial identity due to Alzer and Kouba, and offer a new binomial sum identity…
The q-binomial coefficients are the polynomial cousins of the traditional binomial coefficients, and a number of identities for binomial coefficients can be translated into this polynomial setting. For instance, the familiar vanishing of the alternating sum across row n of Pascal's triangle is captured by the so-called Gaussian Formula. In this paper, we find a q-binomial congruence which synthesizes this result and Fleck's congruence for binomial coefficients.
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…
In a previous paper, we studied an overpartition analogue of Gaussian polynomials as the generating function for overpartitions fitting inside an $m \times n$ rectangle. Here, we add one more parameter counting the number of overlined parts, obtaining a two-parameter generalization $\overline{m+n \brack n}_{q,t}$ of Gaussian polynomials, which is also a $(q,t)$-analogue of Delannoy numbers. First we obtain finite versions of classical $q$-series identities such as the $q$-binomial theorem and the Lebesgue identity, as well as two-variable generalizations of classical identities involving Gauss…
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.
The integral representation of the Hadamard product of two functions is used to prove several Euler-type series transformation formulas. As applications we obtain three binomial identities involving harmonic numbers and an identity for the Laguerre polynomials. We also evaluate in a closed form certain power series with harmonic numbers
We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial identities, which imply Capparelli's partition theorems when the degree of the polynomial tends to infinity. This way we also obtain an interesting new result for the sum of the Capparelli's products. We finish this paper by proposing an infinite hierarchy of polynomial identities.
We obtain connection coefficients between $q$-binomial and $q$-trinomial coefficients. Using these, one can transform $q$-binomial identities into a $q$-trinomial identities and back again. To demonstrate the usefulness of this procedure we rederive some known trinomial identities related to partition theory and prove many of the conjectures of Berkovich, McCoy and Pearce, which have recently arisen in their study of the $ϕ_{2,1}$ and $ϕ_{1,5}$ perturbations of minimal conformal field theory.
We use rook placements to prove Spivey's Bell number formula and other identities related to it, in particular, some convolution identities involving Stirling numbers and relations involving Bell numbers. To cover as many special cases as possible, we work on the generalized Stirling numbers that arise from the rook model of Goldman and Haglund. An alternative combinatorial interpretation for the Type II generalized $q$-Stirling numbers of Remmel and Wachs is also introduced in which the method used to obtain the earlier identities can be adapted easily.
We prove an inverse relation and a family of convolution formulas involving partial Bell polynomials. Known and some presumably new combinatorial identities of convolution type are discussed. Our approach relies on an interesting multinomial formula for the binomial coefficients. The inverse relation is deduced from a parametrization of suitable identities that facilitate dealing with compositions of Bell polynomials.
We present various identities in the form of convolutions involving Stirling numbers of both kinds, Lah numbers, and binomial coefficients. Certain convolution polynomials are discussed also. The proofs are based on several series transformation formulas.
A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.
Binomial coefficients and central trinomial coefficients play important roles in combinatorics. Let $p>3$ be a prime. We show that $$T_{p-1}\equiv\left(\frac p3\right)3^{p-1}\ \pmod{p^2},$$ where the central trinomial coefficient $T_n$ is the constant term in the expansion of $(1+x+x^{-1})^n$. We also prove three congruences modulo $p^3$ conjectured by Sun, one of which is $$\sum_{k=0}^{p-1}\binom{p-1}k\binom{2k}k((-1)^k-(-3)^{-k})\equiv \left(\frac p3\right)(3^{p-1}-1)\ \pmod{p^3}.$$ In addition, we get some new combinatorial identities.
By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial coefficients and an odd power of a natural number. For example, we prove that for all positive integers $n_1, ..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer $r$, the expression $$n_1^{-1}{n_1+n_{m}\choose n_1}^{-1} \sum_{k=1}^{n_1}k^{2r+1}\prod_{i=1}^{m} {n_i+n_{i+1}\choose n_i+k}$$ is either an integer or a half-integer. Moreover, several related conj…
In this paper we extend the notion of Melham sum to the Pell and Pell-Lucas sequences. While the proofs of general statements rely on the binomial theorem, we prove some spacial cases by the known Pell identities. We also give extensions of obtained expressions to the other recursive sequences.