相关论文: On a Convex Operator for Finite Sets

Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…

We prove conditions for the existence of a continuous linear right inverse for a surjective convolution operator in spaces of germs of analytic functions on convex subsets of the complex plane. Considered convex sets have a countable…

Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set $T_{rr}$ of planar convex polygons such that $T_{rr}$ with respect to geometric convex…

We show that the polyhedron defined as the convex hull of the lattice points above the hyperbola $\left\{xy = n\right\}$ has between $\Omega(n^{1/3})$ and $O(n^{1/3} \log n)$ vertices. The same bounds apply to any hyperbola with rational…

We define the (convex) joint numerical range for an infinite family of compact operators in a Hilbert space H. We use this set to determine whether a self-adjoint compact operator A with {||A||, -||A||} in its spectrum is minimal respect to…

Let $S$ be a convex hypersurface (the boundary of a closed convex set $V$ with nonempty interior) in $\mathbb{R}^n$. We prove that $S$ contains no lines if and only if for every open set $U\supset S$ there exists a real-analytic convex…

We introduce the notion of strongly orthogonal set relative to an element in the sense of Birkhoff-James in a normed linear space to find a necessary and sufficient condition for an element $ x $ of the unit sphere $ S_{X}$ to be an exposed…

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

The notion of a linear Coxeter system introduced by Vinberg generalizes the geometric representation of a Coxeter group. Our main theorem asserts that if $v$ is an element of the Tits cone of a linear Coxeter system and $\cW$ is the…

An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…

The main result states that every convex set-valued function defined on a real interval with compact values in a locally convex space, admits an affine selection. In the case if the target space is a real line and the values are closed real…

In the present paper we introduce a concept of doubly stochastic quadratic operator. We prove necessary and sufficient conditions for doubly stochasticity of operator. Besides, we prove that the set of all doubly stochastic operators forms…

We consider an infinite-dimensional non-linear operator related to a hard core (HC) model with a countable set $\mathbb{N}$ of spin values. It is known that finding the fixed points of an infinite-dimensional operator is generally…

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

In this paper, we introduce a new operator, $\mathcal{S}$, which is closely related to the restriction problem for spheres in $\mathbb{F}_q^d$, the $d$-dimensional vector space over the finite field $\mathbb{F}_q$ with $q$ elements. The…

As appropriate generalizations of convex combinations with uncountably many terms, we introduce the so-called Choquet combinations, Choquet decompositions and Choquet convex decompositions, as well as their corresponding hull operators…

In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points,…

A set in the Euclidean plane is said to be biconvex if, for some angle $\theta\in[0,\pi/2)$, all its sections along straight lines with inclination angles $\theta$ and $\theta+\pi/2$ are convex sets (i.e, empty sets or segments).…

In this paper, we characterize the closures of convex hulls of unitary orbits of self-adjoint operators in unital, separable, simple C$^*$-algebras with non-trivial tracial simplex, real rank zero, stable rank one, and strict comparison of…

Representation of convex geometry as an appropriate join of compatible total orderings of the base set can be achieved, when closure operator of convex geometry is algebraic, or finitary. This bears to the finite case proved by P.H.~Edelman…