✦ LIBER ✦

Bounding the number of connected components of a real algebraic set

✍ Scribed by Riccardo Benedetti; Francois Loeser; Jean Jacques Risler

Book ID: 110561390
Publisher: Springer
Year: 1991
Tongue: English
Weight: 854 KB
Volume: 6
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02574685

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some Bounds for the Number of Components

Some Bounds for the Number of Components of Real Zero Sets of Sparse Polynomials

✍ Daniel Perrucci 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 280 KB

Number of components of the set of real

Number of components of the set of real morsifications ofDµsingularities

✍ M. R. Éntov 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 253 KB

An asymptotically tight bound on the num

An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions

✍ Saugata Basu; Richard Pollack; Marie-Françoise Roy 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 536 KB

On approximation of real numbers by alge

On approximation of real numbers by algebraic numbers of bounded degree

✍ Kiryl I. Tsishchanka 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Dirichlet proved that for any real irrational number ξ there exist infinitely many rational numbers p/q such that |ξp/q| < q -2 . The correct generalization to the case of approximation by algebraic numbers of degree n, n > 2, is still unknown. Here we prove a result which improves all previous esti

Different Bounds on the Different Betti

Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets

✍ Basu 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 211 KB

Bounding the number of embeddings of 5-c

Bounding the number of embeddings of 5-connected projective-planar graphs

✍ Shigeru Kitakubo 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

A graph is said to be projective-planar if it is nonplanar and is embeddable in a projective plane. In this paper we show that the numbers of projectiveplanar embeddings (up to equivalence) of all 5-connected graphs have an upper bound c( 1120).