Generalized polar varieties: Geometry and algorithms

Autores
Bank, B.; Giusti, M.; Heintz, J.; Pardo, L.M.
Año de publicación
2005
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Let V be a closed algebraic subvariety of the n-dimensional projective space over the complex or real numbers and suppose that V is non-empty and equidimensional. The classic notion of a polar variety of V associated with a given linear subvariety of the ambient space of V was generalized and motivated in Bank et al. (Kybernetika 40 (2004), to appear). As particular instances of this notion of a generalized polar variety one reobtains the classic one and an alternative type of a polar variety, called dual. As main result of the present paper we show that for a generic choice of their parameters the generalized polar varieties of V are empty or equidimensional and smooth in any regular point of V. In the case that the variety V is affine and smooth and has a complete intersection ideal of definition, we are able, for a generic parameter choice, to describe locally the generalized polar varieties of V by explicit equations. Finally, we indicate how this description may be used in order to design in the context of algorithmic elimination theory a highly efficient, probabilistic elimination procedure for the following task: In case, that the variety V is ℚ-definable and affine, having a complete intersection ideal of definition, and that the real trace of V is non-empty and smooth, find for each connected component of the real trace of V an algebraic sample point. © 2005 Elsevier Inc. All rights reserved.
Fuente
J. Complexity 2005;21(4):377-412
Materia
Arithmetic circuit
Arithmetic network
Complexity
Elimination procedure
Geometric degree
Geometry of polar varieties and its generalizations
Real polynomial equation solving
Algorithms
Computational complexity
Digital arithmetic
Matrix algebra
Polynomials
Probability
Theorem proving
Vectors
Arithmetic circuit
Arithmetic network
Elimination procedure
Geometric degree
Real polynomial equation solving
Computational geometry
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/2.5/ar
Repositorio
Biblioteca Digital (UBA-FCEN)
Institución
Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
OAI Identificador
paperaa:paper_0885064X_v21_n4_p377_Bank

id BDUBAFCEN_98b84dc7f7eaff1428afee4e486a7779
oai_identifier_str paperaa:paper_0885064X_v21_n4_p377_Bank
network_acronym_str BDUBAFCEN
repository_id_str 1896
network_name_str Biblioteca Digital (UBA-FCEN)
spelling Generalized polar varieties: Geometry and algorithmsBank, B.Giusti, M.Heintz, J.Pardo, L.M.Arithmetic circuitArithmetic networkComplexityElimination procedureGeometric degreeGeometry of polar varieties and its generalizationsReal polynomial equation solvingAlgorithmsComputational complexityDigital arithmeticMatrix algebraPolynomialsProbabilityTheorem provingVectorsArithmetic circuitArithmetic networkElimination procedureGeometric degreeReal polynomial equation solvingComputational geometryLet V be a closed algebraic subvariety of the n-dimensional projective space over the complex or real numbers and suppose that V is non-empty and equidimensional. The classic notion of a polar variety of V associated with a given linear subvariety of the ambient space of V was generalized and motivated in Bank et al. (Kybernetika 40 (2004), to appear). As particular instances of this notion of a generalized polar variety one reobtains the classic one and an alternative type of a polar variety, called dual. As main result of the present paper we show that for a generic choice of their parameters the generalized polar varieties of V are empty or equidimensional and smooth in any regular point of V. In the case that the variety V is affine and smooth and has a complete intersection ideal of definition, we are able, for a generic parameter choice, to describe locally the generalized polar varieties of V by explicit equations. Finally, we indicate how this description may be used in order to design in the context of algorithmic elimination theory a highly efficient, probabilistic elimination procedure for the following task: In case, that the variety V is ℚ-definable and affine, having a complete intersection ideal of definition, and that the real trace of V is non-empty and smooth, find for each connected component of the real trace of V an algebraic sample point. © 2005 Elsevier Inc. All rights reserved.2005info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfhttp://hdl.handle.net/20.500.12110/paper_0885064X_v21_n4_p377_BankJ. Complexity 2005;21(4):377-412reponame:Biblioteca Digital (UBA-FCEN)instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesinstacron:UBA-FCENenginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/2.5/ar2025-09-29T13:43:09Zpaperaa:paper_0885064X_v21_n4_p377_BankInstitucionalhttps://digital.bl.fcen.uba.ar/Universidad públicaNo correspondehttps://digital.bl.fcen.uba.ar/cgi-bin/oaiserver.cgiana@bl.fcen.uba.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:18962025-09-29 13:43:10.681Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesfalse
dc.title.none.fl_str_mv Generalized polar varieties: Geometry and algorithms
title Generalized polar varieties: Geometry and algorithms
spellingShingle Generalized polar varieties: Geometry and algorithms
Bank, B.
Arithmetic circuit
Arithmetic network
Complexity
Elimination procedure
Geometric degree
Geometry of polar varieties and its generalizations
Real polynomial equation solving
Algorithms
Computational complexity
Digital arithmetic
Matrix algebra
Polynomials
Probability
Theorem proving
Vectors
Arithmetic circuit
Arithmetic network
Elimination procedure
Geometric degree
Real polynomial equation solving
Computational geometry
title_short Generalized polar varieties: Geometry and algorithms
title_full Generalized polar varieties: Geometry and algorithms
title_fullStr Generalized polar varieties: Geometry and algorithms
title_full_unstemmed Generalized polar varieties: Geometry and algorithms
title_sort Generalized polar varieties: Geometry and algorithms
dc.creator.none.fl_str_mv Bank, B.
Giusti, M.
Heintz, J.
Pardo, L.M.
author Bank, B.
author_facet Bank, B.
Giusti, M.
Heintz, J.
Pardo, L.M.
author_role author
author2 Giusti, M.
Heintz, J.
Pardo, L.M.
author2_role author
author
author
dc.subject.none.fl_str_mv Arithmetic circuit
Arithmetic network
Complexity
Elimination procedure
Geometric degree
Geometry of polar varieties and its generalizations
Real polynomial equation solving
Algorithms
Computational complexity
Digital arithmetic
Matrix algebra
Polynomials
Probability
Theorem proving
Vectors
Arithmetic circuit
Arithmetic network
Elimination procedure
Geometric degree
Real polynomial equation solving
Computational geometry
topic Arithmetic circuit
Arithmetic network
Complexity
Elimination procedure
Geometric degree
Geometry of polar varieties and its generalizations
Real polynomial equation solving
Algorithms
Computational complexity
Digital arithmetic
Matrix algebra
Polynomials
Probability
Theorem proving
Vectors
Arithmetic circuit
Arithmetic network
Elimination procedure
Geometric degree
Real polynomial equation solving
Computational geometry
dc.description.none.fl_txt_mv Let V be a closed algebraic subvariety of the n-dimensional projective space over the complex or real numbers and suppose that V is non-empty and equidimensional. The classic notion of a polar variety of V associated with a given linear subvariety of the ambient space of V was generalized and motivated in Bank et al. (Kybernetika 40 (2004), to appear). As particular instances of this notion of a generalized polar variety one reobtains the classic one and an alternative type of a polar variety, called dual. As main result of the present paper we show that for a generic choice of their parameters the generalized polar varieties of V are empty or equidimensional and smooth in any regular point of V. In the case that the variety V is affine and smooth and has a complete intersection ideal of definition, we are able, for a generic parameter choice, to describe locally the generalized polar varieties of V by explicit equations. Finally, we indicate how this description may be used in order to design in the context of algorithmic elimination theory a highly efficient, probabilistic elimination procedure for the following task: In case, that the variety V is ℚ-definable and affine, having a complete intersection ideal of definition, and that the real trace of V is non-empty and smooth, find for each connected component of the real trace of V an algebraic sample point. © 2005 Elsevier Inc. All rights reserved.
description Let V be a closed algebraic subvariety of the n-dimensional projective space over the complex or real numbers and suppose that V is non-empty and equidimensional. The classic notion of a polar variety of V associated with a given linear subvariety of the ambient space of V was generalized and motivated in Bank et al. (Kybernetika 40 (2004), to appear). As particular instances of this notion of a generalized polar variety one reobtains the classic one and an alternative type of a polar variety, called dual. As main result of the present paper we show that for a generic choice of their parameters the generalized polar varieties of V are empty or equidimensional and smooth in any regular point of V. In the case that the variety V is affine and smooth and has a complete intersection ideal of definition, we are able, for a generic parameter choice, to describe locally the generalized polar varieties of V by explicit equations. Finally, we indicate how this description may be used in order to design in the context of algorithmic elimination theory a highly efficient, probabilistic elimination procedure for the following task: In case, that the variety V is ℚ-definable and affine, having a complete intersection ideal of definition, and that the real trace of V is non-empty and smooth, find for each connected component of the real trace of V an algebraic sample point. © 2005 Elsevier Inc. All rights reserved.
publishDate 2005
dc.date.none.fl_str_mv 2005
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.12110/paper_0885064X_v21_n4_p377_Bank
url http://hdl.handle.net/20.500.12110/paper_0885064X_v21_n4_p377_Bank
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/2.5/ar
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/2.5/ar
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv J. Complexity 2005;21(4):377-412
reponame:Biblioteca Digital (UBA-FCEN)
instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron:UBA-FCEN
reponame_str Biblioteca Digital (UBA-FCEN)
collection Biblioteca Digital (UBA-FCEN)
instname_str Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron_str UBA-FCEN
institution UBA-FCEN
repository.name.fl_str_mv Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
repository.mail.fl_str_mv ana@bl.fcen.uba.ar
_version_ 1844618740697661440
score 13.070432