Related papers: An interval version of separation by semispaces in…
We provide two certificates of convexity for arbitrary basic semi-algebraic sets of $\R^n$. The first one is based on a necessary and sufficient condition whereas the second one is based on a sufficient (but simpler) condition only. Both…
In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…
In this paper, we provide Algebraic-Coding necessary and sufficient conditions for the Maximum Distance Separable Conjecture to hold.
A sufficient condition for $\bar{\partial}$ to have closed range is given for pseudoconvex, possibly unbounded domains in $\mathbb{C}^n$.
We establish sufficient conditions for finite convergence of the alternating projections method for two non-intersecting and potentially nonconvex sets. Our results are based on a generalization of the concept of intrinsic transversality,…
We discuss some key results from convex analysis in the setting of topological groups and monoids. These include separation theorems, Krein-Milman type theorems, and minimax theorems.
Given a finite $n$-element set $X$, a family of subsets ${\mathcal F}\subset 2^X$ is said to separate $X$ if any two elements of $X$ are separated by at least one member of $\mathcal F$. It is shown that if $|\mathcal F|>2^{n-1}$, then one…
A subset X of a vector space V is said to have the "Separation Property" if it separates linear forms in the following sense: given a pair (a, b) of linearly independent forms on V there is a point x on X such that a(x)=0 and b(x) is not…
We study the conditions under which a semigroup is obtained upon convex combinations of channels. In particular, we study the set of Pauli and generalized Pauli channels. We find that mixing only semigroups can never produce a semigroup.…
We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…
A metric space is indivisible if for any partition of it into finitely many pieces one piece contains an isometric copy of the whole space. Continuing our investigation of indivisible metric spaces, we show that a countable ultrametric…
We discuss the notions of circumradius, inradius, diameter, and minimum width in generalized Minkowski spaces (that is, with respect to gauges), i.e., we measure the "size" of a given convex set in a finite-dimensional real vector space…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
We review some recent advances in the field of element-based algebraic stabilization for continuous finite element discretizations of nonlinear hyperbolic problems. The main focus is on multidimensional convex limiting techniques designed…
In this paper, we investigate the mixed-integer nonlinear set with box constraints $X = \{(w,x)\in R\times Z^n:w\leq f(a^Tx),0\leq x\leq \mu\}$, where $f$ is a univariate concave function, $a\in R^n$, and $\mu\in Z^n_{++}$. This set arises…
We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several previous results on sublinear separators in intersection…
Let $X$ be a proper CAT($0$) space and $G$ a cocompact group of isometries of $X$ without fixed point at infinity. We prove that if $\partial X$ contains an invariant subset of circumradius $\pi/2$, then $X$ contains a quasi-dense, closed…
Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…
We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden…
In this note, we give a new necessary condition for the existence of non-trivial partitions of a finite vector space. Precisely, we prove that, if V is a finite vector space over a field of order q, then the number of the subspaces of…