Search arXivSearch

arXiv · 2507.11013

A characterization of the Carathéodory number for $H$-convexity

Abstract

We show that the Carathéodory number for $H$-convexity is the maximum of two parameters: the Helly number for $H$-convexity and the cone number of $H$. The cone number in this article is defined as the maximal number of points of $H$ in conical position with an empty positive hull relative to the remaining points. Earlier partial results by Boltyanski and Martini can provide an exact value for the Carathéodory number only when the Helly number is $1$ or $2$. We further establish connections between the Carathéodory numbers for $H$-convexity and that for $K$-strong convexity, where $H$ is the set of normals of $K$. Specifically, the Carathéodory number for $H$-convexity provides a lower bound for that of $K$-strong convexity. Moreover, if $K$ is a polytope, which has $|H|$ facets, then the Carathéodory number for $K$-strong convexity is at most the maximum of $|H|-1$ and the Carathéodory number for $H$-convexity. We conjecture a characterization of when the bound $|H|-1$ is attained. It is a consequence of a broader conjecture stating that the Carathéodory number for $K$-strong convexity is at most the maximum of the Carathéodory numbers for $H'$-convexity over all subsets $H'\subseteq H$. Finally, we observe that the Carathéodory number is at least the Helly number in any convex-structure where all sets are ordinarily convex.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vuong Bui. 2025-07-15. A characterization of the Carathéodory number for $H$-convexity. https://arxiv.org/abs/2507.11013

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO