Generalized polar varieties: geometry and algorithms

被引:38
作者
Bank, B [1 ]
Giusti, M
Heintz, J
Pardo, LM
机构
[1] Humboldt Univ, Inst Math, D-10099 Berlin, Germany
[2] Ecole Polytech, Lab STIX, F-91228 Palaiseau, France
[3] Univ Buenos Aires, Fac Ciencias Exactas & Nat, Dept Computac, RA-1428 Buenos Aires, DF, Argentina
[4] Consejo Nacl Invest Cient & Tecn, RA-1033 Buenos Aires, DF, Argentina
[5] Univ Cantabria, Fac Ciencias, Dept Matemat Estadist & Computac, Santander 39071, Spain
关键词
geometry of polar varieties and its generalizations; geometric degree; real polynomial equation solving; elimination procedure; arithmetic circuit; arithmetic network; complexity;
D O I
10.1016/j.jco.2004.10.001
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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 Q-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. (c) 2005 Elsevier Inc. All rights reserved.
引用
收藏
页码:377 / 412
页数:36
相关论文
共 48 条
  • [1] Real solving for positive dimensional systems
    Aubry, P
    Rouillier, F
    El Din, MS
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 2002, 34 (06) : 543 - 560
  • [2] Bank B, 2004, KYBERNETIKA, V40, P519
  • [3] Polar varieties and efficient real elimination
    Bank, B
    Giusti, M
    Heintz, J
    Mbakop, GM
    [J]. MATHEMATISCHE ZEITSCHRIFT, 2001, 238 (01) : 115 - 144
  • [4] Polar varieties, real equation solving, and data structures: The hypersurface case
    Bank, B
    Giusti, M
    Heintz, J
    Mbakop, GM
    [J]. JOURNAL OF COMPLEXITY, 1997, 13 (01) : 5 - 27
  • [5] On the combinatorial and algebraic complexity of quantifier elimination
    Basu, S
    Pollack, R
    Roy, MF
    [J]. JOURNAL OF THE ACM, 1996, 43 (06) : 1002 - 1045
  • [6] BOCHNAK J, 1987, ERGEBNISSE MATH GREN
  • [7] Burgisser Peter, 1997, GRUNDLEHREN MATH WIS, V315
  • [8] Canny J., 1998, P 20 ACM S THEOR COM, P460
  • [9] The hardness of polynomial equation solving
    Castro, D
    Giusti, M
    Heintz, J
    Matera, G
    Pardo, LM
    [J]. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2003, 3 (04) : 347 - 420
  • [10] Kronecker's and Newton's approaches to solving:: A first comparison
    Castro, D
    Pardo, LM
    Hägele, K
    Morais, JE
    [J]. JOURNAL OF COMPLEXITY, 2001, 17 (01) : 212 - 303