### Abstract

The complexification of a semi-algebraic set S subset of R-n is the smallest complex algebraic set containing S. Let S be defined by 8 polynomials of degrees less than d. We prove that the geometric degree of the complexification is less than s(n)O(d)(2n).

Original language | English |
---|---|

Pages (from-to) | 131-142 |

Number of pages | 12 |

Journal | Mathematische Zeitschrift |

Volume | 239 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2002 |

## Fingerprint Dive into the research topics of 'The complexification and degree of a semi-algebraic set'. Together they form a unique fingerprint.

## Cite this

Roy, M. F., & Vorobjov, N. (2002). The complexification and degree of a semi-algebraic set.

*Mathematische Zeitschrift*,*239*(1), 131-142. https://doi.org/10.1007/s002090100287