Search arXivSearch

arXiv · 2411.07241

A necessary and sufficient condition for $k$-transversals

Abstract

We solve a long-standing open problem posed by Goodman \& Pollack in 1988 by establishing a necessary and sufficient condition for a family of convex sets in $\mathbb{R}^d$ to admit a $k$-transversal for any $0 \le k \le d-1$. This result is a common generalization of Helly's theorem ($k=0$) and the Goodman-Pollack-Wenger theorem ($k=d-1$). Additionally, we obtain an analogue in the complex setting by characterizing the existence of a complex $k$-transversal to a family of convex sets in $\mathbb{C}^d$, extending the work of McGinnis ($k=d-1$). Our approach is topological and employs a Borsuk-Ulam-type theorem on Stiefel manifolds. Finally, we demonstrate how our results imply the central transversal theorems of Živaljević-Vrećica and Dol'nikov in the real case and of Sadovek-Soberón in the complex case.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel McGinnis, Nikola Sadovek. 2026-01-23. A necessary and sufficient condition for $k$-transversals. https://arxiv.org/abs/2411.07241

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