arXiv:2405.12886 · v3

Improved Asymptotic Runtime of Gotzmann's Decomposition

首次提交 2024-05-21 23:55

版本更新 2026-11-08 06:42

雷达观测 2026-11-10 12:16

摘要

In the study of Hilbert schemes, the integer partition or Gotzmann's decomposition of a Hilbert polynomial helps researchers identify some geometric and combinatorial properties of the scheme in question. To aid researchers in extracting such information from a Hilbert polynomial, we describe an efficient algorithm which can identify if $p(x)\in\mathbb{Q}[x]$ is a Hilbert polynomial and if so, recover the integer partition $λ$ associated with it.