Abhyankar’s Recursive Formula Regarding Standard Bi-Tableau

Shirinivas G. Udpikar

Chapter 15 in Algebraic Geometry and its Applications, 1994, pp 251-259 from Springer

Abstract: Abstract Let X = (X ij ) be an m(l) by m(2) matrix whose entries X ij , 1 ≤ i ≤ m(1), 1 ≤ j ≤ m(2); are indeterminants over a field K. Let K[X] be the polynomial ring in these m(l)m(2) variables over K. In [1], Abhyankar enumerates standard Young bi-tableau with certain conditions and deduces that standard monomials in minors of X form a base for the vector space K[X] over K, a well known result which has been proved by DeConcini-Eisenbud Procesi using straightening formula [2]. The polynomial expression enumerating these bi-tableau involves certain integer valued functions F D (LK) (m, p, a), which characterize the Hilbert polynomial of certain determinantal ideals. Using Abhyankar’s recursive formula developed in [1], we prove certain properties of these integer valued functions.

Date: 1994
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2628-4_15

Ordering information: This item can be ordered from
http://www.springer.com/9781461226284

DOI: 10.1007/978-1-4612-2628-4_15

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().