Search arXivSearch

arXiv · 1006.0104

Topological transversals to a family of convex sets

Abstract

Let $\mathcal F$ be a family of compact convex sets in $\mathbb R^d$. We say that $\mathcal F $ has a \emph{topological $ρ$-transversal of index $(m,k)$} ($ρ<m$, $0<k\leq d-m$) if there are, homologically, as many transversal $m$-planes to $\mathcal F$ as $m$-planes containing a fixed $ρ$-plane in $\mathbb R^{m+k}$. Clearly, if $\mathcal F$ has a $ρ$-transversal plane, then $\mathcal F$ has a topological $ρ$-transversal of index $(m,k),$ for $ρ<m$ and $k\leq d-m$. The converse is not true in general. We prove that for a family $\mathcal F$ of $ρ+k+1$ compact convex sets in $\mathbb R^d$ a topological $ρ$-transversal of index $(m,k)$ implies an ordinary $ρ$-transversal. We use this result, together with the multiplication formulas for Schubert cocycles, the Lusternik-Schnirelmann category of the Grassmannian, and different versions of the colorful Helly theorem by Bárány and Lovász, to obtain some geometric consequences.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

L. Montejano, R. N. Karasev. 2010-09-02. Topological transversals to a family of convex sets. https://doi.org/10.1007/s00454-010-9282-z

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