English
Related papers

Related papers: Max-plus convexity in Riesz spaces

200 papers

We establish the following max-plus analogue of Minkowski's theorem. Any point of a compact max-plus convex subset of $(R\cup\{-\infty\})^n$ can be written as the max-plus convex combination of at most $n+1$ of the extreme points of this…

Metric Geometry · Mathematics 2007-05-23 Stephane Gaubert , Ricardo Katz

Given a set S endowed with a convexity structure, a hemispace is a convex subset of S which has convex complement. We recall that R^n_{max} is a semimodule over the max-plus semifield. A convexity structure of current interest is provided…

Metric Geometry · Mathematics 2014-02-13 Daniel Ehrmann , Zach Higgins , Viorel Nitica

The notion of max-plus convex subset of Euclidean space can be naturally extended to other linear spaces. The aim of this paper is to describe the topology of hyperspaces of max-plus convex subsets of Tychonov powers $\mathbb R^\tau$ of the…

General Topology · Mathematics 2012-06-12 Lidia Bazylevych , Dušan Repovš , Mykhailo Zarichnyi

Inspired in the theorem of Krein-Milamn, we investigate the existence of extreme points in compact convex subsets of asymmetric normed spaces. We focus our attention in the finite dimensional case, giving a geometric description of all…

Functional Analysis · Mathematics 2014-04-03 Natalia Jonard-Pérez , Enrique A. Sánchez-Pérez

Let $A$ and $X$ be nonempty, bounded and closed subsets of a geodesic metric space $(E,d)$. The minimization (resp. maximization) problem denoted by $\min(A,X)$ (resp. $\max(A,X)$) consists in finding $(a_0,x_0) \in A \times X$ such that…

Metric Geometry · Mathematics 2010-03-23 Rafa Espinola , Adriana Nicolae

We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…

Functional Analysis · Mathematics 2007-05-23 Guy Cohen , Stephane Gaubert , Jean-Pierre Quadrat , Ivan Singer

In this paper, two main results concerning uniformly continuous retractions are proved. First, an $\alpha$-H\"older retraction from any separable Banach space onto a compact convex subset whose closed linear span is the whole space is…

Functional Analysis · Mathematics 2022-05-26 Rubén Medina

We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result…

Optimization and Control · Mathematics 2017-01-24 Amitabh Basu , Michele Conforti , Gerard Cornuejols , Giacomo Zambelli

This paper extends the theory of rough convergence from normed linear spaces to the more abstract setting of Riesz spaces. We introduce and systematically develop the concept of rough $\mathbb{c}$-convergence ($rc$-convergence) for nets. A…

Functional Analysis · Mathematics 2025-08-18 Abdullah Aydın , Mehmet Küçükaslan , Mokhwetha Mabula

Our main result states that the hyperspace of convex compact subsets of a compact convex subset $X$ in a locally convex space is an absolute retract if and only if $X$ is an absolute retract of weight $\le\omega_1$. It is also proved that…

General Topology · Mathematics 2009-11-05 Lidia Bazylevych , Dušan Repovš , Michael Zarichnyi

Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…

Combinatorics · Mathematics 2025-08-28 Chaya Keller , Micha A. Perles

The full lattice convergence on a locally solid Riesz space is an abstraction of the topological, order, and relatively uniform convergences. We investigate four modifications of a full convergence $\mathbb{c}$ on a Riesz space. The first…

Functional Analysis · Mathematics 2020-11-30 Abdullah Aydın , Eduard Emelyanov , Svetlana Gorokhova

We use bicombings on arcwise connected metric spaces to give definitions of convex sets and extremal points. These notions coincide with the customary ones in the classes of normed vector spaces and geodesic metric spaces which are convex…

Metric Geometry · Mathematics 2007-11-06 Theo Buehler

In this article we study convexity properties of distance functions in infinite dimensional Finsler unitary groups, such as the full unitary group, the unitary Schatten perturbations of the identity and unitary groups of finite von Neumann…

Operator Algebras · Mathematics 2022-09-23 Martin Miglioli

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

In this paper the theory of uniformly convex metric spaces is developed. These spaces exhibit a generalized convexity of the metric from a fixed point. Using a (nearly) uniform convexity property a simple proof of reflexivity is presented…

Metric Geometry · Mathematics 2016-04-08 Martin Kell

The usual notion of set-convexity, valid in the classical Euclidean context, metamorphoses into several distinct convexity types in the more general Riemannian setting. By studying this phenomenon in reverse, we characterize complete…

Differential Geometry · Mathematics 2016-11-29 Octavian Mitrea

In this paper, we first establish the separation theorem between a point and a locally geodesic convex set and then prove the existence of a supporting quasi-hyperplane at any point on the boundary of the closed locally geodesic convex set…

Optimization and Control · Mathematics 2024-01-25 Li-wen Zhou , Ling-ling Liu , Chao Min , Yao-jia Zhang , Nan-Jing Huang

A geodesic bicombing on a metric space selects for every pair of points a geodesic connecting them. We prove existence and uniqueness results for geodesic bicombings satisfying different convexity conditions. In combination with recent work…

Metric Geometry · Mathematics 2014-04-22 Dominic Descombes , Urs Lang

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
‹ Prev 1 2 3 10 Next ›