MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Computing Néron–Severi groups and cycle class groups

Author(s)
Poonen, Bjorn; Testa, Damiano; van Luijk, Ronald
Thumbnail
DownloadPoonen_Computing Neron.pdf (430.9Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
Assuming the Tate conjecture and the computability of étale cohomology with finite coefficients, we give an algorithm that computes the Néron–Severi group of any smooth projective geometrically integral variety, and also the rank of the group of numerical equivalence classes of codimension p cycles for any p.
Date issued
2015-02
URI
http://hdl.handle.net/1721.1/104378
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Compositio Mathematica
Publisher
Cambridge University Press
Citation
Poonen, Bjorn, Damiano Testa, and Ronald van Luijk. “Computing Néron–Severi Groups and Cycle Class Groups.” Compositio Mathematica 151.4 (2015): 713–734.
Version: Original manuscript
ISSN
0010-437X
1570-5846

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.