Search arXivSearch

arXiv · 2109.13106

Bisections of mass assignments using flags of affine spaces

Abstract

We use recent extensions of the Borsuk--Ulam theorem for Stiefel manifolds to generalize the ham sandwich theorem to mass assignments. A $k$-dimensional mass assignment continuously imposes a measure on each $k$-dimensional affine subspace of $\mathbb{R}^d$. Given a finite collection of mass assignments of different dimensions, one may ask if there is some sequence of affine subspaces $S_{k-1} \subset S_k \subset \ldots \subset S_{d-1} \subset \mathbb{R}^d$ such that $S_i$ bisects all the mass assignments on $S_{i+1}$ for every $i$. We show it is possible to do so whenever the number of mass assignments of dimensions $(k,\ldots,d)$ is a permutation of $(k,\ldots,d)$. We extend previous work on mass assignments and the central transversal theorem. We also study the problem of halving several families of $(d-k)$-dimensional affine spaces of $\mathbb{R}^d$ using a $(k-1)$-dimensional affine subspace contained in some translate of a fixed $k$-dimensional affine space. For $k=d-1$, there results can be interpreted as dynamic ham sandwich theorems for families of moving points.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ilani Axelrod-Freed, Pablo Soberón. 2021-10-07. Bisections of mass assignments using flags of affine spaces. https://arxiv.org/abs/2109.13106

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

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO