On a divisor of the central binomial coefficient
From MaRDI portal
Abstract: It is well known that for all the number is a divisor of the central binomial coefficient . Since the th central binomial coefficient equals the number of lattice paths from to by unit steps north or east, a natural question is whether there is a way to partition these paths into sets of paths or equinumerous sets of paths. The Chung-Feller theorem gives an elegant answer to this question. We pose and deliver an answer to the analogous question for , another divisor of . We then show our main result follows from a more general observation regarding binomial coefficients with and relatively prime. A discussion of the case where and are not relatively prime is also given, highlighting the limitations of our methods. Finally, we come full circle and give a novel interpretation of the Catalan numbers.
Recommendations
Cites work
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 2331355 (Why is no real title available?)
- An Tu Ming, the first discoverer of the Catalan numbers
- Central binomial coefficients divisible by or coprime to their indices
- Divisors of the Middle Binomial Coefficient
- Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients
- Generalized Dyck paths
- On Fluctuations in Coin-Tossing
- On divisors of binomial coefficients. I
Cited in
(5)
This page was built for publication: On a divisor of the central binomial coefficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127839)