Counting of paths and the multiplicity of determinantal rings

2002/10/24 by Hsin-Ju Wang, Wang, Hsin-Ju
Mathematics · #Commutative Algebra (math.AC) #FOS: Mathematics #math.AC

paper · pdf · doi:10.48550/arxiv.math/0210375

23 pages

arxiv created 2002/10/24 · arxiv updated 2009/11/30

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.

Related

• A conjecture of Herzog and Conca on counting of paths
• A determinantal formula for the Hilbert series of one-sided ladder determinantal rings
• Counting Trees in a Certain Class of Graphs
• Euler numbers and diametral paths in Fibonacci cubes, Lucas cubes and Alternate Lucas cubes
• Koroljuk's formula for counting lattice paths revisited