相关论文: Generalized convex sets and shadows problem

We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…

The Helton-Nie Conjecture (HNC) is the proposition that every convex semialgebraic set is a spectrahedral shadow. Here we prove that HNC is equivalent to another propo- sition related to quadratically constrained quadratic programming.…

A brief illustrative discussion of the shadows of black holes at local and cosmological distances is presented. Starting from definition of the term and discussion of recent observations, we then investigate shadows at large, cosmological…

We prove new general results on sumsets of sets having Szemer\'edi--Trotter type. This family includes convex sets, sets with small multiplicative doubling, images of sets under convex/concave maps and others.

We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden…

The shadow of a black hole can be one of the strong observational evidences for stationary black holes. If we see shadows at the center of galaxies, we would say whether the observed compact objects are black holes. In this paper, we…

The notion of composite system made up of distinguishable parties is investigated in the context of arbitrary convex spaces.

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

A notion of general manifolds is introduced. It covers all usual manifolds in mathematics. Essentially, it is a way how to get a bigger 'fibration' over a site which locally coincides with a given one. An enrichment with generalized…

A condensed set is a sheaf on the site of Stone spaces and continuous maps. We prove that condensed sets are equivalent to sheaves on the site of compact Hausdorff spaces and continuous maps. As an application, we show that there exists a…

The problem of bending and scattering of light rays passing outside from the entrance to a wormhole with zero gravitational mass is considered. The process of ray capture by a wormhole as well as the process of formation of a shadow when…

For any continuous self-map of a compact metric space, we consider the space of chain components and prove that the s-limit shadowing implies the denseness of chain components with the shadowing property. It gives a partial answer to a…

The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…

We consider the problem of the semidefinite representation of a class of non-compact basic semialgebraic sets. We introduce the conditions of pointedness and closedness at infinity of a semialgebraic set and show that under these conditions…

In this paper we study the the Gauss image problem, which is a generalization of the Aleksandrov problem in convex geometry. By considering a geometric flow involving Gauss curvature and functions of normal vectors and radial vectors, we…

The invariant subspace problem is solved correcting my earlier attempts [6]-[12].

In this paper, we employ a ray-tracing algorithm to simulate the shadows of three equal-mass black holes in static equilibrium across a wide parameter space. We find that the shadows consist of a larger primary shadow and several distorted,…

We consider the following problem: Given a point set in space find a largest subset that is in convex position and whose convex hull is empty. We show that the (decision version of the) problem is W[1]-hard.

Moser's shadow problem asks to estimate the shadow function $\mathfrak{s}_b(n)$, which is the largest number such that for each bounded convex polyhedron $P$ with $n$ vertices in $3$-space there is some direction ${\bf v}$ (depending on…

A novel approach to an old symmetry problem is developed. A new proof is given for the following symmetry problem, studied earlier.