Computing Chow Forms and Some Applications
We prove the existence of an algorithm that, from a finite set of polynomials defining an algebraic projective variety, computes the Chow form of its equidimensional component of the greatest dimension. Applying this algorithm, a finite set of polynomials defining the equidimensional component of th...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_01966774_v41_n1_p52_Jeronimo |
| Aporte de: |
| id |
todo:paper_01966774_v41_n1_p52_Jeronimo |
|---|---|
| record_format |
dspace |
| spelling |
todo:paper_01966774_v41_n1_p52_Jeronimo2023-10-03T15:09:47Z Computing Chow Forms and Some Applications Jeronimo, G. Puddu, S. Sabia, J. Algorithmic algebraic geometry Chow form Complexity theory Equidimensional decomposition Polynomial equations We prove the existence of an algorithm that, from a finite set of polynomials defining an algebraic projective variety, computes the Chow form of its equidimensional component of the greatest dimension. Applying this algorithm, a finite set of polynomials defining the equidimensional component of the greatest dimension of an algebraic (projective or affine) variety can be computed. The complexities of the algorithms involved are lower than the complexities of the known algorithms solving the same tasks. This is due to a special way of coding output polynomials, called straight-line programs. © 2001 Academic Press. Fil:Jeronimo, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Puddu, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Sabia, J. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_01966774_v41_n1_p52_Jeronimo |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Algorithmic algebraic geometry Chow form Complexity theory Equidimensional decomposition Polynomial equations |
| spellingShingle |
Algorithmic algebraic geometry Chow form Complexity theory Equidimensional decomposition Polynomial equations Jeronimo, G. Puddu, S. Sabia, J. Computing Chow Forms and Some Applications |
| topic_facet |
Algorithmic algebraic geometry Chow form Complexity theory Equidimensional decomposition Polynomial equations |
| description |
We prove the existence of an algorithm that, from a finite set of polynomials defining an algebraic projective variety, computes the Chow form of its equidimensional component of the greatest dimension. Applying this algorithm, a finite set of polynomials defining the equidimensional component of the greatest dimension of an algebraic (projective or affine) variety can be computed. The complexities of the algorithms involved are lower than the complexities of the known algorithms solving the same tasks. This is due to a special way of coding output polynomials, called straight-line programs. © 2001 Academic Press. |
| format |
JOUR |
| author |
Jeronimo, G. Puddu, S. Sabia, J. |
| author_facet |
Jeronimo, G. Puddu, S. Sabia, J. |
| author_sort |
Jeronimo, G. |
| title |
Computing Chow Forms and Some Applications |
| title_short |
Computing Chow Forms and Some Applications |
| title_full |
Computing Chow Forms and Some Applications |
| title_fullStr |
Computing Chow Forms and Some Applications |
| title_full_unstemmed |
Computing Chow Forms and Some Applications |
| title_sort |
computing chow forms and some applications |
| url |
http://hdl.handle.net/20.500.12110/paper_01966774_v41_n1_p52_Jeronimo |
| work_keys_str_mv |
AT jeronimog computingchowformsandsomeapplications AT puddus computingchowformsandsomeapplications AT sabiaj computingchowformsandsomeapplications |
| _version_ |
1782030086287917056 |