On the Set of Points at Infinity of a Polynomial Image of ℝn
نویسندگان
چکیده
In this work we prove that the set of points at infinity S8 :“ ClRPm pSqXH8 of a semialgebraic set S Ă R that is the image of a polynomial map f : R Ñ R is connected. This result is no longer true in general if f is a regular map. However, it still works for a large family of regular maps that we call quasi-polynomial maps.
منابع مشابه
Strong convergence of variational inequality problem Over the set of common fixed points of a family of demi-contractive mappings
In this paper, by using the viscosity iterative method and the hybrid steepest-descent method, we present a new algorithm for solving the variational inequality problem. The sequence generated by this algorithm is strong convergence to a common element of the set of common zero points of a finite family of inverse strongly monotone operators and the set of common fixed points of a finite family...
متن کاملOn points at infinity of real spectra of polynomial rings
Let R be a real closed field and A = R[x1, . . . , xn]. Let Sper A denote the real spectrum of A. There are two kinds of points in Sper A: finite points (those for which all of |x1|,. . . ,|xn| are bounded above by some constant in R) and points at infinity. In this paper we study the structure of the set of points at infinity of Sper A and their associated valuations. Let T be a subset of {1, ...
متن کاملرفع اعوجاج هندسی متون بهکمک اطلاعات هندسی خطوط متن
Document images produced by scanners or digital cameras usually have photometric and geometric distortions. If either of these effects distorts document, recognition of words from such a document image using OCR is subject to errors. In this paper we propose a novel approach to significantly remove geometric distortion from document images. In this method first we extract document lines from do...
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 52 شماره
صفحات -
تاریخ انتشار 2014