All complete intersection varieties are Fano visitors
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kiem Y.-H. | - |
dc.contributor.author | Kim I.-K. | - |
dc.contributor.author | Lee H. | - |
dc.contributor.author | Kyoung-Seog Lee | - |
dc.date.available | 2017-05-19T01:12:15Z | - |
dc.date.created | 2017-04-24 | - |
dc.date.issued | 2017-04 | - |
dc.identifier.issn | 0001-8708 | - |
dc.identifier.uri | https://pr.ibs.re.kr/handle/8788114/3430 | - |
dc.description.abstract | We prove that the derived category of a smooth complete intersection variety is equivalent to a full subcategory of the derived category of a smooth projective Fano variety. This enables us to define a new invariant of smooth projective varieties and raise many interesting questions. © 2017 Elsevier Inc. All rights reserved. | - |
dc.language | 영어 | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.title | All complete intersection varieties are Fano visitors | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.identifier.wosid | 000398982000018 | - |
dc.identifier.scopusid | 2-s2.0-85015103633 | - |
dc.identifier.rimsid | 59274 | ko |
dc.date.tcdate | 2018-10-01 | - |
dc.contributor.affiliatedAuthor | Kyoung-Seog Lee | - |
dc.identifier.doi | 10.1016/j.aim.2017.02.030 | - |
dc.identifier.bibliographicCitation | ADVANCES IN MATHEMATICS, v.311, pp.649 - 661 | - |
dc.relation.isPartOf | ADVANCES IN MATHEMATICS | - |
dc.citation.title | ADVANCES IN MATHEMATICS | - |
dc.citation.volume | 311 | - |
dc.citation.startPage | 649 | - |
dc.citation.endPage | 661 | - |
dc.date.scptcdate | 2018-10-01 | - |
dc.description.wostc | 2 | - |
dc.description.scptc | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Derived category | - |
dc.subject.keywordAuthor | Fano variety | - |
dc.subject.keywordAuthor | Fano visitor | - |