arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~

四变量五次型与七次型的Fröberg猜想

Fröberg's Conjecture for Quintics and Septics in Four Variables

Qihang Wang, Dongming Zhang

arXiv 2608.24797首次发表:更新:

AI 中文总结

本文证明了四变量五次型(r=6至11)与七次型(r=6至21)的Fröberg猜想,通过Macaulay乘法矩阵端点秩计算及Zariski开性,得到特征零域上的对应结果。

AI 中文摘要

设k为特征零的域,S=k[x₁,x₂,x₃,x₄]。我们对d=5(五次型)和d=7(七次型)两种情形,证明了由r个同度d的一般形式生成的理想的Fröberg预测希尔级数,其中r≥1。相较于经典情形r≤5以及Boij-Dannetun-Lundqvist的次数≤d+2的等度定理,需要新输入的生成元计数范围为:五次型对应6≤r≤11,七次型对应6≤r≤21。证明将每个切片简化为Macaulay乘法矩阵的有限个端点秩;对于五次型,基于21个稀疏形式的10次精确端点计算即可;对于七次型,一组嵌套的120个整形式提供了15次端点计算。在这些新范围的每个端点证书中,明确记录的极大子式模2非零,故为非零整数;r=5的情形是经典的强莱夫谢茨实例,对于五次型,我们还记录了匹配的模秩与Koszul界,随后由Zariski开性得到该结果在所有特征零域上成立。本文未涉及无限制的Fröberg猜想。

英文摘要

Let $k$ be a field of characteristic zero and let $S=k[x_1,x_2,x_3,x_4]$. We prove Fröberg's predicted Hilbert series for ideals generated by $r$ general forms of equal degree $d$ for every $r\geq1$ in each of the two cases $d=5$ and $d=7$. Relative to the classical cases $r\leq5$ and the equal-degree theorem through degree $d+2$ of Boij--Dannetun--Lundqvist, the generator-count ranges requiring new input are $6\leq r\leq11$ for quintics and $6\leq r\leq21$ for septics. The proof reduces each slice to finitely many endpoint ranks of Macaulay multiplication matrices. For quintics, ten exact endpoint computations based on twenty-one sparse forms suffice. For septics, a nested family of 120 integral forms supplies fifteen endpoint computations. In every endpoint certificate for these new ranges, an explicitly recorded maximal minor is nonzero modulo $2$, hence is a nonzero integer. The case $r=5$ is the classical strong Lefschetz instance; for quintics we also record a matching modular rank and Koszul bound. Zariski openness then gives the result over every characteristic-zero field. The unrestricted Fröberg conjecture remains outside the scope of the paper. The main results of this paper were obtained through a generative-AI workflow using OpenAI GPT-5.6 Sol, Anthropic Claude Fable 5, and Grok 4.6. Further details appear in the disclosure at the end of the paper.

Comments7 pages; ancillary exact verification programs and certificate; v3 revises the acknowledgements and automated-assistance disclosure. The theorem statements and proofs are unchanged

论文原文

arXiv 摘要页 · PDF 原文 · HTML 原文

↑