Reduced arithmetically Gorenstein schemes and simplicial polytopes with maximal Betti numbers. (Q1417991)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Reduced arithmetically Gorenstein schemes and simplicial polytopes with maximal Betti numbers.
scientific article

    Statements

    Reduced arithmetically Gorenstein schemes and simplicial polytopes with maximal Betti numbers. (English)
    0 references
    0 references
    0 references
    6 January 2004
    0 references
    An SI-sequence is a finite sequence of positive integers which is symmetric, unimodal and satisfies a growth condition. From an arbitrary SI-sequence the authors construct a reduced, arithmetically Gorenstein configuration of linear varieties, \(G\), of arbitrary dimension whose Artinian reduction has the given SI-sequence as Hilbert function and has the weak Lefschetz property. It is shown that \(G\) has maximal graded Betti numbers among all arithmetically Gorenstein subschemes of the projective space whose Artinian reduction has the weak Lefschetz property and the given Hilbert function. Finally, it is shown that over a field of characteristic zero every set of simplicial polytopes with fixed \(h\)-vector contains a polytope with maximal graded Betti numbers.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    SI-sequence
    0 references
    Hilbert function
    0 references
    weak Lefschetz property
    0 references
    Gorenstein ideal
    0 references
    graded Betti numbers
    0 references
    simplicial polytopes
    0 references
    Gorenstein liaison
    0 references
    arithmetically Gorenstein subscheme
    0 references
    compressed algebra
    0 references
    Gorenstein configuration of linear varieties
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references