English
Related papers

Related papers: Eulerian-Catalan Numbers

200 papers

In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…

Combinatorics · Mathematics 2007-05-23 Einar Steingrimsson , Lauren K. Williams

By considering Eulerian numbers and ordered Stirling numbers of the second and third kinds over a multiset, we generalize identities of Eulerian numbers and Stirling numbers of the second and third kinds and provide $q$-analogs of these…

Combinatorics · Mathematics 2012-09-07 Joon Yop Lee

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with flaws $m$ is the $n$-th Catalan number and independent on $m$. L. Shapiro [7] found the Chung-Feller properties for the Motzkin paths. In this…

Combinatorics · Mathematics 2008-12-17 Jun Ma , Yeong-Nan Yeh

We present new proofs of eight integral representations of the Catalan numbers. Then, we create analogous integral representations of the Motzkin numbers and obtain new results. Most integral representations of counting sequences found in…

Number Theory · Mathematics 2019-01-23 Peter McCalla , Asamoah Nkwanta

In recent, H. Sun defined a new kind of refined Eulerian polynomials, namely, \begin{eqnarray*} A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)} \end{eqnarray*} for $n\geq 1$, where ${odes}(\pi)$ and ${edes}(\pi)$…

Combinatorics · Mathematics 2018-10-19 Yidong Sun , Liting Zhai

We study decreasing binary trees in which every vertex with two children is colored red or blue. We construct two bijections. The first, to ordered set partitions into odd-sized blocks each arranged as an alternating permutation, shows that…

Combinatorics · Mathematics 2026-05-18 Miklós Bóna , Vincent Vatter

The symmetries of the general Euler equations of fluid dynamics with polytropic exponent are determined using the Kaluza-Klein type framework of Duval et $\it{al}$. In the standard polytropic case the recent results of O'Raifeartaigh and…

High Energy Physics - Theory · Physics 2016-08-15 M. Hassaïne , P. A. Horváthy

For the elements of a Coxeter group, we present a statistic called depth, defined in terms of factorizations of the elements into products of reflections. Depth is bounded above by length and below by the average of length and reflection…

Combinatorics · Mathematics 2014-08-21 T. Kyle Petersen , Bridget Eileen Tenner

We study the combinatorics of ad-nilpotent ideals of a Borel subalgebra of $sl(n+1,\Bbb C)$. We provide an inductive method for calculating the class of nilpotence of these ideals and formulas for the number of ideals having a given class…

Rings and Algebras · Mathematics 2007-05-23 George E. Andrews , Christian Krattenthaler , Luigi Orsina , Paolo Papi

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

We conjecture a formula for the rational $q,t$-Catalan polynomial $\mathcal{C}_{r/s}$ that is symmetric in $q$ and $t$ by definition. The conjecture posits that $\mathcal{C}_{r/s}$ can be written in terms of symmetric monomial strings…

Combinatorics · Mathematics 2024-12-31 Graham Hawkes

In the paper, the authors analytically generalize the Catalan numbers in combinatorial number theory, establish an integral representation of the analytic generalization of the Catalan numbers by virtue of Cauchy's integral formula in the…

Combinatorics · Mathematics 2023-04-18 Wen-Hui Li , Jian Cao , Da-Wei Niu , Jiao-Lian Zhao , Feng Qi

We study a subset of permutations, where entries are restricted to having the same remainder as the index, modulo some integer $k \geq 2$. We show that when also imposing the classical 132- or 213-avoidance restriction on the permutations,…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson , Samuel Asefa Fufa , Frether Getachew , Dun Qiu

Let $A(\ell,n,k)$ denote the number of $\ell$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We provide a new proof of an explicit formula for $A(\ell,n,k)$…

Combinatorics · Mathematics 2024-04-17 Abdelmalek Abdesselam , Pedro Brunialti , Tristan Doan , Philip Velie

Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…

Number Theory · Mathematics 2020-10-21 Nabin Kumar Meher , Sudhansu Sekhar Rout

In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…

Number Theory · Mathematics 2008-08-14 Taekyun Kim

We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…

Combinatorics · Mathematics 2007-05-23 Emeric Deutsch , Bruce E. Sagan

We conjecture two combinatorial interpretations for the symmetric function $\Delta_{e_k} e_n$, where $\Delta_f$ is an eigenoperator for the modified Macdonald polynomials defined by Bergeron, Garsia, Haiman, and Tesler. Both interpretations…

Combinatorics · Mathematics 2017-09-07 James Haglund , Jeffrey Remmel , Andrew Timothy Wilson

Dyck paths (also balanced brackets and Dyck words) are among the most heavily studied Catalan families. This paper is a continuation of [2, 3]. In the paper we enumerate the terms of the OEIS A036991, Dyck numbers, and construct a…

Combinatorics · Mathematics 2023-02-07 Gennady Eremin

It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…

Combinatorics · Mathematics 2007-05-23 E. Barcucci , A. Bernini , M. Poneti