𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computation of Hilbert Polynomials in Two Variables

✍ Scribed by Alexander Levin


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
474 KB
Volume
28
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis


Let R be a ring of polynomials in m + n indeterminates x 1 , . . . , xm, y 1 , . . . , yn over a field K and let M be a finitely generated R-module. Furthermore, let (Rrs) r,s∈N be the natural double filtration of the ring R and let (Mrs) r,s∈N be the corresponding double filtration of the module M associated with the given system of generators. We introduce a special type of reduction in a free R-module and develop the appropriate technique of characteristic sets that allows us to prove the existence and find methods and algorithms of computation of a numerical polynomial in two variables Ο†(t 1 , t 2 ) such that Ο†(r, s) = dim K Mrs for all sufficienly large r, s ∈ N . The results obtained are applied in differential algebra where the classical theorems on differential dimension polynomials and methods of computation of such polynomials are generalized to the case of differential structures with two basic sets of derivation operators.


πŸ“œ SIMILAR VOLUMES


Some q-Polynomials in two Variables
✍ Leonard Carlitz πŸ“‚ Article πŸ“… 1958 πŸ› John Wiley and Sons 🌐 English βš– 414 KB
Stieltjes Type Theorems for Orthogonal P
✍ Zhong-xuan Luo; Ren-hong Wang πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 111 KB

In this paper, some important properties of orthogonal polynomials of two variables are investigated. The concepts of invariant factor for orthogonal polynomials of two variables are introduced. The presented results include Stieltjies type theorems for multivariate orthogonal polynomials and the co

Lagrange polynomials of a complex variab
✍ R. H. T. Bates; M. O. Milner πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 458 KB

## Abstract We recognize that established techniques permit two‐dimensional interpolation to be accomplished efficiently as well as accurately when the grid of points, on which the data is available, is regular. Existing methods suitable for irregular grids are computationally protracted. We show t