Counting of paths and coefficients of the Hilbert polynomial of a determinantal ideal
type: Item
instance of: scholarly article
title: Counting of paths and coefficients of the Hilbert polynomial of a determinantal ideal
zbMATH Open document ID: 0853.05005
DOI: 10.1016/0012-365X(94)00345-J
author: Devadatta M. Kulkarni
published in: Discrete Mathematics
publication date: 1996-08-22T00:00:00Z
review text: 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)].
reviewed by: Indulis Strazdins
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05E99
Mathematics Subject Classification ID: 13D40
Mathematics Subject Classification ID: 13C40
zbMATH DE Number: 906897
zbMATH Keywords: path counting
zbMATH Keywords: Hilbert polynomials
zbMATH Keywords: determinantal ideals
MaRDI profile type: Publication
cites work: Q4722195
cites work: Q4206870
cites work: Q4039722
cites work: On Hilbertian ideals
cites work: Bijection between indexed monomials and standard bitableaux
cites work: On the Hilbert Function of Determinantal Rings and Their Canonical Module
cites work: Binomial determinants, paths, and hook length formulae
cites work: Q3137201
cites work: Hilbert polynomial of a certain ladder-determinantal ideal
cites work: Combinatorial meaning of the coefficients of a Hilbert polynomial
cites work: Q4001520
cites work: Nonintersecting paths, pfaffians, and plane partitions
cites work: On Hilbert polynomial of certain determinantal ideals
cites work: Q4170734
Wikidata QID: Q127719908
description: scientific article; zbMATH DE number 906897