Related papers: On Tverberg partitions

Here are two of our main results: Theorem 1. Let X be a normal space with dim X=n and m\geq n+1. Then the space C*(X,R^m) of all bounded maps from X into R^m equipped with the uniform convergence topology contains a dense G_{\delta}-subset…

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $\Delta(n,A)$ the number of ways to partition $n$ as the form…

A special case of an elegant result due to Anderson proves that the number of $(s,s+1)$-core partitions is finite and is given by the Catalan number $C_s$. Amdeberhan recently conjectured that the number of $(s,s+1)$-core partitions into…

Hadwiger's conjecture asserts that if a simple graph $G$ has no $K_{t+1}$ minor, then its vertex set $V(G)$ can be partitioned into $t$ stable sets. This is still open, but we prove under the same hypotheses that $V(G)$ can be partitioned…

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…

A typical decomposition question asks whether the edges of some graph $G$ can be partitioned into disjoint copies of another graph $H$. One of the oldest and best known conjectures in this area, posed by Ringel in 1963, concerns the…

Let $f_r(d,s_1,\ldots,s_r)$ denote the least integer $n$ such that every $n$-point set $P\subseteq\mathbb{R}^d$ admits a partition $P=P_1\cup\cdots\cup P_r$ with the property that for any choice of $s_i$-convex sets $C_i\supseteq P_i$…

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

Consider a set $X\subseteq \mathbb{R}^d$ which is 1-dense, namely, it intersects every unit ball. We show that we can get from any point to any other point in $\mathbb{R}^d$ in $n$ steps so that the intermediate points are in $X$, and the…

E394 in the Enestrom index. Translated from the Latin original, "De partitione numerorum in partes tam numero quam specie datas" (1768). Euler finds a lot of recurrence formulas for the number of partitions of $N$ into $n$ parts from some…

In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur's celebrated partition identity (1926). Andrews' two generalisations of Schur's theorem went on to become two of the most…

We study topological analogues of Kalai's cascade conjecture. Given a continuous map from an $n$-simplex to $\mathbb R^d$, let $T_r(f)$ be the set of points contained in the images of $r$ pairwise disjoint faces. We prove that if $r$ is a…

We study colorful no-dimensional Tverberg-type problems and obtain several optimal results. A colorful no-dimensional Tverberg-type theorem provides a bound on a radius $R$ such that, for any pairwise disjoint $k$-element subsets…

Let $r \geq 2$, $n$ and $k$ be integers satisfying $k \leq \frac{r-1}{r}n$. In the original arXiv version of this note we suggested a conjecture that the family of all $k$-subsets of an $n$-set cannot be partitioned into fewer than $\lceil…

We present a polynomial time algorithm, which solves a nonstandard Variation of the well-known PARTITION-problem: Given positive integers $n, k$ and $t$ such that $t \geq n$ and $k \cdot t = {n+1 \choose 2}$, the algorithm partitions the…

We will prove the following generalization of the ham sandwich Theorem, conjectured by Imre B\'ar\'any. Given a positive integer $k$ and $d$ nice measures $\mu_1, \mu_2,..., \mu_d$ in $\mathbb{R}^d$ such that $\mu_i (\mathds{R}^d) = k$ for…

The topological Tverberg theorem has been generalized in several directions by setting extra restrictions on the Tverberg partitions. Restricted Tverberg partitions, defined by the idea that certain points cannot be in the same part, are…

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

The Rado-Horn theorem provides necessary and sufficient conditions for when a collection of vectors can be partitioned into a fixed number of linearly independent sets. Such partitions exist if and only if every subset of the vectors…