Search arXivSearch

arXiv · 1601.00421

Codimension two and three Kneser Transversals

Abstract

Let $k,d,λ\geqslant 1$ be integers with $d\geqslant λ$ and let $X$ be a finite set of points in $\mathbb{R}^{d}$. A $(d-λ)$-plane $L$ transversal to the convex hulls of all $k$-sets of $X$ is called Kneser transversal. If in addition $L$ contains $(d-λ)+1$ points of $X$, then $L$ is called complete Kneser transversal.In this paper, we present various results on the existence of (complete) Kneser transversals for $λ=2,3$. In order to do this, we introduce the notions of stability and instability for (complete) Kneser transversals. We first give a stability result for collections of $d+2(k-λ)$ points in $\mathbb{R}^d$ with $k-λ\geqslant 2$ and $λ=2,3$. We then present a description of Kneser transversals $L$ of collections of $d+2(k-λ)$ points in $\mathbb{R}^d$ with $k-λ\geqslant 2$ for $λ=2,3$. We show that either $L$ is a complete Kneser transversal or it contains $d-2(λ-1)$ points and the remaining $2(k-1)$ points of $X$ are matched in $k-1$ pairs in such a way that $L$ intersects the corresponding closed segments determined by them. The latter leads to new upper and lower bounds (in the case when $λ=2$ and $3$) for $m(k,d,λ)$ defined as the maximum positive integer $n$ such that every set of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ admit a Kneser transversal.Finally, by using oriented matroid machinery, we present some computational results (closely related to the stability and unstability notions). We determine the existence of (complete) Kneser transversals for each of the $246$ different order types of configurations of $7$ points in $\mathbb{R}^3$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonathan Chappelon, Leonardo Martínez-Sandoval, Luis Montejano, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín. 2017-11-15. Codimension two and three Kneser Transversals. https://arxiv.org/abs/1601.00421

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