English
Related papers

Related papers: A "hidden" characterization of polyhedral convex s…

200 papers

The purpose of the present paper is to show few examples of nonlinear PDEs (mostly with strong geometric features) for which there is a hidden convex structure. This is not only a matter of curiosity. Once the convex structure is…

Analysis of PDEs · Mathematics 2009-02-17 Yann Brenier

Kneser-Haken Finiteness asserts that for each compact 3-manifold M there is an integer c(M) such that any collection of k>c(M) closed, essential, 2-sided surfaces in M must contain parallel elements. We show here that if M is closed then…

Geometric Topology · Mathematics 2007-05-23 David Bachman

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…

Algebraic Geometry · Mathematics 2016-06-30 Mario Kummer

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…

Combinatorics · Mathematics 2011-08-02 Adam N. Letchford , Hanna Seitz , Dirk Oliver Theis

This note is motivated by the article of Bamerni, Kadets and Kili\c{c}man [J. Math. Anal. Appl. 435 (2), 1812--1815 (2016)]. We consider the remaining problem which claims that if $A$ is a dense subset of a finite dimensional space $X$,…

Functional Analysis · Mathematics 2024-05-01 Salah Herzi , Habib Marzougui

Let $S$ be a smooth, totally real, compact immersion in $\mathbb{C}^n$ of real dimension $m \leq n$, which is locally polynomially convex and it has finitely many points where it self-intersects finitely many times, transversely or…

Complex Variables · Mathematics 2023-08-01 Octavian Mitrea

Recently Schrijver's open problem, whether the Chv\'atal--Gomory closure of an irrational polytope is polyhedral was answered independently in the affirmative by Dadush, Dey, and Vielma (even for arbitrarily compact convex set) as well as…

Combinatorics · Mathematics 2014-05-20 Gábor Braun , Sebastian Pokutta

We prove that for any compact set B in R^d and for any epsilon >0 there is a finite subset X of B of |X|=d^{O(1/epsilon^2)} points such that the maximum absolute value of any linear function ell: R^d --> R on X approximates the maximum…

Metric Geometry · Mathematics 2012-04-13 Alexander Barvinok

A convex polyhedron $P$ is $k$-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of $P$ are $k$-gon for some fixed value of $k$. Since 1968, it is an open problem to construct all…

Computational Geometry · Computer Science 2010-09-14 Masud Hasan , Mohammad Monoar Hossain , Alejandro López-Ortiz , Sabrina Nusrat , Saad Altaful Quader , Nabila Rahman

Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…

Computational Geometry · Computer Science 2021-07-02 David Eppstein

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

A three-dimensional convex body is said to have Rupert's property if its copy can be passed through a straight hole inside that body. In this work we construct a polyhedron which is provably not Rupert, thus we disprove a conjecture from…

Metric Geometry · Mathematics 2026-01-30 Jakob Steininger , Sergey Yurkevich

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

Optimization and Control · Mathematics 2017-06-20 Miles Lubin , Ilias Zadik , Juan Pablo Vielma

This paper discusses a more general contractive condition for a class of extended 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…

Functional Analysis · Mathematics 2012-08-06 M. De la Sen

For every hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. We prove that…

Metric Geometry · Mathematics 2024-02-27 Marek Lassak

The equidistant set of two nonempty subsets $K$ and $L$ in the Euclidean plane is a set all of whose points have the same distance from $K$ and $L$. Since the classical conics can be also given in this way, equidistant sets can be…

Metric Geometry · Mathematics 2018-02-13 Csaba Vincze

The problem of shadow is solved. It is equivalent to condition for point is in generalized convex hull of a family of compact sets.

Metric Geometry · Mathematics 2015-01-29 Yurii Zelinskii , Irina Vyhovska , Maria Stefanchuk

A polyhedron is pointed if it contains at least one vertex. Every pointed polyhedron P in R^n can be described by an H-representation consisting of half spaces or equivalently by a V-representation consisting of the convex hull of a set of…

Optimization and Control · Mathematics 2025-10-10 David Avis

We obtain two partial answers to the 3-space problem for isomorphic polyhedrality: (1) every twisted sum of $C(\alpha)$, $\alpha<\omega_1$, with a separable isomorphically polyhedral space with the BAP, is isomorphically polyhedral. (2)…

Functional Analysis · Mathematics 2025-03-12 Jesús M. F. Castillo , Alberto Salguero Alarcón

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

Computational Geometry · Computer Science 2024-12-20 Erik D. Demaine , Martin L. Demaine , Markus Hecher , Rebecca Lin , Victor H. Luo , Chie Nara