Counting of paths and the multiplicity of determinantal rings
classification
🧮 math.AC
keywords
countingpathsandrewsapplicationcombinatorialderivedeterminantalfamilies
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.