English
Related papers

Related papers: An Investigation of the Chung-Feller Theorem

200 papers

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…

Combinatorics · Mathematics 2009-07-21 Aminul Huq

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

Based on various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.

Dynamical Systems · Mathematics 2007-09-09 Bau-Sen Du

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.…

Combinatorics · Mathematics 2009-03-05 Jun Ma , Yeong-nan Yeh

We use the homological perturbation lemma to give an explicit proof of the cyclic Eilenberg-Zilber theorem for cylindrical modules.

Quantum Algebra · Mathematics 2007-05-23 M. Khalkhali , B. Rangipour

Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…

Dynamical Systems · Mathematics 2015-04-13 Bau-Sen Du

We give a direct and elementary proof of the theorem on formal functions by studying the behaviour of the Godement resolution of a sheaf of modules under completion.

Algebraic Geometry · Mathematics 2007-11-29 Fernado Sancho , Pedro Sancho

Following suggestions of T. H. Koornwinder, we give a new proof of Kummer's theorem involving Zeilberger's algorithm, the WZ method and asymptotic estimates. In the first section, we recall a classical proof given by L. J. Slater. The…

Classical Analysis and ODEs · Mathematics 2007-05-23 Bruno Gauthier

Cyclic proof theory breaks tradition by allowing certain infinite proofs: those that can be represented by a finite graph, while satisfying a soundness condition. We reconcile cyclic proofs with traditional finite proofs: we extend abstract…

Logic in Computer Science · Computer Science 2026-02-13 Lide Grotenhuis , Daniël Otten

We discuss the proof of a certain integral theorem obtained by C. G. Cullen, originally stated on the class of the analytic intrinsic functions on the quaternions. It is shown that this integral theorem is true for a larger class of…

Complex Variables · Mathematics 2010-09-22 Daniel Alayon-Solarz

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$. In this paper, we consider the refinements of Dyck paths with flaws by four…

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

We give an intuitive combinatorial proof of Ky Fan's covering lemma based on the Borsuk-Ulam theorem. We then show how this approach can be generalized to Ky Fan's covering lemma for several linear orders.

Combinatorics · Mathematics 2025-07-31 Bogdan Chornomaz

Chen's iterated integrals may be generalized by interpolation of functions of the positive integer number of times which particular forms are iterated in integrals along specific paths, to certain complex values. These generalized iterated…

Number Theory · Mathematics 2010-08-25 Sheldon Joyner

We describe a formal proof of the independence of the continuum hypothesis ($\mathsf{CH}$) in the Lean theorem prover. We use Boolean-valued models to give forcing arguments for both directions, using Cohen forcing for the consistency of…

Logic · Mathematics 2021-02-08 Jesse Michael Han , Floris van Doorn

We present a new proof of Whitney's broken circuit theorem based on induction on the number of edges and the deletion-contraction formula.

Combinatorics · Mathematics 2025-12-03 Klaus Dohmen

The assumptions needed to prove Cox's Theorem are discussed and examined. Various sets of assumptions under which a Cox-style theorem can be proved are provided, although all are rather strong and, arguably, not natural.

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern

We introduce a class of integral theorems based on cyclic functions and Riemann sums approximating integrals. The Fourier integral theorem, derived as a combination of a transform and inverse transform, arises as a special case. The…

Computation · Statistics 2022-03-22 Nhat Ho , Stephen G. Walker

We present a constructive proof of Ky Fan's combinatorial lemma concerning labellings of triangulated spheres. Our construction works for triangulations of $S^n$ that contain a flag of hemispheres. As a consequence, we produce a…

Combinatorics · Mathematics 2007-05-23 Timothy Prescott , Francis Edward Su

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

General Mathematics · Mathematics 2021-10-14 Dagnachew Jenber

These lecture notes contain an exposition of basic ideas of K-theory and cyclic cohomology. I begin with a list of examples of various situations in which the K-functor of Grothendieck appears naturally, including the rudiments of the…

funct-an · Mathematics 2008-02-03 Jacek Brodzki
‹ Prev 1 2 3 10 Next ›