SearcharxivSearch

arXiv · 2609.21927

A colorful Steinitz theorem with different centers

Abstract

We prove a colorful quantitative Steinitz theorem in which the color classes may have different centers. If the convex hull of each of $2d$ sets in $\R^d$ contains a translate of the Euclidean unit ball, then a rainbow convex hull contains a ball of radius $(3d)^{-2d^2}$ whose center belongs to the convex hull of the given centers. The main ingredient is an exact result for translates of a segment, proved by a lifting and a topological colorful Helly theorem. The same idea also yields a sharp colorful Helly theorem for translated cones: for $1 \le k \le d-1$, if every rainbow selection from $2d-k+1$ finite families of convex sets in $\mathbb{R}^d$ has a $k$-dimensional cone in its intersection, then the intersection of one of the families contains such a cone.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

G. Ivanov. 2026-09-18. A colorful Steinitz theorem with different centers. https://arxiv.org/abs/2609.21927

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO