相关论文: Generalized convex sets and shadows problem
We received a solution of the shadow problem in n-dimensional Euclidean space for a family of sets, constructing from any convex domain having nonempty interior with the help of parallel translations and homotheties. We find a number of…
This article is concerned with the problem of approximating a not necessarily bounded spectrahedral shadow, a certain convex set, by polyhedra. By identifying the set with its homogenization the problem is reduced to the approximation of a…
We study the geometry and topology of immersed surfaces in Euclidean 3-space whose Gauss map satisfies a certain two-piece-property, and solve the ``shadow problem" formulated by H. Wente.
The main goal of the paper is to solve some problems about shadow for the sphere generalized on the case of the ellipsoid. Here, the essence of the problem is to find the the minimal number of non-overlapping balls with centers on the…
In any CAT(k) space M, the "shadow" of a tangent vector Z at a point p is the set vectors that form an angle of \pi or more with Z. Taking logarithm maps at points approaching p along a fixed geodesic ray from p with tangent Z collapses the…
Spectrahedral shadows are projections of linear sections of the cone of positive semidefinite matrices. We characterize the polynomials that vanish on the boundaries of these convex sets when both the section and the projection are generic.
This article is devoted to the study of classical and new results concerning equidistant sets, both from the topological and metric point of view. We start with a review of the most interesting known facts about these sets in the euclidean…
The \emph{general position problem} in graphs asks for a largest set of vertices in which no three lie on a common shortest path. The \emph{mutual-visibility problem} seeks a largest set of vertices such that every pair is connected by a…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
In the present paper, classical tools of convex analysis are used to study the solution set to a certain class of set-inclusive generalized equations. A condition for the solution existence and global error bounds is established, in the…
In his classical work, W. Blaschke proved that a convex body whose shadow boundaries are flat for every direction of parallel illumination must be an ellipsoid. An extension recently proposed by I. Gonzalez-Garc\'ia, J. Jer\'onimo-Castro,…
At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…
In this note we introduce the problem of illumination of convex bodies in spherical spaces and solve it for a large subfamily of convex bodies. We derive from it a combinatorial version of the classical illumination problem for convex…
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and…
The standard convex closed hull of a set is defined as the intersection of all images, under the action of a group of rigid motions, of a half-space containing the given set. In this paper we propose a generalisation of this classical…
Consider a singularly perturbed system $$\epsilon u_t=\epsilon^2 u_{xx} + f(u,x,\epsilon),\quad u\in {\Bbb R}^n,x\in{\Bbb R},t\geq 0. $$ Assume that the system has a sequence of regular and internal layers occurring alternatively along the…
In this article we develop new methods for exhibiting convex semialgebraic sets that are not spectrahedral shadows. We characterize when the set of nonnegative polynomials with a given support is a spectrahedral shadow in terms of sums of…
A "spectral convex set" is a collection of symmetric matrices whose range of eigenvalues form a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitopes studied by Sanyal-Sottile-Sturmfels (2011). We study this class…
A {\it shadow} is an exact solution to a chaotic system of equations that remains close to a numerically computed solution for a long time, ending in a {\it glitch}. We study the distribution of shadow durations at low dimension and how…
There were obtained some properties of weakly m-convex sets. Various kinds of the problem of shadow were investigated. There was obtained the lower estimation for the number of balls that are necessary to create a shadow at the point of the…