On the complexity of Chow and Hurwitz forms
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910408139341824 |
|---|---|
| author | Doğan, Mahmut Levent Ergür, Alperen Ali Tsigaridas, Elias |
| author_facet | Doğan, Mahmut Levent Ergür, Alperen Ali Tsigaridas, Elias |
| contents | We consider the bit complexity of computing Chow forms and their generalization to multiprojective spaces. We develop a deterministic algorithm using resultants and obtain a single exponential complexity upper bound. Earlier computational results for Chow forms were in the arithmetic complexity model, and our result represents the first bit complexity bound. We also extend our algorithm to Hurwitz forms in projective space, and explore connections between multiprojective Hurwitz forms and matroid theory. The motivation for our work comes from incidence geometry where intriguing computational algebra problems remain open. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2202_11582 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | On the complexity of Chow and Hurwitz forms Doğan, Mahmut Levent Ergür, Alperen Ali Tsigaridas, Elias Computational Complexity Symbolic Computation Algebraic Geometry We consider the bit complexity of computing Chow forms and their generalization to multiprojective spaces. We develop a deterministic algorithm using resultants and obtain a single exponential complexity upper bound. Earlier computational results for Chow forms were in the arithmetic complexity model, and our result represents the first bit complexity bound. We also extend our algorithm to Hurwitz forms in projective space, and explore connections between multiprojective Hurwitz forms and matroid theory. The motivation for our work comes from incidence geometry where intriguing computational algebra problems remain open. |
| title | On the complexity of Chow and Hurwitz forms |
| topic | Computational Complexity Symbolic Computation Algebraic Geometry |
| url | https://arxiv.org/abs/2202.11582 |