English
Related papers

Related papers: Complements of rationally convex sets

200 papers

The second-order tangent set is an important concept in describing the curvature of the set involved. Due to the existence of the complementarity condition, the second-order cone (SOC) complementarity set is a nonconvex set. Moreover,…

Optimization and Control · Mathematics 2019-06-25 Jein-Shan Chen , Jane J. Ye , Jin Zhang , Jinchuan Zhou

In this paper, we show that the Chvatal-Gomory closure of a compact convex set is a rational polytope. This resolves an open question discussed in Schrijver [Schrijver 80'] and generalizes the same result for the case of rational polytopes…

Optimization and Control · Mathematics 2010-11-09 Daniel Dadush , Santanu S. Dey , Juan Pablo Vielma

Let W be a compact simply connected triangulated manifold with boundary and $K \subset W$ be a subpolyhedron. We construct an algebraic model of the rational homotopy type of the complement $W \setminus K$ out of a model of the map of pairs…

Algebraic Topology · Mathematics 2015-05-20 Hector Cordova Bulens , Pascal Lambrechts , Donald Stanley

We prove a canonical bundle formula for generically finite morphisms in the setting of generalized pairs (with $\mathbb{R}$-coefficients). This complements Filipazzi's canonical bundle formula for morphisms with connected fibres. It is then…

Algebraic Geometry · Mathematics 2020-11-19 Jingjun Han , Wenfei Liu

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Metric Geometry · Mathematics 2020-02-20 Lyle Ramshaw , James B. Saxe

Over the past years a theory of conjugate duality for set-valued functions that map into the set of upper closed subsets of a preordered topological vector space was developed. For scalar duality theory, continuity of convex functions plays…

Optimization and Control · Mathematics 2014-03-13 Frank Heyde , Carola Schrage

We construct an explicit and calculable models for rational U(2)-spectra. This is obtained by assembling seven blocks obtained in previous work: the toral part and earlier work on small toral groups. The assembly process requires detailed…

Algebraic Topology · Mathematics 2025-02-04 J. P. C. Greenlees

Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…

Discrete Mathematics · Computer Science 2021-12-14 Gabriela Cristescu , Vlad-Florin Dragoi , Sorin-Horatiu Hoara

We examine a condition on a simply connected 2-complex X ensuring that groups acting properly on X are coherent. This extends earlier work on 2-complexes with negative sectional curvature which covers the case that G acts freely. Our…

Group Theory · Mathematics 2016-02-17 Eduardo Martínez-Pedroza , Daniel T. Wise

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

We prove a condition on f \in C^2(\R+,\R) for the convexity of (f o det) on PSym(n), namely that f o det is convex on PSym(n) if and only if f"(s)+(n-1)/(ns) f'(s) >= 0 and f'(s)<= 0 \forall s \in \R+. This generalizes the observation that…

Mathematical Physics · Physics 2012-09-26 Stephan Lehmich , Patrizio Neff , Johannes Lankeit

We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an $O(n\log n)$-time algorithm for the two-center…

Computational Geometry · Computer Science 2021-05-14 Jongmin Choi , Dahye Jeong , Hee-Kap Ahn

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…

Combinatorics · Mathematics 2021-08-03 Alexander Lemmens

Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…

Optimization and Control · Mathematics 2021-10-26 Miles Lubin , Juan Pablo Vielma , Ilias Zadik

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

Optimization and Control · Mathematics 2017-01-03 Alexander Weber , Gunther Reissig

The present article includes the enumeration of $n$-polygons with a certain symmetry property: For an even number $n$ of vertices, we count the $n$-polygons with $\frac{n}{2}$ symmetry axes. In addition, if $n$ is a power of 2, we show the…

Combinatorics · Mathematics 2019-09-11 Rolf Haag

We prove that two dimensional convex subsets of spherical buildings are either buildings or have a center.

Metric Geometry · Mathematics 2007-05-23 Andreas Balser , Alexander Lytchak

We investigate the regularity of the marginals onto hyperplanes for sets of finite perimeter. We prove, in particular, that if a set of finite perimeter has log-concave marginals onto a.e. hyperplane then the set is convex.

Metric Geometry · Mathematics 2015-02-24 Alessio Figalli , David Jerison

We show that the set of fixed points of the average of two resolvents can be found from the set of fixed points for compositions of two resolvents associated with scaled monotone operators. Recently, the proximal average has attracted…

Functional Analysis · Mathematics 2010-03-26 Xianfu Wang , Heinz H. Bauschke

There is a hierarchy of structure conditions for convex sets. In this paper we study a recently defined [3, 8, 9] condition called locally nonconical convexity (abbreviated LNC). Is is easy to show that every strictly convex set is LNC, as…

Functional Analysis · Mathematics 2016-09-07 C. A. Akemann , G. C. Shell , N. Weaver
‹ Prev 1 8 9 10 Next ›