English
Related papers

Related papers: Representing finite convex geometries by relativel…

200 papers

Convex semilattices are algebras that are at the same time a convex algebra and a semilattice, together with a distributivity axiom. These algebras have attracted some attention in the last years as suitable algebras for probability and…

Logic in Computer Science · Computer Science 2025-07-16 Ana Sokolova , Harald Woracek

There are several notions of a smooth map from a convex set to a cartesian space. Some of these notions coincide, but not all of them do. We construct a real-valued function on a convex subset of the plane that does not extend to a smooth…

Differential Geometry · Mathematics 2023-02-15 Yael Karshon , Jordan Watts

This paper focuses on investigating generalized relative interior notions for sets in locally convex topological vector spaces with particular attentions to graphs of set-valued mappings and epigraphs of extended-real-valued functions. We…

Optimization and Control · Mathematics 2023-08-01 Vo Si Trong Long , Boris Mordukhovich , Nguyen Mau Nam

Mixing, and coherence are fundamental issues at the heart of understanding transport in fluid dynamics and other non-autonomous dynamical systems. Recently, the notion of coherence has come to a more rigorous footing, and particularly…

Dynamical Systems · Mathematics 2014-05-07 Tian Ma , Erik Bollt

This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…

Optimization and Control · Mathematics 2018-06-18 Evgeni Nurminski , Stan Uryasev

Let $K_0$ be a compact convex subset of the plane $\mathbb R^2$, and assume that $K_1\subseteq \mathbb R^2$ is similar to $K_0$, that is, $K_1$ is the image of $K_0$ with respect to a similarity transformation $\mathbb R^2\to\mathbb R^2$.…

Metric Geometry · Mathematics 2017-07-25 Gábor Czédli

Results of Sierpinski and others have shown that certain finite-dimensional product sets can be written as unions of subsets, each of which is "narrow" in a corresponding direction; that is, each line in that direction intersects the subset…

Logic · Mathematics 2021-02-09 Randall Dougherty

We study the geometric structure of compact convex sets in 2-dimensional asymmetric normed lattices. We prove that every q-compact convex set is strongly q-compact and we give a complete geometric description of the compact convex sets with…

General Topology · Mathematics 2014-09-10 Natalia Jonard-Pérez , Enrique A. Sánchez-Pérez

This article shows the existence of a class of closed bounded matrix convex sets which do not have absolute extreme points. The sets we consider are noncommutative sets, $K_X$, formed by taking matrix convex combinations of a single tuple…

Operator Algebras · Mathematics 2022-02-24 Eric Evert

An n-gon is defined as a sequence \P=(V_0,...,V_{n-1}) of n points on the plane. An n-gon \P is said to be convex if the boundary of the convex hull of the set {V_0,...,V_{n-1}} of the vertices of \P coincides with the union of the edges…

Computational Geometry · Computer Science 2007-05-23 Iosif Pinelis

Describing shapes by suitable measures in object segmentation, as proposed in [24], allows to combine the advantages of the representations as parametrized contours and indicator functions. The pseudo-Riemannian structure of optimal…

Differential Geometry · Mathematics 2013-09-10 Bernhard Schmitzer , Christoph Schnörr

We study the problems of testing and learning high-dimensional discrete convex sets. The simplest high-dimensional discrete domain where convexity is a non-trivial property is the ternary hypercube, $\{-1,0,1\}^n$. The goal of this work is…

Data Structures and Algorithms · Computer Science 2023-11-21 Hadley Black , Eric Blais , Nathaniel Harms

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

Previous work on convexity of neural codes has produced codes that are open-convex but not closed-convex -- or vice-versa. However, why a code is one but not the other, and how to detect such discrepancies are open questions. We tackle…

Combinatorics · Mathematics 2022-08-30 Patrick Chan , Katherine Johnston , Joseph Lent , Alexander Ruys de Perez , Anne Shiu

Illumination complexes are examples of 'flat polyhedral complexes' which arise if several copies of a convex polyhedron (convex body) Q are glued together along some of their common faces (closed convex subsets of their boundaries). A…

Metric Geometry · Mathematics 2013-07-22 Rade T. Živaljević

Let $\| \cdot \|$ be the euclidean norm on ${\bf R}^n$ and $\gamma_n$ the (standard) Gaussian measure on ${\bf R}^n$ with density $(2 \pi )^{-n/2} e^{- \| x\|^2 /2}$. Let $\vartheta$ ($ \simeq 1.3489795$) be defined by $\gamma_1 ([ -…

Metric Geometry · Mathematics 2016-09-06 W. Banaszczyk , Stanislaw J. Szarek

In this short note, we show that the inradius of a convex body is comparable to its volume divided by its surface area. We also give a simple formula, in terms of its volume and inradius, that is comparable to the volume of its intersection…

Metric Geometry · Mathematics 2024-02-13 Benedict Sewell

Consider a measurable space with a finite vector measure. This measure defines a mapping of the $\sigma$-field into a Euclidean space. According to Lyapunov's convexity theorem, the range of this mapping is compact and, if the measure is…

Probability · Mathematics 2011-02-15 Peng Dai , Eugene A. Feinberg

One considers geometry with the intransitive equaivalence relation. Such a geometry is a physical geometry, i.e. it is described completely by the world function, which is a half of the squared distance function. The physical geometry…

General Mathematics · Mathematics 2009-03-30 Yuri A. Rylov

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov