Results 1 to 10 of about 18,619 (166)

A Unified Generalization of the Catalan, Fuss, and Fuss–Catalan Numbers

open access: yesMathematical and Computational Applications, 2019
In the paper, the authors introduce a unified generalization of the Catalan numbers, the Fuss numbers, the Fuss−Catalan numbers, and the Catalan−Qi function, and discover some properties of the unified generalization, including a product ...
Feng Qi, Xiao-Ting Shi, Pietro Cerone
doaj   +3 more sources

A Brief Survey and an Analytic Generalization of the Catalan Numbers and Their Integral Representations

open access: yesMathematics, 2023
In the paper, the authors briefly survey several generalizations of the Catalan numbers in combinatorial number theory, analytically generalize the Catalan numbers, establish an integral representation of the analytic generalization of the Catalan ...
Jian Cao   +4 more
doaj   +1 more source

Stochastic Process Leading to Catalan Number Recurrence

open access: yesMathematics, 2023
Motivated by a simple model of earthquake statistics, a finite random discrete dynamical system is defined in order to obtain Catalan number recurrence by describing the stationary state of the system in the limit of its infinite size.
Mariusz Białecki
doaj   +1 more source

Eulerian-Catalan Numbers [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2011
We show that the Eulerian-Catalan numbers enumerate Dyck permutations. We provide two proofs for this fact, the first using the geometry of alcoved polytopes and the second a direct combinatorial proof via an Eulerian-Catalan analogue of the Chung-Feller theorem.
Bidkhori, Hoda, Sullivant, Seth
openaire   +3 more sources

Noncommutative Catalan Numbers [PDF]

open access: yesAnnals of Combinatorics, 2019
The goal of this paper is to introduce and study noncommutative Catalan numbers $C_n$ which belong to the free Laurent polynomial algebra in $n$ generators. Our noncommutative numbers admit interesting (commutative and noncommutative) specializations, one of them related to Garsia-Haiman $(q,t)$-versions, another -- to solving noncommutative quadratic ...
Berenstein, A., Retakh, V.
openaire   +3 more sources

Some combinatorial identities containing central binomial coefficients or Catalan numbers*

open access: yesApplied Mathematics in Science and Engineering, 2023
In the article, by virtue of Maclaurin's expansions of the arcsine function and its square and cubic, the authors give a short proof of a sum formula of a Maclaurin's series with coefficients containing reciprocals of the Catalan numbers; establish four ...
Feng Qi, Da-Wei Niu, Dongkyu Lim
doaj   +1 more source

Catalan fragile words [PDF]

open access: yesInternational Journal of Group Theory, 2020
‎Fragile words have been already considered in the context of automata groups‎. ‎Here we focus our attention on a special class of strongly fragile words that we call Catalan fragile words‎.
Daniele D'Angeli   +2 more
doaj   +1 more source

Catalan words avoiding pairs of length three patterns [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2021
Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, pursuing the recent initiating work of the first and last authors and of S.
Jean-Luc Baril   +2 more
doaj   +1 more source

Bijections between noncrossing and nonnesting partitions for classical reflection groups [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2009
We present $\textit{type preserving}$ bijections between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis and Reiner. The bijections for the abstract Coxeter types $B$, $C$ and $D$ are new in
Alex Fink, Benjamin Iriarte Giraldo
doaj   +1 more source

The $(m, n)$-rational $q, t$-Catalan polynomials for $m=3$ and their $q, t$-symmetry [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
We introduce a new statistic, skip, on rational $(3,n)$-Dyck paths and define a marked rank word for each path when $n$ is not a multiple of 3. If a triple of valid statistics (area; skip; dinv) are given, we have an algorithm to construct the marked ...
Ryan Kaliszewski, Huilan Li
doaj   +1 more source

Home - About - Disclaimer - Privacy