Elimination for Generic Sparse Polynomial Systems

Mostrar todas las versiones(2)

We present a new probabilistic symbolic algorithm that, given a variety defined in an n-dimensional affine space by a generic sparse system with fixed supports, computes the Zariski closure of its projection to an ℓ-dimensional coordinate affine space with ℓ<n. The complexity of the algorithm dep...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Herrero, María Isabel, Jeronimo, Gabriela Tali, Sabia, Juan Vicente Rafael
Publicado: 2014
Materias:
Algorithms and complexity
Projection of algebraic varieties
Sparse polynomial systems
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01795376_v_n_p1_Herrero
http://hdl.handle.net/20.500.12110/paper_01795376_v_n_p1_Herrero
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paper:paper_01795376_v_n_p1_Herrero
record_format dspace
spelling paper:paper_01795376_v_n_p1_Herrero2025-07-30T17:58:00Z Elimination for Generic Sparse Polynomial Systems Herrero, María Isabel Jeronimo, Gabriela Tali Sabia, Juan Vicente Rafael Algorithms and complexity Projection of algebraic varieties Sparse polynomial systems We present a new probabilistic symbolic algorithm that, given a variety defined in an n-dimensional affine space by a generic sparse system with fixed supports, computes the Zariski closure of its projection to an ℓ-dimensional coordinate affine space with ℓ<n. The complexity of the algorithm depends polynomially on some combinatorial invariants associated to the supports. © 2014 Springer Science+Business Media New York. Fil:Herrero, M.I. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Jeronimo, G. 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. 2014 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01795376_v_n_p1_Herrero http://hdl.handle.net/20.500.12110/paper_01795376_v_n_p1_Herrero
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Algorithms and complexity
Projection of algebraic varieties
Sparse polynomial systems
spellingShingle Algorithms and complexity
Projection of algebraic varieties
Sparse polynomial systems
Herrero, María Isabel
Jeronimo, Gabriela Tali
Sabia, Juan Vicente Rafael
Elimination for Generic Sparse Polynomial Systems
topic_facet Algorithms and complexity
Projection of algebraic varieties
Sparse polynomial systems
description We present a new probabilistic symbolic algorithm that, given a variety defined in an n-dimensional affine space by a generic sparse system with fixed supports, computes the Zariski closure of its projection to an ℓ-dimensional coordinate affine space with ℓ<n. The complexity of the algorithm depends polynomially on some combinatorial invariants associated to the supports. © 2014 Springer Science+Business Media New York.
author Herrero, María Isabel
Jeronimo, Gabriela Tali
Sabia, Juan Vicente Rafael
author_facet Herrero, María Isabel
Jeronimo, Gabriela Tali
Sabia, Juan Vicente Rafael
author_sort Herrero, María Isabel
title Elimination for Generic Sparse Polynomial Systems
title_short Elimination for Generic Sparse Polynomial Systems
title_full Elimination for Generic Sparse Polynomial Systems
title_fullStr Elimination for Generic Sparse Polynomial Systems
title_full_unstemmed Elimination for Generic Sparse Polynomial Systems
title_sort elimination for generic sparse polynomial systems
publishDate 2014
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01795376_v_n_p1_Herrero
http://hdl.handle.net/20.500.12110/paper_01795376_v_n_p1_Herrero
work_keys_str_mv AT herreromariaisabel eliminationforgenericsparsepolynomialsystems
AT jeronimogabrielatali eliminationforgenericsparsepolynomialsystems
AT sabiajuanvicenterafael eliminationforgenericsparsepolynomialsystems
_version_ 1840323208671133696

Ejemplares similares