English
Related papers

Related papers: Open, convex, unbounded sets in normed spaces

200 papers

The notion of ball convexity, considered in finite dimensional real Banach spaces, is a natural and useful extension of usual convexity; one replaces intersections of half-spaces by suitable intersections of balls. A subset $S$ of a normed…

Metric Geometry · Mathematics 2017-07-18 Thomas Jahn , Christian Richter , Horst Martini

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

Logic · Mathematics 2020-06-30 Riccardo Camerlo , Raphaël Carroy , Alberto Marcone

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

Optimization and Control · Mathematics 2024-08-26 Vera Roshchina , Levent Tunçel

Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…

Data Structures and Algorithms · Computer Science 2009-06-03 Yuanlin Zhang , Forrest Sheng Bao

A closed set of a Euclidean space is said to be Chebyshev if every point in the space has one and only one closest point in the set. Although the situation is not settled in infinite-dimensional Hilbert spaces, in 1932 Bunt showed that in…

Functional Analysis · Mathematics 2007-12-27 Heinz H. Bauschke , Xianfu Wang , Jane Ye , Xiaoming Yuan

We show that every convex code realizable by compact sets in the plane admits a realization consisting of polygons, and analogously every open convex code in the plane can be realized by interiors of polygons. We give factorial-type bounds…

Combinatorics · Mathematics 2022-12-14 Boris Bukh , R. Amzi Jeffs

The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a…

Numerical Analysis · Computer Science 2009-06-01 Laura Maruster , Stefan Maruster

We consider uniformly strongly elliptic systems of the second order with bounded coefficients. First, sufficient conditions for the invariance of convex bodies obtained for linear systems without zero order term in bounded domains and…

Analysis of PDEs · Mathematics 2014-12-09 Gershon Kresin , Vladimir Maz'ya

We show that the space of continuous functions over a compact space X admits an equivalent pointwise-lowersemicontinuous locally uniformly rotund norm whenever X admits a fully closed map onto a compact Y such that C(Y) and the spaces of…

Functional Analysis · Mathematics 2023-12-27 Todor Manev

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

Logic in Computer Science · Computer Science 2021-08-24 Johannes Marti

A metric space is said to be all-set-homogeneous if any of its partial isometries can be extended to a genuine isometry. We give a classification of a certain subclass of all-set-homogeneous length spaces.

Metric Geometry · Mathematics 2025-06-10 Nina Lebedeva , Anton Petrunin

Given a union-closed family $\mathcal{F}$ of subsets of the universe $[n]$, with $\mathcal{F}$ not equal to the power set of $[n]$, a new subset $A$ can be added to it such that the resulting family remains union-closed. We construct a new…

Combinatorics · Mathematics 2021-04-20 Dhruv Bhasin

We study betweenness preserving mappings (we call them \emph{monotone}) defined on subsets of the plane. Once the domain is a convex set, such a mapping is either the restriction of a homography, or its image is contained in the union of a…

Metric Geometry · Mathematics 2022-11-17 Wiesław Kubiś , Janusz Morawiec , Thomas Zürcher

A set of vertices X of a graph G is convex if it contains all vertices on shortest paths between vertices of X. We prove that for fixed p, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial…

Combinatorics · Mathematics 2015-09-17 Luciano Grippo , Martín Matamala , Martín Safe , Maya Stein

A subset of a normed space $X$ is called equilateral if the distance between any two points is the same. Let $m(X)$ be the smallest possible size of an equilateral subset of $X$ maximal with respect to inclusion. We first observe that…

Metric Geometry · Mathematics 2013-09-17 Konrad J. Swanepoel , Rafael Villa

Several results concerning pairs of polynomially convex sets whose union is not even rationally convex are given. It is shown that there is no restriction on how two spaces can be embedded in some $\C^N$ so as to be polynomially convex but…

Complex Variables · Mathematics 2021-08-23 Alexander J. Izzo

We give extensive characterizations for an open subset of an affine space of arbitrary dimension, resp. of an inverse limit of prime spectra to be quasi-compact. Among other things weak stability, retro-compactness, and cylinder sets…

Algebraic Geometry · Mathematics 2026-04-10 A. Bernhard Zeidler

We show that a plane continuum X is indecomposable iff X has a sequence (U_n) of not necessarily distinct complementary domains satisfying what we call the double-pass condition: If one draws an open arc A_n in each U_n whose ends limit…

General Topology · Mathematics 2008-08-12 Clinton P. Curry , John C. Mayer , E. D. Tymchatyn

We study the representability of sets that admit extended formulations using mixed-integer bilevel programs. We show that feasible regions modeled by continuous bilevel constraints (with no integer variables), complementarity constraints,…

Optimization and Control · Mathematics 2018-10-10 Amitabh Basu , Christopher Thomas Ryan , Sriram Sankaranarayanan

We establish the existence of positive solutions to a general class of overdetermined semilinear elliptic boundary problems on suitable bounded open sets $\Omega\subset\mathbb{R}^n$. Specifically, for $n\leq 4$ and under mild technical…

Analysis of PDEs · Mathematics 2025-07-09 Alberto Enciso , Pablo Hidalgo-Palencia , Xavier Ros-Oton