中文
相关论文

相关论文: Multivariate Fuss-Catalan numbers

200 篇论文

This note provide bijective proofs of two combinatorial identities involving generalized Catalan number $C_{m,5}(n)={m\over 5n+m}{5n+m\choose n}$ recently proposed by Sun.

组合数学 · 数学 2008-05-27 Sherry H. F. Yan

Let $C_n$ be the $n$th Catalan number. We show that the asymptotic density of the set $\{n: C_n \equiv 0 \mod p \}$ is $1$ for all primes $p$, We also show that if $n = p^k -1$ then $C_n \equiv -1 \mod p$. Finally we show that if $n \equiv…

数论 · 数学 2017-01-12 Rob Burns

We present an explicit formula for the transition matrix $\mathcal{C}$ from the type $C_n$ degeneration of the Koornwinder polynomials $P_{(1^r)}(x\,|\,a,-a,c,-c\,|\,q,t)$ with one column diagrams, to the type $C_n$ monomial symmetric…

量子代数 · 数学 2018-09-21 Ayumu Hoshino , Jun'ichi Shiraishi

It is natural to ask, given a permutation with no three-term ascending subsequence, at what index the first ascent occurs. We shall show, using both a recursion and a bijection, that the number of 123-avoiding permutations at which the…

组合数学 · 数学 2014-01-14 Samuel Connolly , Zachary Gabor , Anant Godbole

For fixed $t\ge 2$, we consider the class of representations of $1$ as sum of unit fractions whose denominators are powers of $t$ or equivalently the class of canonical compact $t$-ary Huffman codes or equivalently rooted $t$-ary plane…

数论 · 数学 2015-09-16 Clemens Heuberger , Daniel Krenn , Stephan Wagner

Action graphs emerged from work of Bergner and Hackney on category actions in the context of Reedy categories. Alvarez, Bergner, and Lopez showed that action graphs could be inductively generated without reference to category actions and…

The set of Dyck paths of length $2n$ inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths:…

组合数学 · 数学 2012-06-14 Saul A. Blanco , T. Kyle Petersen

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…

组合数学 · 数学 2026-02-10 Ian M. Musson

We establish closed-form enumeration formulas for chromatic feature vectors of 2-trees under the bichromatic triangle constraint. These efficiently computable structural features derive from constrained graph colorings where each triangle…

数据结构与算法 · 计算机科学 2025-12-09 J. Allagan , G. Morgan , S. Langley , R. Lopez-Bonilla , V. Deriglazov

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.

组合数学 · 数学 2007-05-23 David Callan

Generalizing previous results, we introduce and study a new statistic on words, that we call rectangle capacity. For two fixed positive integers $r$ and $s$, this statistic counts the number of occurrences of a rectangle of size $r\times s$…

组合数学 · 数学 2024-05-14 Sela Fried , Toufik Mansour

We find the joint distribution of three simple statistics on lattice paths of n upsteps and n downsteps leading to a triple sum identity for the central binomial coefficient {2n}-choose-{n}. We explain why one of the constituent double sums…

组合数学 · 数学 2012-06-15 David Callan

We find an explicit $S_n$-equivariant bijection between the integral points in a certain zonotope in $\mathbb{R}^n$, combinatorially equivalent to the permutahedron, and the set of $m$-parking functions of length $n$. This bijection…

组合数学 · 数学 2026-02-19 Valery Lunts , Špela Špenko , Michel Van den Bergh

We present a generating function and a closed counting formula in two variables that enumerate a family of classes of permutations that avoid or contain an increasing pattern of length three and have a prescribed number of occurrences of…

组合数学 · 数学 2009-12-25 Hilmar Gudmundsson

During the study of dual sequences, Sun introduced the polynomials \[ D_n(x,y)=\sum_{k=0}^{n}{n\choose k}{x\choose k}y^k\text{ and } S_n(x,y)=\sum_{k=0}^{n}\binom{n}{k}\binom{x}{k}\binom{-1-x}{k} y^k. \] Many related congruences have been…

组合数学 · 数学 2020-10-26 Rong-Hua Wang , Michael X. X. Zhong

Decision trees are popular machine learning models that are simple to build and easy to interpret. Even though algorithms to learn decision trees date back to almost 50 years, key properties affecting their generalization error are still…

机器学习 · 计算机科学 2020-10-16 Jean-Samuel Leboeuf , Frédéric LeBlanc , Mario Marchand

This work is a continuation of some recent articles presenting enumerative results for Catalan words avoiding one or a pair of consecutive or classical patterns of length $3$. More precisely, we provide systematically the bivariate…

组合数学 · 数学 2023-02-27 Jean-Luc Baril , José Luis Ramírez

We introduce an inductively defined sequence of directed graphs and prove that the number of edges added at step $k$ is equal to the $k$th Catalan number. Furthermore, we establish an isomorphism between the set of edges adjoined at step…

组合数学 · 数学 2020-02-21 Gerardo Alvarez , Julia E. Bergner , Ruben Lopez

Recent works have shown that the family of probability distributions with moments given by the Fuss-Catalan numbers permit a simple parameterized form for their density. We extend this result to the Raney distribution which by definition…

数学物理 · 物理学 2015-06-19 Peter J. Forrester , Dang-Zheng Liu

We analyze the combinatorics behind the operation of taking the logarithm of the generating function $G_k$ for $k^\text{th}$ generalized Catalan numbers. We provide combinatorial interpretations in terms of lattice paths and in terms of…

组合数学 · 数学 2025-07-02 Sabine Jansen , Leonid Kolesnikov