English
Related papers

Related papers: Eulerian-Catalan Numbers

200 papers

We provide a context around a conjectured closed form for the Hankel transform of linear combinations of consecutive pairs of Catalan numbers. This generalizes the formula for the Hankel transforms of the shifted Catalan numbers and the…

Combinatorics · Mathematics 2020-11-24 Paul Barry

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

We announce a series of results on the combinatorial study of the q-Catalan triangle (C_{n,k}(q)), defined by C_{n,0}(q)=q^{n(n-1)/2} and C_{n,k}(q)=C_{n,k-1}(q)+q^{n-k-1}C_{n-1,k}(q). We establish combinatorial interpretations via a…

Combinatorics · Mathematics 2026-05-15 Youssouf Wirdane

We show bijectively that the Catalan number C_n counts Dyck (n+1)-paths in which the terminal descent is of even length and all other descents to ground level (if any) are of odd length.

Combinatorics · Mathematics 2007-05-23 David Callan

A formula of Stembridge states that the permutation peak polynomials and descent polynomials are connected via a quadratique transformation. The aim of this paper is to establish the cycle analogue of Stembridge's formula by using cycle…

Combinatorics · Mathematics 2020-07-30 Bin Han , Jianxi Mao , Jiang Zeng

We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

We show how the Fuss-Catalan numbers $ \frac{1}{p n+1}\binom{pn+1}{n}$ enter different problems of counting simple and multiple planar partitions.

Combinatorics · Mathematics 2023-11-07 Francesca Aicardi

The classical Eulerian polynomials can be expanded in the basis $t^{k-1}(1+t)^{n+1-2k}$ ($1\leq k\leq\lfloor (n+1)/2\rfloor$) with positive integral coefficients. This formula implies both the symmetry and the unimodality of the Eulerian…

Combinatorics · Mathematics 2012-04-02 Guoniu Han , Frédéric Jouhet , Jiang Zeng

We define two symmetric $q,t$-Catalan polynomials in terms of the area and depth statistic and in terms of the dinv and dinv of depth statistics. We prove symmetry using an involution on plane trees. The same involution proves symmetry of…

Combinatorics · Mathematics 2022-08-12 Joseph Pappe , Digjoy Paul , Anne Schilling

Nicholas Pippenger and Kristin Schleich have recently given a combinatorial interpretation for the second-order super-Catalan numbers (u_{n})_{n>=0}=(3,2,3,6,14,36,...): they count "aligned cubic trees" on n internal vertices. Here we give…

Combinatorics · Mathematics 2007-05-23 David Callan

Let $T$ be a tree on $n$ vertices. We can regard the edges of $T$ as transpositions of the vertex set; their product (in any order) is a cyclic permutation. All possible cyclic permutations arise (each exactly once) if and only if the tree…

Combinatorics · Mathematics 2020-10-29 Peter J. Cameron , Liam Stott

The theory of differential equations has an arithmetic analogue in which derivatives of functions are replaced by Fermat quotients of numbers. Many classical differential equations (Riccati, Weierstrass, Painlev\'{e}, etc.) were previously…

Algebraic Geometry · Mathematics 2016-06-08 Alexandru Buium , Emma Previato

We prove exact asymptotic expansions for the partial sums of the sequences of central binomial coefficients and Catalan numbers, $\sum_{k=0}^n \binom{2k}{k}$ and $\sum_{k=0}^n C_n$. We also obtain closed forms for the polynomials…

Combinatorics · Mathematics 2010-01-13 Sandro Mattarei

A classical result states that the parity balance of the number of excedances of all permutations (derangements, respectively) of length $n$ is the Euler number. In 2010, Josuat-Verg\`{e}s gives a $q$-analogue with $q$ representing the…

Combinatorics · Mathematics 2020-06-25 Hsin-Chieh Liao

Andr\'e proved that the number of alternating permutations on $\{1, 2, \dots, n\}$ is equal to the Euler number $E_n$. A refinement of Andr\'e's result was given by Entringer, who proved that counting alternating permutations according to…

Combinatorics · Mathematics 2022-03-22 Yoann Gelineau , Heesung Shin , Jiang Zeng

We present a formula for a generalisation of the Eulerian polynomial, namely the generating polynomial of the joint distribution of major index and descent statistic over the set of signed multiset permutations. It has a description in…

Combinatorics · Mathematics 2025-04-11 Elena Tielker

We introduce a family of quasisymmetric functions called {\em Eulerian quasisymmetric functions}, which specialize to enumerators for the joint distribution of the permutation statistics, major index and excedance number on permutations of…

Combinatorics · Mathematics 2010-08-24 John Shareshian , Michelle L. Wachs

We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…

Number Theory · Mathematics 2021-03-01 Abdelmejid Bayad , Takao Komatsu

Gessel conjectured that the two-sided Eulerian polynomial, recording the common distribution of the descent number of a permutation and that of its inverse, has non-negative integer coefficients when expanded in terms of the gamma basis.…

Combinatorics · Mathematics 2018-04-24 Ron M. Adin , Eli Bagno , Estrella Eisenberg , Shulamit Reches , Moriah Sigron

We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, $\tau=123$ and $n$ even, is a bijection that associates a Dyck prefix of…

Combinatorics · Mathematics 2009-10-14 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani
‹ Prev 1 4 5 6 7 8 10 Next ›