Counting of paths and coefficients of the Hilbert polynomial of a determinantal ideal
The author obtains some formulas for counting sets of paths having a fixed number of nodes in a rectangular lattice, thus giving a combinatorial interpretation of Hilbert polynomials of generalized determinantal ideals and answering some questions raised by \textit{S. S. Abhyankar} [Enumerative combinatorics of Young tableaux (1988; Zbl 0643.05001)].
scientific article; zbMATH DE number 906897