The Recovery of $λ$ from a Hilbert Polynomial
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909217022017536 |
|---|---|
| author | Donato, Joseph Lewis, Monica |
| author_facet | Donato, Joseph Lewis, Monica |
| contents | In the study of Hilbert schemes, the integer partition $λ$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_12886 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Recovery of $λ$ from a Hilbert Polynomial Donato, Joseph Lewis, Monica Symbolic Computation In the study of Hilbert schemes, the integer partition $λ$ 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. |
| title | The Recovery of $λ$ from a Hilbert Polynomial |
| topic | Symbolic Computation |
| url | https://arxiv.org/abs/2405.12886 |