English
Related papers

Related papers: The hamburger theorem

200 papers

We generalize the concept of mutually unbiased bases (MUB) to measurements which are not necessarily described by rank one projectors. As such, these measurements can be a useful tool to study the long standing problem of the existence of…

Quantum Physics · Physics 2015-06-18 Amir Kalev , Gilad Gour

Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…

Representation Theory · Mathematics 2020-12-07 Mickaël Buchet , Emerson G. Escolar

Suppose that $nk$ points in general position in the plane are colored red and blue, with at least $n$ points of each color. We show that then there exist $n$ pairwise disjoint convex sets, each of them containing $k$ of the points, and each…

Combinatorics · Mathematics 2017-06-08 Andreas F. Holmsen , Jan Kynčl , Claudiu Valculescu

We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…

Combinatorics · Mathematics 2007-05-23 Torsten Schöneborn

Let $S$ be a $k$-colored (finite) set of $n$ points in $\mathbb{R}^d$, $d\geq 3$, in general position, that is, no {$(d + 1)$} points of $S$ lie in a common $(d - 1)$}-dimensional hyperplane. We count the number of empty monochromatic…

Combinatorics · Mathematics 2012-10-29 Oswin Aichholzer , Ruy Fabila-Monroy , Thomas Hackl , Clemens Huemer , Jorge Urrutia

Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…

Computational Geometry · Computer Science 2021-04-13 Radoslav Fulek , Bernd Gärtner , Andrey Kupavskii , Pavel Valtr , Uli Wagner

We prove the following optimal colorful Tverberg-Vrecica type transversal theorem: For prime r and for any k+1 colored collections of points C^l of size |C^l|=(r-1)(d-k+1)+1 in R^d, where each C^l is a union of subsets (color classes) C_i^l…

Algebraic Topology · Mathematics 2022-03-25 Pavle Blagojevic , Benjamin Matschke , Gunter Ziegler

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

Classical Analysis and ODEs · Mathematics 2024-06-17 Paige Bright , Caleb Marshall

A finite point set in $\mathbb{R}^d$ is in general position if no $d + 1$ points lie on a common hyperplane. Let $\alpha_d(N)$ be the largest integer such that any set of $N$ points in $\mathbb{R}^d$, with no $d + 2$ members on a common…

Combinatorics · Mathematics 2026-01-14 Andrew Suk , Ji Zeng

Consider the graph $\mathbb{H}(d)$ whose vertex set is the hyperbolic plane, where two points are connected with an edge when their distance is equal to some $d>0$. Asking for the chromatic number of this graph is the hyperbolic analogue to…

Combinatorics · Mathematics 2019-06-04 Evan DeCorte , Konstantin Golubev

Gr\"unbaum's equipartition problem asked if for any measure $\mu$ on $\mathbb{R}^d$ there are always $d$ hyperplanes which divide $\mathbb{R}^d$ into $2^d$ $\mu$-equal parts. This problem is known to have a positive answer for $d\le 3$ and…

Combinatorics · Mathematics 2024-10-04 Gerardo L. Maldonado , Edgardo Roldán-Pensado

Given $d+1$ sets, or colours, $S_1, S_2,...,S_{d+1}$ of points in $\mathbb{R}^d$, a {\em colourful} set is a set $S\subseteq\bigcup_i S_i$ such that $|S\cap S_i|\leq 1$ for $i=1,...,d+1$. The convex hull of a colourful set $S$ is called a…

Computational Geometry · Computer Science 2014-03-07 Frédéric Meunier , Antoine Deza

Tverberg's theorem states that for any $k \ge 2$ and any set $P \subset \mathbb{R}^d$ of at least $(d + 1)(k - 1) + 1$ points in $d$ dimensions, we can partition $P$ into $k$ subsets whose convex hulls have a non-empty intersection. The…

Computational Geometry · Computer Science 2023-07-06 Aruni Choudhary , Wolfgang Mulzer

We prove an extension of a ham sandwich theorem for families of lines in the plane by Dujmovi\'{c} and Langerman. Given two sets $A, B$ of $n$ lines each in the plane, we prove that it is possible to partition the plane into $r$ convex…

Metric Geometry · Mathematics 2019-10-15 Alexander Xue , Pablo Soberón

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

Combinatorics · Mathematics 2016-09-07 Vitaly Bergelson , Alexander Leibman

We show that in any $d$-dimensional real normed space, unit balls can be packed with density at least \[\frac{(1-o(1))d\log d}{2^{d+1}},\] improving a result of Schmidt from 1958 by a logarithmic factor and generalizing the recent result of…

Metric Geometry · Mathematics 2025-04-23 Carl Schildkraut

It is proved that if we partition a $d$-dimensional cube into $n^d$ small cubes and color the small cubes into $m+1$ colors then there exists a monochromatic connected component consisting of at least $f(d, m) n^{d-m}$ small cubes.

Combinatorics · Mathematics 2013-08-23 Roman Karasev

Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…

Combinatorics · Mathematics 2021-09-09 Pablo Soberón , Yuki Takahashi

Let $\mu$ be a self-conformal measure on $\mathbb{R}^d$. In this note we establish conditions for $\mu$ under which $\dim(\mu*\nu) = \min\lbrace d,\dim\mu+\dim\nu\rbrace$ holds when $\nu$ is any Ahlfors-regular or self-conformal measure on…

Dynamical Systems · Mathematics 2025-11-19 Aleksi Pyörälä

The well known fractional Helly theorem and colorful Helly theorem can be merged into the so called colorful fractional Helly theorem. It states: For every $\alpha \in (0, 1]$ and every non-negative integer $d$, there is $\beta_{col} =…

Combinatorics · Mathematics 2020-12-02 Denys Bulavka , Afshin Goodarzi , Martin Tancer