English
Related papers

Related papers: A simple combinatorial proof of Shapiro's Catalan …

200 papers

We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…

Combinatorics · Mathematics 2007-05-23 V. U. Pierce

Using generalized binomial coefficient identities and some results of John Dougall, we derive some families of series involving the cubes of Catalan numbers. We also establish a family of series containing fourth powers of Catalan numbers.…

Number Theory · Mathematics 2026-04-03 Kunle Adegoke

We provide an explicit formula for the toric $h$-contribution of each cubical shelling component, and a new combinatorial model to prove Clara Chan's result on the non-negativity of these contributions. Our model allows for a variant of the…

Combinatorics · Mathematics 2014-06-10 Gábor Hetyei

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…

Combinatorics · Mathematics 2021-03-30 C P Anil Kumar

The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…

Combinatorics · Mathematics 2020-10-01 Curtis Bennett , Juan Carrillo , John Machacek , Bruce E. Sagan

We present an algorithmic mapping from permutations of length dn to labeled n-node d-ary trees and back again. Given such a bijection, one can interpret each of the factorials in the formula for the Catalan numbers as a count of…

Combinatorics · Mathematics 2007-05-23 Bennet Vance

I study Hankel determinants of a class of sequences which can be interpreted as generalizations of the Catalan numbers and the central binomial coefficients. They follow a modular pattern with a frequent appearance of zeroes, so that the…

Combinatorics · Mathematics 2011-10-07 Johann Cigler

We prove a special case of a dynamical analogue of the classical Mordell-Lang conjecture. In particular, let $\phi$ be a rational function with no superattracting periodic points other than exceptional points. If the coefficients of $\phi$…

Number Theory · Mathematics 2009-02-06 Robert L. Benedetto , Dragos Ghioca , Par Kurlberg , Thomas J. Tucker

Bernoulli numbers are usually expressed in terms of their lower index numbers (recursive). This paper gives explicit formulas for Bernoulli numbers of even index. The formulas contain a remarkable sequence of determinants. The value of…

Number Theory · Mathematics 2007-05-23 Renaat Van Malderen

By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…

Combinatorics · Mathematics 2024-04-16 Nadia Na Li , Wenchang Chu

In this note, we study two generalizations of the Catalan numbers, namely the $s$-Catalan numbers and the spin $s$-Catalan numbers. These numbers first appeared in relation to quantum physics problems about spin multiplicities. We give a…

Combinatorics · Mathematics 2021-10-26 William Linz

We prove two positivity conjectures proposed by Guo for alternating sums and factorial ratios built from Gaussian coefficients. The first result proves the positivity of the odd $q$-super Catalan numbers \[…

Combinatorics · Mathematics 2026-05-28 Ji-Cai Liu

Using the expansion of the inverse of the Kostka matrix in terms of tabloids as presented by Egecioglu and Remmel, we show that the fusion coefficients can be expressed as an alternating sum over cylindric tableaux. Cylindric tableaux are…

Combinatorics · Mathematics 2012-09-06 Jennifer Morse , Anne Schilling

We introduce the three-Catalan triangle, highlighting the three-Catalan numbers along with their recurrence relation and combinatorial interpretation, which allows us to establish their log-convexity. Additionally, we prove that the rows of…

Combinatorics · Mathematics 2025-06-17 Boualam Rezig , Moussa Ahmia

We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.

Logic · Mathematics 2016-09-06 Saharon Shelah , Lee Stanley

Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…

Combinatorics · Mathematics 2025-09-01 Dandan Chen , Ziyin Zou

I give a proof of the confluence of combinatory strong reduction that does not use the one of lambda-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed…

Logic · Mathematics 2009-05-19 René David

We give elementary self-contained proofs of the strong Mason conjecture recently proved by Anari at. al. (arXiv:1811.01600) and Br\"and\'en--Huh (arXiv:1902.03719), and of the classical Alexandrov--Fenchel inequality. Both proofs use the…

Combinatorics · Mathematics 2022-12-23 Swee Hong Chan , Igor Pak

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

General Mathematics · Mathematics 2019-07-25 K. K. Kataria

We give a new elementary proof of the following theorem: if all critical points of a rational function g belong to the real line then there exists a fractional linear transformation L such that L(g) is a real rational function. Then we…

Algebraic Geometry · Mathematics 2012-02-07 Alexandre Eremenko , Andrei Gabrielov