Degree of rational mappings, and the theorems of Sturm and Tarski
The paper is an extended version of lecture notes (taken by the second author) of a course given by the first author at the University of Toronto. It gives an algorithm for computing the mapping degree of a rational mapping \(\mathbb{R}\mathbb{P}^1\to\mathbb{R}\mathbb{P}^1,\) which serves as a basic tool for proving Sturm's theorem. The latter in turn is used to prove Tarski's theorem on semialgebraicity of the image of a real semialgebraic set under a polynomial mapping, and the theorem on constructibility of the image of a complex constructible set under a polynomial mapping. References to other modern algorithmic treatments of the latter classical results are missing in the paper -- we can recommend e.g. [\textit{S.~Basu, R.~Pollack} and \textit{M.-F.~Roy}, Algorithms in real algebraic geometry. 2nd ed. Berlin: Springer (2006; Zbl 1102.14041)].
- scientific article; zbMATH DE number 1023365
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- The Fundamental Theorem of Algebra Made Effective: An Elementary Real-algebraic Proof via Sturm Chains
- Deux moments dans l'histoire du Théorème d'algèbre de Ch. F. Sturm
- A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)
- Quantifier elimination theory and maps which preserve semipositivity
- A rational map with infinitely many points of distinct arithmetic degrees
- On maps which preserve semipositivity and quantifier elimination theory for real numbers
- Minimal degree rational open up mappings and related questions
- On one-parameter families of hermiticity-preserving superoperators which are not positive
- The Schwartz space of a smooth semi-algebraic stack
This page was built for publication: Degree of rational mappings, and the theorems of Sturm and Tarski
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q942964)
