English
Related papers

Related papers: On weakly $1$-convex and weakly $1$-semiconvex set…

200 papers

Given S_1, a finite set of points in the plane, we define a sequence of point sets S_i as follows: With S_i already determined, let L_i be the set of all the line segments connecting pairs of points of the union of S_1,...,S_i, and let…

Metric Geometry · Mathematics 2007-07-02 Ansgar Gruene , Sanaz Kamali Sarvestani

A closure system with the anti-exchange axiom is called a convex geometry. One geometry is called a sub-geometry of the other if its closed sets form a sublattice in the lattice of closed sets of the other. We prove that convex geometries…

Combinatorics · Mathematics 2014-01-29 Kira Adaricheva

Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…

In this paper, we propose criteria for unboundedness of the images of set-valued mappings having closed graphs in Euclidean spaces. We focus on mappings whose domains are non-closed or whose values are connected. These criteria allow us to…

Optimization and Control · Mathematics 2024-09-24 Vu Trung Hieu , Elisabeth Anna Sophia Köbis , Markus Arthur Köbis , Paul Hugo Schmölling

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

Combinatorics · Mathematics 2019-09-02 Archy Will He

The kernel of analysis, to me anyway, is the following idea: A point is arbitrarily close to a set if every neighborhood of the point intersects the set. Defining ``arbitrarily close'' in this way provides a foundation for classical results…

History and Overview · Mathematics 2022-08-22 John A. Rock

The concept of open weak CAD is introduced. Every open CAD is an open weak CAD. On the contrary, an open weak CAD is not necessarily an open CAD. An algorithm for computing projection polynomials of open weak CADs is proposed. The key idea…

Symbolic Computation · Computer Science 2019-03-28 Jingjun Han , Liyun Dai , Hoon Hong , Bican Xia

This paper studies visibility problems in Euclidean spaces $\mathbb{R}^d$ where the obstacles are the points of infinite discrete sets $Y\subseteq\mathbb{R}^d$. A point $x\in\mathbb{R}^d$ is called $\varepsilon$-visible for $Y$ (notation:…

Metric Geometry · Mathematics 2018-05-31 Michael Boshernitzan , Yaar Solomon

Let $C$ be a convex subset of a locally convex space. We provide optimal approximate fixed point results for sequentially continuous maps $f\colon C\to\bar{C}$. First we prove that if $f(C)$ is totally bounded, then it has an approximate…

Functional Analysis · Mathematics 2013-02-27 Cleon S. Barroso , Ondřej F. K. Kalenda , Michel P. Rebouças

In this paper, we investigate the concept of p-convexity for sets and functions in n-dimensional Euclidean space. We establish novel algebraic and topological results within this generalized convexity framework. Furthermore, we analyze…

Optimization and Control · Mathematics 2026-04-14 Cristian Vera

The invisibility graph $I(X)$ of a set $X \subseteq \mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two…

Metric Geometry · Mathematics 2017-06-08 Josef Cibulka , Miroslav Korbelář , Jan Kynčl , Viola Mészáros , Rudolf Stolař , Pavel Valtr

We show that for bounded domains in $\mathbb C^n$ with $\mathcal C^{1,1}$ smooth boundary, if there is a closed set $F$ of $2n-1$-Lebesgue measure $0$ such that $\partial \Omega \setminus F$ is $\mathcal C^{2}$-smooth and locally…

Complex Variables · Mathematics 2025-10-22 Quang Dieu Nguyen , Pascal J. Thomas

An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Having no effective formulas to compute the distance of a point and a set, it is hard to…

Metric Geometry · Mathematics 2025-03-11 Ábris Nagy , Márk Oláh , Myroslav Stoika , Csaba Vincze

Let $\mathcal{W}^{n}$ be the class of $C^{\infty }$ complete simply connected $n-$dimensional manifolds without conjugate points. The hyperbolic space as well as Euclidean space are good examples of such manifolds. Let $% W\in…

Differential Geometry · Mathematics 2019-12-05 Sameh Shenawy

This paper studies the weak one-step closure and one-step closure properties concerning the structure of Scott closures. We deduce that every quasicontinuous domain has weak one-step closure and show that a quasicontinuous poset need not…

General Topology · Mathematics 2023-06-22 Hualin Miao , Qingguo Li , Dongsheng Zhao

Let $D$ be a non-pseudoconvex open set in $\C^3$ and $S$ be the union of all two-dimensional planes with non-empty and non-pseudoconvex intersection with $D.$ Sufficient conditions are given for $\C^3\setminus S$ to belong to a complex…

Complex Variables · Mathematics 2012-11-19 Nikolai Nikolov , Peter Pflug

The notion of super weak compactness for subsets of Banach spaces is a strengthening of the weak compactness that can be described as a local version of super-reflexivity. A recent result of K. Tu which establishes that the closed convex…

Functional Analysis · Mathematics 2021-07-13 Gilles Lancien , Matias Raja

In this note we characterize isoperimetric regions inside almost-convex cones. More precisely, as in the case of convex cones, we show that isoperimetric sets are given by intersecting the cone with a ball centered at the origin.

Analysis of PDEs · Mathematics 2016-05-04 Eric Baer , Alessio Figalli

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an {\em opaque set} or a {\em barrier} for that region. We consider the…

Computational Geometry · Computer Science 2015-03-17 Adrian Dumitrescu , Minghui Jiang , János Pach

We consider the problem of the semidefinite representation of a class of non-compact basic semialgebraic sets. We introduce the conditions of pointedness and closedness at infinity of a semialgebraic set and show that under these conditions…

Optimization and Control · Mathematics 2014-02-25 Feng Guo , Chu Wang , Lihong Zhi