English
Related papers

Related papers: Continuous Analogues for the Binomial Coefficients…

200 papers

Catalan numbers and their interpretations in terms of Dyck paths are widely used in different topics of applied mathematics and computer science. Here, we consider a general approach for constrained Dyck paths. In particular, we study Dyck…

Discrete Mathematics · Computer Science 2026-05-06 Antonio Bernini , Stefano Bilotta , Elisa Pergola

Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.

Combinatorics · Mathematics 2016-05-12 Ilker Akkus

We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…

Symbolic Computation · Computer Science 2015-07-16 Sébastien Maulat , Bruno Salvy

We study the distribution of the extended binomial coefficients by deriving a complete asymptotic expansion with uniform error terms. We obtain the expansion from a local central limit theorem and we state all coefficients explicitly as…

Combinatorics · Mathematics 2014-07-29 Thorsten Neuschel

We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…

Combinatorics · Mathematics 2011-11-29 Srečko Brlek , Jean-Philippe Labbé , Michel Mendès France

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

Classical Analysis and ODEs · Mathematics 2020-08-05 Karl Dilcher , Maciej Ulas

In this paper, we enumerate lattice paths with certain constraints and apply the corresponding results to develop formulas for calculating the dimensions of submodules of a class of modules for planar upper triangular rook monoids. In…

Combinatorics · Mathematics 2017-08-24 Jianqiang Feng , Wenli Liu , Ximei Bai , Zhenheng Li

We show that q-Catalan numbers, q- central binomial coefficients and q- Narayana polynomials are moments of q-analogues of Fibonacci and Lucas polynomials and related polynomials.

Combinatorics · Mathematics 2016-12-01 Johann Cigler

In this paper we show that many well-known counting coefficients, including the Catalan numbers, the Motzkin numbers, the central binomial coefficients, the central Delannoy numbers are Hausdorff moment sequences in a unified approach. In…

Combinatorics · Mathematics 2018-09-21 Hayoung Choi , Yeong-Nan Yeh , Seonguk Yoo

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…

Group Theory · Mathematics 2018-11-14 Benjamin Linowitz , D. B. McReynolds , Nicholas Miller

We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…

Combinatorics · Mathematics 2010-12-17 Milan Janjic

We present several types of ordinary generating functions involving central binomial coefficients, harmonic numbers, and odd harmonic numbers. Our results complement those of Boyadzhiev from 2012 and Chen from 2016. Based on these…

Combinatorics · Mathematics 2024-01-08 Kunle Adegoke , Robert Frontczak , Taras Goy

Let k and n be positive integers. We mainly show that $$(ln+1) | k\binom{kn+ln}{kn},$$ $$2\binom{kn}n | \binom {2n}{n}C_{2n}^{(k-1)}$$, $$\binom{kn}n | (2k-1)C_n\binom{2kn}{2n},$$ $$\binom{2n}n | (k+1)C_n^{(k-1)}\binom{2kn}{kn},$$…

Number Theory · Mathematics 2010-06-01 Zhi-Wei Sun

Shapiro proved an elegant convolution formula involving Catalan numbers of even index. This paper gives a simple combinatorial proof of his formula. In addition, we show that it is equivalent with the alternating convolution formula of…

Combinatorics · Mathematics 2013-01-16 Gábor V. Nagy

We introduce the notions of alternating roots of polynomials and alternating polynomials over a Cayley-Dickson algebra, and prove a connection between the alternating roots of a given polynomial and the roots of the corresponding…

Rings and Algebras · Mathematics 2024-02-14 Adam Chapman , Ilan Levin

We present exercises with solutions related to A Hyper-Catalan Series Solution to Polynomial Equations, and the Geode.

Combinatorics · Mathematics 2025-07-18 Dean Rubine

In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…

Combinatorics · Mathematics 2015-04-10 Shi-Mei Ma , Yeong-Nan Yeh

Roman logarithmic binomial formula analogue has been found . It is presented here also for the case of fibonomial coefficients which recently have been given a combinatorial interpretation by the present author.

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

We introduce the super Patalan numbers, a generalization of the super Catalan numbers in the sense of Gessel, and prove a number of properties analagous to those of the super Catalan numbers. The super Patalan numbers generalize the super…

Combinatorics · Mathematics 2015-02-26 Thomas M. Richardson

In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…

Combinatorics · Mathematics 2010-07-19 Emrah Kilic , Eugen J. Ionascu