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

DOI10.1090/S0002-9947-99-01884-XzbMath0908.05004OpenAlexW1598434246MaRDI QIDQ4226662

M. Prohaska, Christian Krattenthaler

Publication date: 27 January 1999

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-99-01884-x

zbMATH Keywords

nonintersecting lattice pathsHilbert seriesturnsladder determinantal ringsnon-crossing two-rowed arrays

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10) Linkage, complete intersections and determinantal ideals (13C40) Rings with straightening laws, Hodge algebras (13F50)

Related Items (max. 100)

Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas ⋮ Computation of the a-invariant of ladder determinantal rings ⋮ A determinantal formula for the Hilbert series of determinantal rings of one-sided ladder. ⋮ A history and a survey of lattice path enumeration ⋮ A Note on a Path Counting Formula ⋮ Monomial and toric ideals associated to Ferrers graphs ⋮ The \(h\)-vector of a ladder determinantal ring cogenerated by \(2\times 2\) minors is log-concave ⋮ On multiplicities of points on Schubert varieties in Grassmannians. II

This page was built for publication: A remarkable formula for counting nonintersecting lattice paths in a ladder with respect to turns