Eventual tightness of projective dimension growth bounds: quadratic in the degree

Raf Cluckers, Itay Glazer
{"title":"Eventual tightness of projective dimension growth bounds: quadratic in the degree","authors":"Raf Cluckers, Itay Glazer","doi":"arxiv-2409.08776","DOIUrl":null,"url":null,"abstract":"In projective dimension growth results, one bounds the number of rational\npoints of height at most $H$ on an irreducible hypersurface in $\\mathbb P^n$ of\ndegree $d>3$ by $C(n)d^2 H^{n-1}(\\log H)^{M(n)}$, where the quadratic\ndependence in $d$ has been recently obtained by Binyamini, Cluckers and Kato in\n2024 [1]. For these bounds, it was already shown by Castryck, Cluckers,\nDittmann and Nguyen in 2020 [3] that one cannot do better than a linear\ndependence in $d$. In this paper we show that, for the mentioned projective\ndimension growth bounds, the quadratic dependence in $d$ is eventually tight\nwhen $n$ grows. More precisely the upper bounds cannot be better than\n$c(n)d^{2-2/n} H^{n-1}$ in general. Note that for affine dimension growth (for\naffine hypersurfaces of degree $d$, satisfying some extra conditions), the\ndependence on $d$ is also quadratic by [1], which is already known to be\noptimal by [3]. Our projective case thus complements the picture of tightness\nfor dimension growth bounds for hypersurfaces.","PeriodicalId":501064,"journal":{"name":"arXiv - MATH - Number Theory","volume":"28 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Number Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In projective dimension growth results, one bounds the number of rational points of height at most $H$ on an irreducible hypersurface in $\mathbb P^n$ of degree $d>3$ by $C(n)d^2 H^{n-1}(\log H)^{M(n)}$, where the quadratic dependence in $d$ has been recently obtained by Binyamini, Cluckers and Kato in 2024 [1]. For these bounds, it was already shown by Castryck, Cluckers, Dittmann and Nguyen in 2020 [3] that one cannot do better than a linear dependence in $d$. In this paper we show that, for the mentioned projective dimension growth bounds, the quadratic dependence in $d$ is eventually tight when $n$ grows. More precisely the upper bounds cannot be better than $c(n)d^{2-2/n} H^{n-1}$ in general. Note that for affine dimension growth (for affine hypersurfaces of degree $d$, satisfying some extra conditions), the dependence on $d$ is also quadratic by [1], which is already known to be optimal by [3]. Our projective case thus complements the picture of tightness for dimension growth bounds for hypersurfaces.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
投影维度增长边界的最终严密性:度数的二次方
在投影维数增长结果中,人们用$C(n)d^^2 H^{n-1}(\log H)^{M(n)}$ 来约束degree $d>3$ 的 $\mathbb P^n$ 不可还原超曲面上高度最多为 $H$ 的有理点的数目,其中 $d$ 的二次依赖性最近由 Binyamini、Cluckers 和 Kato 在 2024 年得到[1]。对于这些边界,Castryck、Cluckers、Dittmann 和 Nguyen 在 2020 年[3]已经证明,我们不可能做得比 $d$ 中的线性依赖更好。在本文中,我们将证明,对于上述投影维度的增长边界,当 $n$ 增长时,$d$ 中的二次依赖性最终是紧密的。更确切地说,在 $n$ 增长时,上限不可能优于$c(n)d^{2-2/n}$。H^{n-1}$。请注意,对于仿射维度增长(对于满足一些额外条件的度数为 $d$ 的仿射超曲面),与 $d$ 的依赖关系也是二次方的[1],这在[3]中已被认为是最优的。因此,我们的投影案例补充了超曲面维度增长约束的紧致性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Diophantine stability and second order terms On the structure of the Bloch--Kato Selmer groups of modular forms over anticyclotomic $\mathbf{Z}_p$-towers Systems of Hecke eigenvalues on subschemes of Shimura varieties Fitting Ideals of Projective Limits of Modules over Non-Noetherian Iwasawa Algebras Salem numbers less than the plastic constant
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1