AbstractA binomial coefficient identity equivalent to Saalschutz's summation of a 3F2 hypergeometric series is proved combinatorially. The proof depends on the enumeration of ordered pairs (A,B) of subsets of{1,2,3,…,ν} in which |A|=n, |B|=m, and B contains exactly r elements of the first n elements of A∪B
AbstractWe give a combinatorial proof of Harer and Zagier's formula for the disjoint cycle distribut...
AbstractThe problem of proving a particular binomial identity is taken as an opportunity to discuss ...
AbstractHere introduced is a class of combinatorial sums that can be treated by means of an embeddin...
AbstractA binomial coefficient identity equivalent to Saalschutz's summation of a 3F2 hypergeometric...
AbstractThe problem of proving a particular binomial identity is taken as an opportunity to discuss ...
AbstractIn this paper, the q-Pfaff-Saalschütz formula and the q-Sheppard ϕ23 transformation formula ...
AbstractA remarkably simple proof is presented for an interesting generalization of a combinatorial ...
This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enume...
We study generating functions of strict and non-strict order polynomials of series-parallel posets, ...
AbstractIn 1954, M. Kac discovered a probabilistic interpretation of a theorem of G. Szegö of Toepli...
We obtain a three-parameter q-series identity that generalizes two results of Chan and Mao. By speci...
AbstractWe give a combinatorial proof that the coefficient of zAB in a certain rational function is ...
Let (Xi)i=1 be a sequence of positive independent identically distributed random variables with regu...
Let (Xi)i=1 be a sequence of positive independent identically distributed random variables with regu...
AbstractUsing order statistics, we prove Gauss' 2F1 identity probabilistically. As a consequence, we...
AbstractWe give a combinatorial proof of Harer and Zagier's formula for the disjoint cycle distribut...
AbstractThe problem of proving a particular binomial identity is taken as an opportunity to discuss ...
AbstractHere introduced is a class of combinatorial sums that can be treated by means of an embeddin...
AbstractA binomial coefficient identity equivalent to Saalschutz's summation of a 3F2 hypergeometric...
AbstractThe problem of proving a particular binomial identity is taken as an opportunity to discuss ...
AbstractIn this paper, the q-Pfaff-Saalschütz formula and the q-Sheppard ϕ23 transformation formula ...
AbstractA remarkably simple proof is presented for an interesting generalization of a combinatorial ...
This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enume...
We study generating functions of strict and non-strict order polynomials of series-parallel posets, ...
AbstractIn 1954, M. Kac discovered a probabilistic interpretation of a theorem of G. Szegö of Toepli...
We obtain a three-parameter q-series identity that generalizes two results of Chan and Mao. By speci...
AbstractWe give a combinatorial proof that the coefficient of zAB in a certain rational function is ...
Let (Xi)i=1 be a sequence of positive independent identically distributed random variables with regu...
Let (Xi)i=1 be a sequence of positive independent identically distributed random variables with regu...
AbstractUsing order statistics, we prove Gauss' 2F1 identity probabilistically. As a consequence, we...
AbstractWe give a combinatorial proof of Harer and Zagier's formula for the disjoint cycle distribut...
AbstractThe problem of proving a particular binomial identity is taken as an opportunity to discuss ...
AbstractHere introduced is a class of combinatorial sums that can be treated by means of an embeddin...
DOI
Add to ORKG