arXiv (All)
open access
Pinch's conjecture on $a$-convexity
For $a$ in $\mathbb{R}$, a subset $V$ contained in $\mathbb{R}^{n}$ is said to be $a$-convex if $x, y \in V \Longrightarrow a x + (1-a) y \in V$. According to Pinch [Math. Proc. Cambridge Philos. Soc., 1985], the $a$-convex hull of $V$ is the intersection of all of the $a$-convex subsets of $\mathbb
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 product inequality and its application to cross-intersecting families#1117899
- The Zaporozhets-Tarasov Conjecture on Mean Distances#926154
- The Sylvester question in $\mathbb{R}^d$: convex sets with a flat floor#799835
- Some constructions of restricted Kakeya sets#974670
- El conservadurismo realista acerca de la composición de Daniel Korman#778796
Record · ID 1105330
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