Inverse system of a symbolic power. II: The Waring problem for forms (Q1895604): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jabr.1995.1169 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061162799 / rank
 
Normal rank

Latest revision as of 17:43, 21 March 2024

scientific article
Language Label Description Also known as
English
Inverse system of a symbolic power. II: The Waring problem for forms
scientific article

    Statements

    Inverse system of a symbolic power. II: The Waring problem for forms (English)
    0 references
    25 July 1996
    0 references
    In this paper one gives the solution to the classical Waring problem for forms, namely to determine \(g(d, r)=\) the smallest length of a decomposition of a general form of degree \(d\) in \(r\) variables as a sum of \(d\)-th powers of linear forms. The main tools are a result of J. Alexander and A. Hirschowitz about the Hilbert function of the ideal of functions vanishing to order two at a generic set of points of the projective space \(\mathbb{P}^{r-1}\) and a theorem of \textit{J. Emsalem} and \textit{A. Iarrobino} [Inverse system of a symbolic power. I, J. Algebra 174, 1080-1090 (1995; Zbl 0842.14002)]. One studies also other related lengths for a form \(f\), different in general from the above \(g(d, r)\), named smoothable length and scheme length. One proposes also new ``Waring problems'' with respect to these lengths.
    0 references
    Macaulay inverse system
    0 references
    classical Waring problem for forms
    0 references
    Hilbert function
    0 references
    smoothable length
    0 references
    scheme length
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references