English
Related papers

Related papers: An interval version of separation by semispaces in…

200 papers

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…

Computational Geometry · Computer Science 2016-08-31 Jean-Daniel Boissonnat , Jurek Czyzowicz , Olivier Devillers , Mariette Yvinec

We establish new results concerning projectors on max-plus spaces, as well as separating half-spaces, and derive an explicit formula for the distance in Hilbert's projective metric between a point and a half-space over the max-plus…

Metric Geometry · Mathematics 2011-11-08 Marianne Akian , Stephane Gaubert , Viorel Nitica , Ivan Singer

A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…

Combinatorics · Mathematics 2020-07-28 Hiroshi Nozaki , Masashi Shinohara

In this paper we introduce a new technique to prove the existence of closed subspaces of maximal dimension inside sets of topological vector sequence spaces. The results we prove cover some sequence spaces not studied before in the context…

Functional Analysis · Mathematics 2015-10-06 Geraldo Botelho , Daniel Cariello , Vinícius Fávaro , Daniel Pellegrino

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

Computational Geometry · Computer Science 2014-09-16 Danny Rorabaugh

In this paper, two parallel notions of convexity of sets are introduced in the abelian semigroup setting. The connection of these notions to algebraic and to set-theoretic operations is investigated. A formula for the computation of the…

Classical Analysis and ODEs · Mathematics 2015-12-24 Witold Jarczyk , Zsolt Páles

In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…

alg-geom · Mathematics 2008-02-03 F. Acquistapace , C. Andradas , F. Broglia

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…

Optimization and Control · Mathematics 2024-01-25 Daniel Dörfler , Andreas Löhne

We study poset limits given by sequences of finite interval orders or, as a special case, finite semiorders. In the interval order case, we show that every such limit can be represented by a probability measure on the space of closed…

Combinatorics · Mathematics 2011-04-08 Svante Janson

We analyse several examples of separable Banach spaces, some of them new, and relate them to several dichotomies obtained in the previous paper Banach spaces without minimal subspaces, by classifying them according to which side of the…

Functional Analysis · Mathematics 2011-04-26 Valentin Ferenczi , Christian Rosendal

We present a necessary and sufficient condition for the reachable set, i.e., the set of states reachable from a ball of initial states at some time, of an ordinary differential equation to be convex. In particular, convexity is guaranteed…

Optimization and Control · Mathematics 2013-03-01 Gunther Reißig

We study finite systems of subspaces of a complex Hilbert space such that each pair of subspaces satisfies a certain condition as described in the following. For each subspace excepting the first one an angle between this subspace and the…

Functional Analysis · Mathematics 2012-01-18 Ivan Feshchenko , Alexander Strelets

In this work, we focus on separable convex optimization problems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of…

Information Theory · Computer Science 2014-03-25 Antonio A. D'Amico , Luca Sanguinetti , Daniel P. Palomar

We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…

Data Structures and Algorithms · Computer Science 2011-03-14 Vincent Blondel , Stéphane Gaubert , Natacha Portier

A contractive condition is addressed for extended 2-cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same subsets of its domain. It is…

Functional Analysis · Mathematics 2012-08-18 M. De La Sen

We prove that for any collection F of $n \ge 2$ pairwise disjoint compact convex sets in the plane there is a pair of sets A and B in F such that any line that separates A from B separates either A or B from a subcollection of F with at…

Combinatorics · Mathematics 2023-01-04 Eduardo Rivera-Campo , Jorge Urrutia

Within the framework of finite element systems, we show how spaces of differential forms may be constructed, in such a way that they are equipped with commuting interpolators and contain prescribed functions, and are minimal under these…

Numerical Analysis · Mathematics 2015-10-22 Snorre H. Christiansen , Andrew Gillette

The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…

Metric Geometry · Mathematics 2020-02-11 T. M. Osipchuk

In this paper, we establish two minimax theorems for functions $f:X\times I\to {\bf R}$, where $I$ is a real interval, without assuming that $f(x,\cdot)$ is quasi-concave. Also, some related applications are presented.

Optimization and Control · Mathematics 2019-02-21 Biagio Ricceri

We give conditions for a maximal divisorial ideal to be t-maximal and show with examples that, even in a completely integrally closed domain, maximal divisorial ideals need not be t-maximal.

Commutative Algebra · Mathematics 2007-05-23 Stefania Gabelli , Moshe Roitman