English
Related papers

Related papers: Bijective Proofs of Identities from Colored Binary…

200 papers

We give a combinatorial interpretation of a matrix identity on Catalan numbers and the sequence $(1, 4, 4^2, 4^3, ...)$ which has been derived by Shapiro, Woan and Getu by using Riordan arrays. By giving a bijection between weighted partial…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Nelson Y. Li , Louis W. Shapiro , Sherry H. F. Yan

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

Combinatorics · Mathematics 2020-04-14 Ali Chouria , Vlad-Florin Drǎgoi , Jean-Gabriel Luque

Two new generalized Fibonacci number summation identities are stated and proved, and two other new generalized Fibonacci number summation identities are derived from these, of which two special cases are already known in literature.

Number Theory · Mathematics 2018-08-30 M. J. Kronenburg

The harmonic numbers $H_n=\sum_{0<k\ls n}1/k\ (n=0,1,2,\ldots)$ play important roles in mathematics. With helps of some combinatorial identities, we establish the following two congruences:…

Number Theory · Mathematics 2019-01-28 Guo-Shuai Mao

The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are…

Combinatorics · Mathematics 2009-05-20 Xavier Gérard Viennot

A probability method is provided to prove three classes of combinatorial identities. The method is extremely simple, only one step after the proper probability setup.

Combinatorics · Mathematics 2009-11-02 Tong Zhu

We find the joint distribution of three simple statistics on lattice paths of n upsteps and n downsteps leading to a triple sum identity for the central binomial coefficient {2n}-choose-{n}. We explain why one of the constituent double sums…

Combinatorics · Mathematics 2012-06-15 David Callan

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…

Machine Learning · Statistics 2020-06-08 M. Younsi , A. Lacasse

We give "hybrid" proofs of the $q$-binomial theorem and other identities. The proofs are "hybrid" in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the…

Number Theory · Mathematics 2019-01-17 Dennis Eichhorn , James Mc Laughlin , Andrew V. Sills

We derive a new Fibonacci identity. This single identity subsumes important known identities such as those of Catalan, Ruggles, Halton and others, as well as standard general identities found in the books by Vajda, Koshy and others. We also…

Combinatorics · Mathematics 2018-09-20 Kunle Adegoke

In this paper we prove some combinatorial identities which can be considered as generalizations and variations of remarkable Chu-Vandermonde identity. These identities are proved by using an elementary combinatorial-probabilistic approach…

Combinatorics · Mathematics 2018-07-30 Romeo Meštrović

Let $\Bigl\langle\matrix{n\cr k}\Bigr\rangle$, $\Bigl\langle\matrix{B_n\cr k}\Bigr\rangle$, and $\Bigl\langle\matrix{D_n\cr k}\Bigr\rangle$ be the Eulerian numbers in the types A, B, and D, respectively -- that is, the number of…

Logic in Computer Science · Computer Science 2024-02-14 Luigi Santocanale

A. Lacasse conjectured a combinatorial identity in his study of learning theory. Various people found independent proofs. Here is another one that is based on the study of the tree function, with links to Lamberts $W$-function and…

Combinatorics · Mathematics 2013-01-17 Helmut Prodinger

We survey combinatorial interpretations of some dozen identities for the double factorial such as, for instance, (2n-2)!! + Sum_{k=2}^{n} (2n-1)!!(2k-4)!!/(2k-1)!! = (2n-1)!!. Our methods are mostly bijective.

Combinatorics · Mathematics 2009-06-09 David Callan

The tangent number $T_{2n+1}$ is equal to the number of increasing labelled complete binary trees with $2n+1$ vertices. This combinatorial interpretation immediately proves that $T_{2n+1}$ is divisible by $2^n$. However, a stronger…

Combinatorics · Mathematics 2018-02-28 Guo-Niu Han , Jing-Yi Liu

The Sun polynomials $g_n(x)$ are defined by \begin{align*} g_n(x)=\sum_{k=0}^n{n\choose k}^2{2k\choose k}x^k. \end{align*} We prove that, for any positive integer $n$, there hold \begin{align*} &\frac{1}{n}\sum_{k=0}^{n-1}(4k+3)g_k(x)…

Number Theory · Mathematics 2015-12-29 Victor J. W. Guo , Guo-Shuai Mao , Hao Pan

In this brief note a straightforward combinatorial proof for an identity directly connecting rooted forests and unordered set partitions is provided. Furthermore, references that put this type of identity in the context of forest volumes…

Combinatorics · Mathematics 2019-07-11 Benjamin Hackl

We prove some combinatorial identities using the Polya urn and the closely related Hoppe urn.

Probability · Mathematics 2013-10-02 S. N. Ethier , Fred M. Hoppe

In 2003, Alladi, Andrews and Berkovich proved an identity for partitions where parts occur in eleven colors: four primary colors, six secondary colors, and one quaternary color. Their work answered a longstanding question of how to go…

Combinatorics · Mathematics 2021-05-21 Isaac Konan

In this article, a short combinatorial proof of the Capelli's identity is given. It also leads to an easy proof of the Capelli--Cauchy--Binet identity, a more general form of Capelli's identity. With the technique introduced, the Turnbull's…

Combinatorics · Mathematics 2020-06-23 Rui Xiong