arXiv · math/0210375
Counting of paths and the multiplicity of determinantal rings
Abstract
In this paper, we derive several formulas of counting families of non-intersecting paths for two-sided ladder-shaped regions. As an application, we give a new proof to a combinatorial interpretation of Fibonacci numbers obtained by G. Andrews in 1974.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hsin-Ju Wang. 2002-10-24. Counting of paths and the multiplicity of determinantal rings. https://arxiv.org/abs/math/0210375
Cite the original work for its findings. Save a collection to share your selection of sources.