Related papers: Convexity of a Small Ball Under Quadratic Map

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…

The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…

In this paper, we prove uniform lower bounds on the volume growth of balls in the universal covers of Riemannian surfaces and graphs. More precisely, there exists a constant $\delta>0$ such that if $(M,hyp)$ is a closed hyperbolic surface…

For a family of weight functions invariant under a finite reflection group, the boundedness of a maximal function on the unit sphere is established and used to prove a multiplier theorem for the orthogonal expansions with respect to the…

We define new surface area measures for ball-convex bodies which we call $L_p$ relative surface areas. We show that those are rigid motion invariant valuations. We establish inequalities for these quantities and prove a monotonicity…

We consider proper holomorphic maps of ball complements and differences in complex euclidean spaces of dimension at least two. Such maps are always rational, which naturally leads to a related problem of classifying rational maps taking…

In several recent papers some concepts of convex analysis were extended to discrete sets. This paper is one more step in this direction. It is well known that a local minimum of a convex function is always its global minimum. We study some…

This paper is devoted to the study of mappings in metric spaces. We investigate mappings satisfying inverse moduli inequalities. We show that under certain conditions on these mappings, their definition domains and the spaces in which they…

We give a universal upper bound for the total curvature of minimizing geodesic on a convex surface in the Euclidean space.

In this paper, we investigate the growth error bound condition. By using the proximal point algorithm, we first provide a more accessible and elementary proof of the fact that Kurdyka-{\L}ojasiewicz conditions imply growth error bound…

Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$. The $C$-ball…

We investigate the properties of a class of piecewise-fractional maps arising from the introduction of an invariance under rescaling into convex quadratic maps. The subsequent maps are quasiconvex, and pseudoconvex on specific convex cones;…

We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

Convex geometry has recently attracted great attention as a framework to formulate general probabilistic theories. In this framework, convex sets and affine maps represent the state spaces of physical systems and the possible dynamics,…

We construct a Banach space satisfying that the nearest point map (also called proximity mapping or metric projection) onto any compact and convex subset is continuous but not uniformly continuous. The space we construct is locally…

In this paper, we consider linear quadratic team problems with an arbitrary number of quadratic constraints in both stochastic and deterministic settings. The team consists of players with different measurements about the state of nature.…

An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain…

We compute an upper bound for the value of the $L^1$-relaxed area of the graph of the vortex map $u : B_l(0)\subset \mathbb R^2 \to \mathbb R^2$, $u(x):= x/\vert x\vert$, $x \neq 0$, for all values of $l>0$. Together with a previously…

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…