English
Related papers

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

200 papers

A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…

Optimization and Control · Mathematics 2011-03-28 Gennadiy Averkov , Christian Wagner , Robert Weismantel

Using elementary duality properties of positive semidefinite moment matrices and polynomial sum-of-squares decompositions, we prove that the convex hull of rationally parameterized algebraic varieties is semidefinite representable (that is,…

Optimization and Control · Mathematics 2011-01-31 Didier Henrion

It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…

Optimization and Control · Mathematics 2021-06-14 Yibo Xu , Warren Adams , Akshay Gupte

We describe convex hulls of the simplest compact space curves, reducible quartics consisting of two circles. When the circles do not meet in complex projective space, their algebraic boundary contains an irrational ruled surface of degree…

Algebraic Geometry · Mathematics 2017-01-24 Evan D. Nash , Ata Firat Pir , Frank Sottile , Li Ying

For a Euclidean building $X$ of type $A_{2}$, we classify the 0-dimensional subbuildings $A$ of $\partial_{T}X$ that occur as the asymptotic boundary of closed convex subsets. In particular, we show that triviality of the holonomy of a…

Metric Geometry · Mathematics 2007-05-23 Andreas Balser

We study the complexity of computing the mixed-integer hull $\operatorname{conv}(P\cap\mathbb{Z}^n\times\mathbb{R}^d)$ of a polyhedron $P$. Given an inequality description, with one integer variable, the mixed-integer hull can have…

Optimization and Control · Mathematics 2015-03-11 Robert Hildebrand , Timm Oertel , Robert Weismantel

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

Complex Variables · Mathematics 2020-09-29 Purvi Gupta , Rasul Shafikov

We show that any finite $S \subset \mathbb{R}^d$ in general position has arbitrarily large supersets $T \supseteq S$ in general position with the property that $T$ contains no empty convex polygon, or hole, with $C_d$ points, where $C_d$ is…

Combinatorics · Mathematics 2022-11-11 David Conlon , Jeck Lim

L-convex sets are one of the most fundamental concepts in discrete convex analysis. Furthermore, the Minkowski sum of two L-convex sets, called L2-convex sets, is an intriguing object that is closely related to polymatroid intersection.…

Combinatorics · Mathematics 2022-03-28 Satoko Moriguchi , Kazuo Murota

Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties.For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear…

Programming Languages · Computer Science 2018-05-16 David Monniaux

This work revolves around the two following questions: Given a convex body $C\subset\mathbb{R}^d$, a positive integer $k$ and a finite set $S\subset\mathbb{R}^d$ (or a finite Borel measure $\mu$ on $\mathbb{R}^d$), how many homothets of $C$…

Combinatorics · Mathematics 2022-12-06 Oriol Solé Pi

In this paper, we investigate the polyhedral structure of two submodular sets with generalized upper bound (GUB) constraints, which arise as important substructures in various real-world applications. We derive a class of strong valid…

Optimization and Control · Mathematics 2026-01-27 Weikang Qian , Keyan Li , Wei-Kun Chen , Yu-Hong Dai

Let X and Y be finite dimensional normed spaces, F(X,Y) a collection of all mappings from X into Y. A mapping $P\in F(X,Y)$ is said to be piecewise affine if there exists a finite family of convex polyhedral subsets covering X and such that…

Functional Analysis · Mathematics 2011-11-08 V. V. Gorokhovik

It is proved that every discrete Morse function in the sense of Forman on a finite regular CW complex can be represented by a polyhedral Morse function in the sense of Banchoff on an appropriate embedding in Euclidean space of the…

Combinatorics · Mathematics 2010-08-24 Ethan D. Bloch

A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint closed and convex set by a closed hyperplane. In this paper we give some results on the…

Optimization and Control · Mathematics 2020-03-26 Phung Huynh The

We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is…

Logic · Mathematics 2024-02-14 Endre Tóth , Tamás Waldhauser

We prove that: 1. If a Hausdorff M-space is a continuous closed image of a submetrizable space, then it is metrizable. 2. A dense-in-itself open-closed image of a submetrizable space is submetrizable if and only if it is functionally…

General Topology · Mathematics 2023-12-07 Vlad Smolin

We study a certain Helly-type question by Konrad Swanepoel. Assume that $X$ is a set of points such that every $k$-subset of $X$ is in centrally symmetric convex position, is it true that $X$ must also be in centrally symmetric convex…

Metric Geometry · Mathematics 2021-04-20 Alexey Garber , Edgardo Roldán-Pensado

Let $F\subset\Bbb C^n$ be a proper closed subset of $\Bbb C^n$ and $A\subset\Bbb C^n\setminus F$ at most countable ($n\geq 2$). We give conditions of $F$ and $A$, under which there exists a holomorphic immersion (or a proper holomorphic…

Complex Variables · Mathematics 2009-11-10 Nikolai Nikolov , Peter Pflug

A set $S\subseteq \re^n$ is called to be {\it Semidefinite (SDP)} representable if $S$ equals the projection of a set in higher dimensional space which is describable by some Linear Matrix Inequality (LMI). The contributions of this paper…

Optimization and Control · Mathematics 2008-12-08 J. William Helton , Jiawang Nie
‹ Prev 1 8 9 10 Next ›