Counting of paths and the multiplicity of determinantal rings

Simple item page
dc.creatorWang, Hsin-Ju
dc.date2002-10-24
dc.date.accessioned2026-07-07T04:52:18Z
dc.date.available2026-07-07T04:52:18Z
dc.descriptionIn 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.
dc.description23 pages
dc.identifierhttps://arxiv.org/abs/math/0210375
dc.identifierhttp://arxiv.org/abs/math/0210375
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65415
dc.subjectCommutative Algebra
dc.titleCounting of paths and the multiplicity of determinantal rings
dc.typetext

Files

Collections

arXiv