Related papers: A short proof for the open quadrant problem

We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…

Let K be a field of any characteristic and let R be an algebra generated by two elements satisfying quadratic equations. Then R is a homomorphic image of F=K<x,y | x^2+ax+b=0,y^2+cy+d=0> for suitable a,b,c,d in K. We establish that F can be…

For a square-free bivariate polynomial $p$ of degree $n$ we introduce a simple and fast numerical algorithm for the construction of $n\times n$ matrices $A$, $B$, and $C$ such that $\det(A+xB+yC)=p(x,y)$. This is the minimal size needed to…

Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and R\'onyai proved that if the graph of a polynomial contains $cn^2$ points of an…

In the MINIMUM CONVEX COVER (MCC) problem, we are given a simple polygon $\mathcal P$ and an integer $k$, and the question is if there exist $k$ convex polygons whose union is $\mathcal P$. It is known that MCC is $\mathsf{NP}$-hard…

Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite…

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

It is still a challenging task of today to recognize the type of a given algebraic surface which is described only by its implicit representation. In~this paper we will investigate in more detail the case of canal surfaces that are often…

Choose a polynomial in three variables with not more than three or four monomials of moderate degree. Take simple coefficients as 1 and -1. Then draw a picture of the solution variety in real three space using a ray-tracing program like…

Consider an analytic map of a neighborhood of 0 in a vector space to a Euclidean space. Suppose that this map takes all germs of lines passing through 0 to germs of circles. Such a map is called rounding. We introduce a natural equivalence…

In this paper a new approach is derived in the context of shape theory. The implemented methodology is motivated in an open problem proposed in \citet{GM93} about the construction of certain shape density involving Euler hypergeometric…

In this note we show that unbounded convex polygons with nonparallel unbounded edges are polynomial images of ${\mathbb R}^2$, whereas their interiors are polynomial images of ${\mathbb R}^3$

This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…

In this work we compare the semialgebraic subsets that are images of regulous maps with those that are images of regular maps. Recall that a map f : R n $\rightarrow$ R m is regulous if it is a rational map that admits a continuous…

Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…

Let X be a Hausdorff quotient of a standard space (that is of a locally compact separable metric space). It is shown that the following are equivalent: (i) X is the image of an irreducible quotient map from a standard space; (ii) X has a…

Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…

We show that unless P=NP, there cannot be a polynomial-time algorithm that finds a point within Euclidean distance $c^n$ (for any constant $c \ge 0$) of a local minimizer of an $n$-variate quadratic function over a polytope. This result…

We prove that: 1. If a Hausdorff M-space is a continuous closed image of a submetrizable space, then it is metrizable. 2. A dense-in-itself open-closed image of a submetrizable space is submetrizable if and only if it is functionally…

In the present paper we shall obtain a result on the image of polynomials with zero constant term on upper triangular matrix algebras over an algebraically closed field. This is a supplement to a result obtained by Panja and Prasad…