Searcharxiv⌕ Search

arXiv subjects

Maxim V. Balashov

Publications and source records attributed to Maxim V. Balashov.

6 recordsLinked to original sources
arXiv2011

On Pliś metric on the space of strictly convex compacta

We consider a certain metric on the space of all convex compacta in $\R^{n}$, introduced by A. Pliś. The set of strictly convex compacta is a complete metric subspace of the metric space of convex compacta with respect to this metric. We present some applications of this metric to the problems of set-valued analysis, in particular we estimate the distance between two compact sets with respect to this metric and to the Hausdorff metric.

math.GN↗
arXiv2010

Polyhedral approximations of strictly convex compacta

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the Hausdorff metric. We also obtain new estimates of an approximate algorithm for finding the convex hulls.

math.FA↗
arXiv2010

Weakly convex sets and modulus of nonconvexity

We consider a definition of a weakly convex set which is a generalization of the notion of a weakly convex set in the sense of Vial and a proximally smooth set in the sense of Clarke, from the case of the Hilbert space to a class of Banach spaces with the modulus of convexity of the second order. Using the new definition of the weakly convex set with the given modulus of nonconvexity we prove a new retraction theorem and we obtain new results about continuity of the intersection of two continuous set-valued mappings (one of which has nonconvex images) and new affirmative solutions of the splitting problem for selections. We also investigate relationship between the new definition and the definition of a proximally smooth set and a smooth set.

math.FA↗
arXiv2009

Uniform convexity and the splitting problem for selections

We continue to investigate cases when the Repovš-Semenov splitting problem for selections has an affirmative solution for continuous set-valued mappings. We consider the situation in infinite-dimensional uniformly convex Banach spaces. We use the notion of Polyak of uniform convexity and modulus of uniform convexity for arbitrary convex sets (not necessary balls). We study general geometric properties of uniformly convex sets. We also obtain an affirmative solution of the splitting problem for selections of certain set-valued mappings with uniformly convex images.

math.GN↗
arXiv2009

On the splitting problem for selections

We investigate when does the Repovš-Semenov Splitting problem for selections have an affirmative solution for continuous set-valued mappings in finite-dimensional Banach spaces. We prove that this happens when images of set-valued mappings or even their graphs are P-sets (in the sense of Balashov) or strictly convex sets. We also consider an example which shows that there is no affirmative solution of this problem even in the simplest case in $\R^{3}$. We also obtain affirmative solution of the Approximate splitting problem for Lipschitz continuous selections in the Hilbert space.

math.GN↗