Mathematics > Algebraic Geometry
[Submitted on 29 Jul 2022 (v1), last revised 2 Mar 2023 (this version, v2)]
Title:Computing heights via limits of Hodge structures
View PDFAbstract:We consider the problem of explicitly computing Beilinson--Bloch heights of homologically trivial cycles on varieties defined over number fields. Recent results have established a congruence, up to the rational span of logarithms of primes, between the height of certain limit mixed Hodge structures and certain Beilinson--Bloch heights obtained from odd-dimensional hypersurfaces with a node. This congruence suggests a new method to compute Beilinson--Bloch heights. Here we explain how to compute the relevant limit mixed Hodge structures in practice, then apply our computational method to a nodal quartic curve and a nodal cubic threefold. In both cases, we explain the nature of the primes occurring in the congruence.
Submission history
From: Emre Can Sertöz [view email][v1] Fri, 29 Jul 2022 18:00:14 UTC (24 KB)
[v2] Thu, 2 Mar 2023 12:14:01 UTC (24 KB)
Current browse context:
math.AG
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.