The complexification and degree of a semi-algebraic set

M F Roy; N Vorobjov

doi:10.1007/s002090100287

The complexification and degree of a semi-algebraic set

M F Roy, N Vorobjov

Research output: Contribution to journal › Article › peer-review

12 Citations (SciVal)

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	https://doi.org/10.1007/s002090100287
Publication status	Published - 2002

Bibliographical note

ID number: ISI:000173912600006

Access to Document

10.1007/s002090100287

Cite this

@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

SN - 0025-5874

VL - 239

SP - 131

EP - 142

JO - Mathematische Zeitschrift

JF - Mathematische Zeitschrift

IS - 1

ER -

The complexification and degree of a semi-algebraic set

Abstract

Bibliographical note

Access to Document

Fingerprint

Cite this