On the Complexity of Chow and Hurwitz Forms - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue ACM Communications in Computer Algebra Année : 2024

On the Complexity of Chow and Hurwitz Forms

Résumé

We consider the bit complexity of computing Chow forms of projective varieties defined over integers 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; thus, our result represents the first bit complexity bound. We also extend our algorithm to Hurwitz forms in projective space and we 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.
Fichier principal
Vignette du fichier
2202.11582 (1).pdf (392.49 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04549137 , version 1 (17-04-2024)

Licence

Paternité

Identifiants

Citer

M. Levent Dogan, Alperen Ergür, Elias Tsigaridas. On the Complexity of Chow and Hurwitz Forms. ACM Communications in Computer Algebra, 2024, 57 (4), pp.167-199. ⟨10.1145/3653002.3653003⟩. ⟨hal-04549137⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More