The complexification and degree of a semi-algebraic set

M F Roy, N Vorobjov

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 languageEnglish
Pages (from-to)131-142
Number of pages12
JournalMathematische Zeitschrift
Volume239
Issue number1
DOIs
Publication statusPublished - 2002

Fingerprint

Semi-algebraic Sets
Complexification
Algebraic Set
Polynomial
Subset

Cite this

The complexification and degree of a semi-algebraic set. / Roy, M F; Vorobjov, N.

In: Mathematische Zeitschrift, Vol. 239, No. 1, 2002, p. 131-142.

Research output: Contribution to journalArticle

@article{932bc02de2a040c1b1d763b8c84e03d4,
title = "The complexification and degree of a semi-algebraic set",
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).",
author = "Roy, {M F} and N Vorobjov",
note = "ID number: ISI:000173912600006",
year = "2002",
doi = "10.1007/s002090100287",
language = "English",
volume = "239",
pages = "131--142",
journal = "Mathematische Zeitschrift",
issn = "0025-5874",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - The complexification and degree of a semi-algebraic set

AU - Roy, M F

AU - Vorobjov, N

N1 - ID number: ISI:000173912600006

PY - 2002

Y1 - 2002

N2 - 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).

AB - 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).

U2 - 10.1007/s002090100287

DO - 10.1007/s002090100287

M3 - Article

VL - 239

SP - 131

EP - 142

JO - Mathematische Zeitschrift

JF - Mathematische Zeitschrift

SN - 0025-5874

IS - 1

ER -