Related papers: Combinatorial Identities via Two Urn Models

We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews…

For non-negative integers $k\leq n$, we prove a combinatorial identity for the $p$-binomial coefficient $\binom{n}{k}_p$ based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for…

We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.

We present a proof of a combinatorial conjecture from the second author's Ph.D. thesis. The proof relies on binomial and multinomial sums identities. We also discuss the relevance of the conjecture in the context of PAC-Bayesian machine…

We lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…

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…

In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…

We give combinatorial proofs for some identities involving binomial sums that have no closed form.

In this paper, we study relations among several types of Eulerian polynomials from a combinatorial viewpoint. We establish an identity between the restricted Eulerian polynomials of types $A$ and $B$. As an application, we present a…

We derive several symmetric identities for Bernoulli and Euler polynomials which imply some known identities. Our proofs depend on the new technique developed in part I and some identities obtained in [European J. Combin. 24(2003),…

Recursive matrices are ubiquitous in combinatorics, which have been extensively studied. We focus on the study of the sums of $2\times 2$ minors of certain recursive matrices, the alternating sums of their $2\times 2$ minors, and the sums…

We obtain a finite form of Jacobi's identity and present a combinatorial proof based on the structure of synchronized partitions.

Based on a bijection due to Fu and Tang, we provide combinatorial proofs of several partition identities of Andrews and Merca. We also introduce two weights for partitions to extend one of these identities.

In this note we give some identities which involve the Mertens function M(n). Our proofs are combinatorial with relatively prime subsets as a main tool.

In this note, we show how a combinatorial identity of Frisch can be applied to prove and generalize some well-known identities involving harmonic numbers. We also present some combinatorial identities involving odd harmonic numbers which…

We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.

In this paper we introduce three combinatorial models for symmetrized poly-Bernoulli numbers. Based on our models we derive generalizations of some identities for poly-Bernoulli numbers. Finally, we set open questions and directions of…

We propose and recursively prove polynomial identities which imply Capparelli's partition theorems. We also find perfect companions to the results of Andrews, and Alladi, Andrews and Gordon involving $q$-trinomial coefficients. We follow…

In this papier, by the classical umbral calculus method, we establish identities involving the Appell polynomials and extend some existing identities.

We collect, survey and develop methods of (one-dimensional) stochastic approximation in a framework that seems suitable to handle fairly broad generalizations of Polya urns. To show the applicability of the results we determine the limiting…