Skip to main navigation Skip to search Skip to main content

A remarkable formula for counting nonintersecting lattice paths in a ladder with respect to turns

  • Christian Krattenthaler
  • , Maria Prohaska

Publications: Contribution to journalArticlePeer Reviewed

Abstract

We prove a formula, conjectured by Conca and Herzog, for the number of all families of nonintersecting lattice paths with certain starting and end points in a region that is bounded by an upper ladder. Thus we are able to compute explicitly the Hubert series for certain one-sided ladder determinantal rings. ©1999 American Mathematical Society.
Original languageEnglish
Pages (from-to)1015-1042
Number of pages28
JournalTransactions of the American Mathematical Society
Volume351
Issue number3
Publication statusPublished - 1999

Austrian Fields of Science 2012

  • 1010 Mathematics

Fingerprint

Dive into the research topics of 'A remarkable formula for counting nonintersecting lattice paths in a ladder with respect to turns'. Together they form a unique fingerprint.

Cite this