Search arXivSearch

arXiv · 0807.2839

Uneven Splitting of Ham Sandwiches

Abstract

Let m_1,...,m_n be continuous probability measures on R^n and a_1,...,a_n in [0,1]. When does there exist an oriented hyperplane H such that the positive half-space H^+ has m_i(H^+)=a_i for all i in [n]? It is well known that such a hyperplane does not exist in general. The famous ham sandwich theorem states that if a_i=1/2 for all i, then such a hyperplane always exists. In this paper we give sufficient criteria for the existence of H for general a_i in [0,1]. Let f_1,...,f_n:S^{n-1}->R^n denote auxiliary functions with the property that for all i the unique hyperplane H_i with normal v that contains the point f_i(v) has m_i(H_i^+)=a_i. Our main result is that if Im(f_1),...,Im(f_n) are bounded and can be separated by hyperplanes, then there exists a hyperplane H with m_i(H^+)=a_i for all i. This gives rise to several corollaries, for instance if the supports of m_1,...,m_n are bounded and can be separated by hyperplanes, then H exists for any choice of a_1,...,a_n in [0,1]. We also obtain results that can be applied if the supports of m_1,...,m_n overlap.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Felix Breuer. 2008-07-17. Uneven Splitting of Ham Sandwiches. https://doi.org/10.1007/s00454-009-9161-7

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