✦ LIBER ✦

Topological complexity and real roots of polynomials

✍ Scribed by V. A. Vassiliev

Publisher: SP MAIK Nauka/Interperiodica
Year: 1996
Tongue: English
Weight: 544 KB
Volume: 60
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf02309164

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Virtual roots of real polynomials

✍ Laureano Gonzalez-Vega; Henri Lombardi; Louis Mahé 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 888 KB

The fact that a real univariate polynomial misses some real roots is usually overcome by considering complex roots, but the price to pay for, is a complete loss of the sign structure that a set of real roots is endowed with (mutual position on the line, signs of the derivatives, etc.). In this paper

On the Complexity of Isolating Real Root

On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree

✍ B. Mourrain; M.N. Vrahatis; J.C. Yakoubsohn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Calculation of the real roots of polynom

Calculation of the real roots of polynomials

✍ G.S. Ganshin 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 220 KB

On the real roots of Euler polynomials

✍ Hubert Delange 📂 Article 📅 1988 🏛 Springer Vienna 🌐 English ⚖ 864 KB

Topological entropy of Chebyshev polynom

Topological entropy of Chebyshev polynomials and related real mappings

✍ Michael D Weiss 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 295 KB

Topological complexity and motion planni

Topological complexity and motion planning in certain real grassmannians

✍ K.J Pearson; Tan Zhang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Let TC(X) be the topological complexity of a path-connected topological space X. We first give a lower bound on TC(Gk(]~m)), the Grassmannian of real /z-planes in Jt~ m. We then compute TC(Gk (~m)) for (k, m) = (2, 4) and relate it to the motion planning problem of topological robotics. (~) 2004 El