Counting of paths and the multiplicity of determinantal rings
Commutative Algebra
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.math/0210375,
title = {Counting of paths and the multiplicity of determinantal rings},
author = {Hsin-Ju Wang},
journal= {arXiv preprint arXiv:math/0210375},
year = {2007}
}
Comments
23 pages