arXiv (All)
open access
Sharp projection inequalities for antichains in cone orders
We establish sharp projection inequalities for $k$-antichains under orders defined by open convex cones. For integers $n\geq2$ and $k\ge 1$, let $C\subsetneq\mathbb R^n$ be a nonempty open convex cone. A set $A\subseteq\mathbb R^n$ is a $k$-antichain with respect to the order $x\prec_C y\iff y-x\in
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
- Regularity of compact convex sets--classical and noncommutative#973057
- Integer points in arbitrary convex cones: the case of the PSD and SOC cones#634746
- A note on efficient k-limited broadcast domination in graphs#659009
- A note on efficient k-limited broadcast domination in graphs#656873
- The renorming-stable ball covering property and $C(K)$-spaces#1202265
Record · ID 1325459
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