Abstract

Let nu _{d,n}: mathbb {P}^nrightarrow mathbb {P}^r, r=left( {begin{array}{c}n+d nend{array}}right) , be the order d Veronese embedding. For any d_nge cdots ge d_1>0 let check{eta }(n,d;d_1,ldots ,d_n)subseteq mathbb {P}^r be the union of all linear spans of nu _{d,n}(S) where Ssubset mathbb {P}^n is a finite set which is the complete intersection of hypersurfaces of degree d_1, dots ,d_n. For any qin check{eta }(n,d;d_1,ldots ,d_n), we prove the uniqueness of the set nu _{d,n}(S) if dge d_1+cdots +d_{n-1}+2d_n-n and q is not spanned by a proper subset of nu _{d,n}(S). We compute dim check{eta }(2,d;d_1,d_1) when dge 2d_1.

Highlights

  • − 1, denote the Veronese embedding of Pn

  • For any dn let η(n, d; d1, . . . , dn) ⊆ Pr be the union of all linear spans of νd,n(S) where S ⊂ Pn is a finite set which is the complete intersection of hypersurfaces of degree d1, . . . , dn

  • For any q ∈ η(n, d; d1, . . . , dn), we prove the uniqueness of the set νd,n(S) if d ≥ d1 + · · · + dn−1 + 2dn − n and q is not spanned by a proper subset of νd,n(S)

Read more

Summary

Introduction

− 1, denote the Veronese embedding of Pn. For any scheme, A ⊂ νn,d (Pn) let A denote the linear span of A in Pr. Dn) ⊆ Pr be the union of all linear spans of νd,n(S) where S ⊂ Pn is a finite set which is the complete intersection of hypersurfaces of degree d1, . Dn), we prove the uniqueness of the set νd,n(S) if d ≥ d1 + · · · + dn−1 + 2dn − n and q is not spanned by a proper subset of νd,n(S).

Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.