Related papers: Chebyshev sets and ball operators
In this paper, we study generalized versions of the k-center problem, which involves finding k circles of the smallest possible equal radius that cover a finite set of points in the plane. By utilizing the Minkowski gauge function, we…
The main ambition of this thesis is to contribute to the development of cooperative game theory towards combinatorics, algorithmics and discrete geometry. Therefore, the first chapter of this manuscript is devoted to highlighting the…
We establish new metric characterizations for the norm (respectively, ultraweak) closure of the convex hull of a bounded set in an arbitrary $C^*$-algebra (respectively, von Neumann algebra), and provide applications of these results to the…
We completely characterize the Crawford number attainment set and the numerical radius attainment set of a bounded linear operator on a Hilbert space. We study the intersection properties of the corresponding attainment sets of numerical…
We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…
After fixing a triangulation $L$ of a $k$-dimensional simplex that has no new vertices on the boundary, we introduce a triangulation operation on all simplicial complexes that replaces every $k$-face with a copy of $L$, via a sequence of…
Let V be a finite set of points in Euclidean d-space (d >= 2). The intersection of all unit balls B(v,1) centered at v, where v ranges over V, henceforth denoted by B(V) is the ball polytope associated with V. Note that B(V) is non-empty…
The paper characterizes the convex hull of the closure of the cone-volume set $C_\cv(U)$, consisting of all cone-volume vectors of polygons with outer unit normals vectors contained in $U$, for any finite set $U \subseteq \R^2, \pos(U) =…
By a polygonization of a finite point set $S$ in the plane we understand a simple polygon having $S$ as the set of its vertices. Let $B$ and $R$ be sets of blue and red points, respectively, in the plane such that $B\cup R$ is in general…
In this paper we study the following problems: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that encloses all of the sets, and find a ball with the smallest radius that intersects…
We establish Central Limit Theorems for the volumes of intersections of $B_{p}^n$ (the unit ball of $\ell_p^n$) with uniform random subspaces of codimension $d$ for fixed $d$ and $n\to \infty$. As a corollary we obtain higher order…
Extending a method developed by Koszmider and Laustsen for constructing $C(K)$-spaces we produce families of $C(K)$-spaces with few operators relative to a partially ordered set $\mathcal{P}$. Using these spaces, we construct new…
We refine the well-known Blanco-Koldobsky-Turn\v{s}ek Theorem which states that a norm one linear operator defined on a Banach space is an isometry if and only if it preserves orthogonality at every element of the space. We improve the…
The illumination number $I(K)$ of a convex body $K$ in Euclidean space $\mathbb{E}^d$ is the smallest number of directions that completely illuminate the boundary of a convex body. A cap body $K_c$ of a ball is the convex hull of a…
In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering…
Let $H$ be a real Hilbert space. In this short note, using some of the properties of bounded linear operators with closed range defined on $H$, certain bounds for a specific convex subset of the solution set of infinite linear…
We show that the order complex of intervals of a poset, ordered by inclusion, is a Tchebyshev triangulation of the order complex of the original poset. Besides studying the properties of this transformation, we show that the dual of the…
We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets…
We show that a typical Besicovitch set $B$ has intersections of measure zero with every line not contained in it. Moreover, every line in $B$ intersects the union of all the other lines in $B$ in a set of measure zero.
The concept of $H$-sets as introduced by Collatz in 1956 was very useful in univariate Chebyshev approximation by polynomials or Chebyshev spaces. In the multivariate setting, the situation is much worse, because there is no alternation,…