An Investigation of the Chung-Feller Theorem

Generalizations of Chung-Feller Theorem

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 paper, we find the connections between these two Chung-Feller theorems. We focus on the weighted versions of three classes of lattice paths and give the generalizations of the above two theorems. We prove the Chung-Feller theorems of Dyck type for these three classes of lattice paths and the Chung-Feller theorems of Motzkin type for two of these three classe…

Generalized Chung-Feller Theorems for Lattice Paths (Thesis)

In this thesis we develop generalized versions of the Chung-Feller theorem for lattice paths constrained in the half plane. The beautiful cycle method which was developed by Devoretzky and Motzkin as a means to prove the ballot problem is modified and applied to generalize the classical Chung-Feller theorem. We use Lagrange inversion to derive the generalized formulas. For the generating function proof we study various ways of decomposing lattice paths. We also show some results related to equidistribution properties in terms of Narayana and Catalan generating functions. We then develop genera…

Generalizations of Chung-Feller Theorem II

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. L. Shapiro [9] found the Chung-Feller properties for the Motzkin paths. Mohanty's book [5] devotes an entire section to exploring Chung-Feller theorem. Many Chung-Feller theorems are consequences of the results in [5]. In this paper, we consider the $(n,m)$-lattice paths. We study two parameters for an $(n,m)$-lattice path: the non-positive length and the rightmost minimum length. We obtain the Chung-Feller theorems of the $(n,m)$-latti…

A minimum-change version of the Chung-Feller theorem for Dyck paths

A Dyck path with $2k$ steps and $e$ flaws is a path in the integer lattice that starts at the origin and consists of $k$ many $\nearrow$-steps and $k$ many $\searrow$-steps that change the current coordinate by $(1,1)$ or $(1,-1)$, respectively, and that has exactly $e$ many $\searrow$-steps below the line $y=0$. Denoting by $D_{2k}^e$ the set of Dyck paths with $2k$ steps and $e$ flaws, the Chung-Feller theorem asserts that the sets $D_{2k}^0,D_{2k}^1,\ldots,D_{2k}^k$ all have the same cardinality $\frac{1}{k+1}\binom{2k}{k}=C_k$, the $k$-th Catalan number. The standard combinatorial proof of…

通过多元解析组合的中心极限定理

Central Limit Theorems via Analytic Combinatorics in Several Variables

本文从概率视角综述多元解析组合（ACSV）方法，提供SageMath包自动计算并验证组合生成函数的极限定理，并为特定组合类建立显式局部中心极限定理，证明相关猜想。