arXiv (All)
open access
More on Disjunctive Convex Hulls of Generalized Cross Polytopes
We continue the study of the convex hull $D\subset\mathbb{R}^{d+n}$ of a disjunction of $n+1$ polytopes in $\mathbb{R}^d$, managed by $n$ binary indicator variables. Previously, $D$ had been characterized for arbitrary polytopes when $d\in\{1,2\}$, for polytopes sharing a common constraint matrix (u
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A semidefinite programming approach to cross $2$-intersecting families#612769
- A semidefinite programming approach to cross $2$-intersecting families#611292
- Optimal transport to non-convex polyhedral domains#1344253
- The Deliberative Constraint on Reasons#92513
- A connectedness result for convex polynomial multi-objective optimization without boundedness#1155964
Record · ID 1201573
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive