English
Related papers

Related papers: Bijective Proofs of Identities from Colored Binary…

200 papers

A product difference equation is proved and used for derivation by elementary methods of four combinatorial identities, eight combinatorial identities involving generalized harmonic numbers and eight combinatorial identities involving…

Combinatorics · Mathematics 2017-01-13 M. J. Kronenburg

For $0\leq k \leq n$, the number $C(n,k)$ represents the number of all lattice paths in the plane from the point $(0,0)$ to the point $(n,k)$, using steps $(1,0)$ and $(0,1)$, that never rise above the main diagonal $y=x$. The Fuss-Catalan…

Combinatorics · Mathematics 2025-03-10 Jovan Mikić

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

Discrete Mathematics · Computer Science 2010-07-29 Zan Pan

Suppose 2n voters vote sequentially for one of two candidates. For how many such sequences does one candidate have strictly more votes than the other at each stage of the voting? The answer is \binom{2n}{n} and, while easy enough to prove…

Combinatorics · Mathematics 2007-05-23 Glenn Hurlbert , Vikram Kamat

We extend Fibonacci numbers with arbitrary weights and generalize a dozen Fibonacci identities. As a special case, we propose an elliptic extension which extends the $q$-Fibonacci polynomials appearing in Schur's work. The proofs of most of…

Combinatorics · Mathematics 2023-01-20 Gaurav Bhatnagar , Archna Kumari , Michael J. Schlosser

In 2002 Zhi-Wei Sun [Integers 2(2002)] published a curious identity involving binomial coefficients. In this paper we present a generalization of the identity.

Combinatorics · Mathematics 2007-09-24 Zhi-Wei Sun , Ke-Jian Wu

In our paper arXiv: math.RA/0110333 v1 Oct 2001 we showed that the number of algebras defined by a binary operation satisfying a formally irreducible identity between two n-iterates is O( e^{-n/16}S_{n}^{2} for n --> infinity, S_{n} being…

Rings and Algebras · Mathematics 2010-09-07 Constantin M. Petridi

We explain how the identity $$\sum_{i+j=n}\binom{2i}{i}\binom{2j}{j}\;=\;\displaystyle4^n$$ is an easy consequence of the inclusion-exclusion principle.

Combinatorics · Mathematics 2013-07-26 Rui Duarte , António Guedes de Oliveira

Given a vertex colouring of the infinite $n$-ary Cantor tree with $m$ colours ($n,m\geq 2$), the natural problem arises: may this colouring induce a bijective colouring of the infinite paths starting at the root, i.e., that every infinite…

Combinatorics · Mathematics 2022-02-22 Adam Woryna

In $2003$, Alladi, Andrews and Berkovich proved a four-parameter partition identity lying beyond a celebrated identity of G\"ollnitz. Since then it has been an open problem to extend their work to five or more parameters. In part I of this…

Combinatorics · Mathematics 2019-12-30 Isaac Konan

In this work we prove a new combinatorial identity and applying it we establish many finite harmonic sum identities. Among many others, we prove that \begin{equation*}…

Combinatorics · Mathematics 2018-06-11 Necdet Batir

Starting with a known polynomial identity, we derive two generalizations of Touchard's identity concerning Catalan numbers; one obtained using the Beta function and the other via a connection with Stirling numbers of the second kind. We…

Combinatorics · Mathematics 2026-03-03 Kunle Adegoke

The Raney numbers $R_{p,r}(n)$ are a two-parameter generalization of the Catalan numbers that were introduced by Raney in his investigation of functional composition patterns \cite{Raney}. We give a new combinatorial interpretation for all…

Combinatorics · Mathematics 2015-01-29 Jonathan E. Beagley , Paul Drube

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

Combinatorics · Mathematics 2025-03-05 David Serena , William J Buchanan

We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean $n\times n$-matrices and apply the characterization to computational complexity of identity checking, finite axiomatizability…

Group Theory · Mathematics 2025-10-08 Mikhail V. Volkov

The Catalan numbers occur in various counting problems in combinatorics. This paper reveals a connection between the Catalan numbers and list colouring of graphs. Assume $G$ is a graph and $f:V(G) \to N$ is a mapping. For a nonnegative…

Combinatorics · Mathematics 2017-11-09 Rongxing Xu , Yeong-Nan Yeh , Xuding Zhu

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{\alpha}{n-k}\binom{\beta+k}{k}x^k…

Combinatorics · Mathematics 2023-01-24 Necdet Batir , Sezer Sorgunand Sevda Atpinar

Let $$ A_{m,n}(a)=\sum_{j=0}^m (-4)^j {m+j\choose 2j}\sum_{k=0}^{n-1} \sin(a+2k\pi/n) \cos^{2j}(a+2k\pi/n) $$ and $$ B_{m,n}(a)=\sum_{j=0}^m (-4)^j {m+j+1\choose 2j+1}\sum_{k=0}^{n-1} \sin(a+2k\pi/n) \cos^{2j+1}(a+2k\pi/n), $$ where $m\geq…

Classical Analysis and ODEs · Mathematics 2023-01-02 Horst Alzer , Semyon Yakubovich

Recently, Andrews and Yee studied two-variable generalizations of two identities involving partition functions $p_\omega(n)$ and $p_\nu(n)$ introduced by Andrews, Dixit and Yee. In this paper, we present a combinatorial proof of an…

Combinatorics · Mathematics 2018-05-23 Shane Chern

Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…

Number Theory · Mathematics 2024-06-12 Kunle Adegoke , Robert Frontczak