English
Related papers

Related papers: On the (n,k)-th Catalan numbers

200 papers

A partition on $[n]$ has a crossing if there exists $i\_1<i\_2<j\_1<j\_2$ such that $i\_1$ and $j\_1$ are in the same block, $i\_2$ and $j\_2$ are in the same block, but $i\_1$ and $i\_2$ are not in the same block. Recently, Chen et al.…

Combinatorics · Mathematics 2009-01-23 Mireille Bousquet-Mélou , Guoce Xin

We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…

Combinatorics · Mathematics 2026-01-27 Dušan Dragutinović

Let $m\ge3$ be an integer. The polygonal numbers of order $m+2$ are given by $p_{m+2}(n)=m\binom n2+n$ $(n=0,1,2,\ldots)$. A famous claim of Fermat proved by Cauchy asserts that each nonnegative integer is the sum of $m+2$ polygonal numbers…

Number Theory · Mathematics 2017-10-06 Xiang-Zi Meng , Zhi-Wei Sun

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

Combinatorics · Mathematics 2010-02-09 Jerome Kelleher

We relate the mixed Hodge structure on the cohomology of open positroid varieties (in particular, their Betti numbers over $\mathbb{C}$ and point counts over $\mathbb{F}_q$) to Khovanov--Rozansky homology of associated links. We deduce that…

Combinatorics · Mathematics 2023-09-11 Pavel Galashin , Thomas Lam

Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells may contain more than one integer, with the added conditions that every integer at position $(i,j)$ must be smaller than every integer at…

Combinatorics · Mathematics 2017-10-05 Paul Drube

Motivated by the study of certain combinatorial properties of $(q,2)$-Fock space, we compute explicitly a sequence driven by the Catalan's convolution and parameterized by $1+q$. As an application of this explicit form, we calculate the…

Combinatorics · Mathematics 2024-03-01 Yungang Lu

A new class of alternating convolutions concerning binomial coefficients and Catalan numbers are evaluated in closed forms.

Classical Analysis and ODEs · Mathematics 2021-03-09 Wenchang Chu

We show that the Catalan-Schroeder convolution recurrences and their higher order generalizations can be solved using Riordan arrays and the Catalan numbers. We investigate the Hankel transforms of many of the recurrence solutions, and…

Combinatorics · Mathematics 2019-10-03 Paul Barry

In this note, we explore certain determinantal descriptions of the Robbins numbers. Techniques used for this include continued fractions, Riordan arrays and series inversion. Proven and conjectured representations involve the determinants…

Combinatorics · Mathematics 2021-04-09 Paul Barry

To flatten a set partition (with apologies to Mathematica) means to form a permutation by erasing the dividers between its blocks. Of course, the result depends on how the blocks are listed. For the usual listing--increasing entries in each…

Combinatorics · Mathematics 2008-02-18 David Callan

We derive a formula for $p(n)$ (the number of partitions of $n$) in terms of the partial Bell polynomials using Fa\`{a} di Bruno's formula and Euler's pentagonal number theorem.

General Mathematics · Mathematics 2021-02-24 Sumit Kumar Jha

Three-dimensional Catalan numbers are a variant of the classical (bidimensional) Catalan numbers, that count, among other interesting objects, the standard Young tableaux of shape (n,n,n). In this paper, we present a structural bijection…

Combinatorics · Mathematics 2020-12-02 Justine Falque

In this paper, we propose and investigate the concept of $k$-coalitions in graphs, where $k\ge 1$ is an integer. A $k$-coalition refers to a pair of disjoint vertex sets that jointly constitute a $k$-dominating set of the graph, meaning…

Combinatorics · Mathematics 2024-07-15 Abbas Jafari , Saeid Alikhani , Davood Bakhshesh

We will look at the Catalan numbers from the {\it Rigged Configurations} point of view originated \cite{Kir} from an combinatorial analysis of the Bethe Ansatz Equations associated with the higher spin anisotropic Heisenberg models . Our…

Combinatorics · Mathematics 2015-05-08 A. N. Kirillov

Disanto, Ferrari, Pinzani and Rinaldi have introduced the concept of 'Catalan pair', which is a pair of partial orders (S,R) satisfying certain axioms. They have shown that Catalan pairs provide a natural description of objects belonging to…

Combinatorics · Mathematics 2015-01-22 Vít Jelínek

Let c^{k,l}(n) be the number of compositions (ordered partitions) of the integer n whose Ferrers diagram fits inside a k-by-l rectangle. The purpose of this note is to give a simple, algebraic proof of a conjecture of Vatter that the…

Combinatorics · Mathematics 2007-07-10 Bruce E. Sagan

Let $f:\mathbb{Z}\longrightarrow \{ \times \cdot\}$ be a function such that $f(a) = \cdot$ for all except finitely for many $a \in \mathbb{Z}$. We define a set $\flat f$ of non-intersecting arc (or cap) diagrams satisfying certain…

Combinatorics · Mathematics 2026-02-10 Ian M. Musson

We first establish the result that the Narayana polynomials can be represented as the integrals of the Legendre polynomials. Then we represent the Catalan numbers in terms of the Narayana polynomials by three different identities. We give…

Combinatorics · Mathematics 2008-05-12 Toufik Mansour , Yidong Sun

Let $\{P_n\}$ be the Catalan-Larcombe-French numbers given by $P_0=1,\ P_1=8$ and $n^2P_n=8(3n^2-3n+1)P_{n-1}-128(n-1)^2P_{n-2}$ $(n\ge 2)$, and let $S_n=P_n/2^n$. In this paper we deduce congruences for $S_{mp^r}\pmod{p^{r+2}}$,…

Number Theory · Mathematics 2015-07-15 Xiao-Juan Ji , Zhi-Hong Sun
‹ Prev 1 8 9 10 Next ›