Elimination for Generic Sparse Polynomial Systems

Mostrar todas las versiones(3)

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, M.I., Jeronimo, G., Sabia, J.
Formato: INPR
Lenguaje:English
Materias:
Algorithms and complexity
Projection of algebraic varieties
Sparse polynomial systems
Acceso en línea: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 todo:paper_01795376_v_n_p1_Herrero
record_format dspace
spelling todo:paper_01795376_v_n_p1_Herrero2023-10-03T15:08:34Z Elimination for Generic Sparse Polynomial Systems Herrero, M.I. Jeronimo, G. Sabia, J. 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. INPR English info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar 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)
language English
orig_language_str_mv English
topic Algorithms and complexity
Projection of algebraic varieties
Sparse polynomial systems
spellingShingle Algorithms and complexity
Projection of algebraic varieties
Sparse polynomial systems
Herrero, M.I.
Jeronimo, G.
Sabia, J.
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.
format INPR
author Herrero, M.I.
Jeronimo, G.
Sabia, J.
author_facet Herrero, M.I.
Jeronimo, G.
Sabia, J.
author_sort Herrero, M.I.
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
url http://hdl.handle.net/20.500.12110/paper_01795376_v_n_p1_Herrero
work_keys_str_mv AT herreromi eliminationforgenericsparsepolynomialsystems
AT jeronimog eliminationforgenericsparsepolynomialsystems
AT sabiaj eliminationforgenericsparsepolynomialsystems
_version_ 1807323054859091968

Ejemplares similares