Related papers: Polynomially convex sets whose union has nontrivia…

A convex polyhedron, that is, a compact convex subset of $\mathbb{R}^3$ which is the intersection of finitely many closed half-spaces, can be rectified by taking the convex hull of the midpoints of the edges of the polyhedron. We derive…

We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…

It has been shown that Cantor bubble Julia sets can appear in the dynamics of polynomials and their singular perturbations. In this paper, we present a criterion that guarantees the existence of Cantor bubble Julia sets for certain rational…

The equidistant set of two nonempty subsets $K$ and $L$ in the Euclidean plane is a set all of whose points have the same distance from $K$ and $L$. Since the classical conics can be also given in this way, equidistant sets can be…

In this paper, some particular rational maps P_n ---> P_n+1, called quadratic congruences, are studied. They appear in the theory of exceptional vector bundles on projective spaces.

In this paper it is shown that every compact two-dimensional manifold $S$, with or without boundary, can be embedded in $\mathbb C^3$ as a smooth submanifold $\Sigma$ in such a way that the polynomially convex hull of $\Sigma$, though…

We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…

The projective hull X^ of a subset X in complex projective space P^n is an analogue of the classical polynomial hull of a set in C^n. If X is contained in an affine chart C^n on P^n, then the affine part of X^ is the set of points x in C^n…

We study properties of the realizations of groups as the combinatorial automorphism group of a convex polytope. We show that for any non-abelian group $G$ with a central involution there is a centrally symmetric polytope with $G$ as its…

It is proved that any smooth open Whitney umbrella in $\mathbb C^2$ is locally polynomially convex near the singular point.

Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result…

Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are generalizations of convex hull. Unlike the convex hull, they…

We show that a closed piecewise-linear hypersurface immersed in $R^n$ ($n\ge 3$) is the boundary of a convex body if and only if every point in the interior of each $(n-3)$-face has a neighborhood that lies on the boundary of some convex…

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

We show that every small resolution of a three-dimensional terminal hypersurface singularity can occur on a non-embeddable 1-convex manifold. We give an explicit example of a non-embeddable manifold containing an irreducible exceptional…

We give examples of nonsingular curves in projective 3 space such that the regularity of powers of their ideal sheaves are highly nonlinear. This is in constrast to the case of an ideal I in a polynomial ring, where the regularity of I^n is…

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

In this work we approach the problem of determining which (compact) semialgebraic subsets of ${\mathbb R}^n$ are images under polynomial maps $f:{\mathbb R}^m\to{\mathbb R}^n$ of the closed unit ball $\overline{{\mathcal B}}_m$ centered at…

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…

We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…