Related papers: Polynomially Convex Arcs in Polynomially Convex Si…
We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…
In this paper we address the following questions: (i) Let $C\subset \mathbb C^2$ be an orbit of a polynomial vector field which has finite total Gaussian curvature. Is $C$ contained in an algebraic curve? (ii) What can be said of a…
It is proved that any smooth open Whitney umbrella in $\mathbb C^2$ is locally polynomially convex near the singular point.
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
The paper is concerned with the boundary behaviour of polynomially and rationally convex hulls in pseudoconvex domains in $\mathbb{C}^n$. As an application, it is shown that every connected polynomially or rationally convex compact set with…
We show that optimal polynomial meshes exist for every convex body in $\mathbb{R}^d$, confirming a conjecture by A. Kroo.
For any pseudoconvex Runge domain $\Omega\subset\mathbb{C}^2$ we prove that every closed discrete subset in $\Omega$ is contained in a properly embedded complex curve in $\Omega$ with any prescribed topology (possibly infinite).
In this paper we consider convex subsets of locally-convex topological vector spaces. Given a fixed point in such a convex subset, we show that there exists a curve completely contained in the convex subset and leaving the point in a given…
Three results in p-convex geometry are established. First is the analogue of the Levi problem in several complex variables, namely: local p-convexity implies global p-convexity. The second asserts that the support of a minimal p-dimensional…
We study the convex hulls of trajectories of polynomial dynamical systems. Such trajectories include real algebraic curves. The boundaries of the resulting convex bodies are stratified into families of faces. We present numerical algorithms…
This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like…
A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…
Taking the convex hull of a curve is a natural construction in computational geometry. On the other hand, path signatures, central in stochastic analysis, capture geometric properties of curves, although their exact interpretation for…
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…
A convex-polynomial is a convex combination of the monomials $\{1, x, x^2, \ldots\}$. This paper establishes that the convex-polynomials on $\mathbb R$ are dense in $L^p(\mu)$ and weak$^*$ dense in $L^\infty(\mu)$, precisely when…
Let X be a complex manifold and c a simple closed curve in X. We address the question: What conditions on c ensure the existence of a 1-dimensional complex subvariety V with boundary c in X. When X = C^n, an answer to this question involves…
We describe all special curves in the parameter space of complex cubic polynomials, that is all algebraic irreducible curves containing infinitely many post-critically finite polynomials. This solves in a strong form a conjecture by Baker…
We propose a general framework for geometric approximation of circular arcs by parametric polynomial curves. The approach is based on constrained uniform approximation of an error function by scalar polynomials. The system of nonlinear…
Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…
We prove that every rational trinomial affine hypersurface admits a horizontal polynomial curve. This result provides an explicit non-trivial polynomial solution to a trinomial equation. Also we show that a trinomial affine hypersurface…