Related papers: Radon numbers grow linearly

The bipartite Ramsey number $BR(H_1,H_2,\ldots,H_k)$, is the smallest positive integer $b$, such that each $k$-decomposition of $E(K_{b,b})$ contains $H_i$ in the $i$-th class for some $i, 1\leq i\leq k$. As another view of bipartite Ramsey…

We show that a Hagedorn spectrum (i.e., spectrum where the number of hadrons grows exponentially with the mass) emerges automatically in large $N_c$ QCD in 2+1 and 3+1 dimensions. The approach is based on the study of Euclidean space…

The canonical Ramsey theorem of Erd\H{o}s and Rado implies that for any graph $H$, any edge-coloring (with an arbitrary number of colors) of a sufficiently large complete graph $K_N$ contains a monochromatic, lexicographic, or rainbow copy…

In this work we prove that if for a pair of convex bodies $K_1, K_2 \subset \mathbb{R}^n$, $n \geq 3$, there exists a hyperplane $H$ and two distinct points $p_1$ and $p_2$ in $\mathbb{R}^n \setminus H$ such that for every $(n-2)$-plane $M…

Let $f(d)$ be the smallest number so that every set in $R^d$ of diameter 1 can be partitioned into $f(d)$ sets of diameter smaller than 1. Borsuk's conjecture was that $f(d)\! =\!d\!+\!1$. We prove that $f(d)\! \ge\! (1.2)^{\sqrt d}$ for…

For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…

In [6], Kellerhals and Perren conjectured that the growth rates of the reflection groups given by hyperbolic Coxeter polyhedra are always Perron numbers. We prove that this conjecture is always true for the case of ideal Coxeter polyhedra…

We prove that the set of directions of lines intersecting three disjoint balls in $R^3$ in a given order is a strictly convex subset of $S^2$. We then generalize this result to $n$ disjoint balls in $R^d$. As a consequence, we can improve…

For a graph $G$, the $k$-colour Ramsey number $R_k(G)$ is the least integer $N$ such that every $k$-colouring of the edges of the complete graph $K_N$ contains a monochromatic copy of $G$. Let $C_n$ denote the cycle on $n$ vertices. We show…

We combine observed properties of galaxies as the core density and radius with the theoretical linear evolution of density fluctuations computed from first principles since the end of inflation till today. The halo radius r_0 is computed in…

Consider the Hales-Jewett theorem. The $k$-dimensional version of it tells us that the combinatorial space $\mathcal{U}_{M, \Lambda} = \{ \eta \mid \eta: M \to \Lambda \}$ has, under suitable assumptions, monochromatic $k$-dimensional…

The integer convex hull $I(H_N)$ of the set $H_N=\{(x,y)\in \mathbb{R}^2: xy\ge N\}$ is the convex hull of the lattice points in $H_N$. The vertices of $I(H_N)$ lie in the square $[1,N]^2$. Improving on a recent result of Alc\'antara et al.…

Let X be a set definable in a sharply o-minimal structure. We consider the problem of counting the number of points where X intersects algebraic varieties V over Q of dimension k < codim X, as a function of T := deg(V) + h(V), where h(V) is…

We explore the separability of point sets in the plane by a restricted-orientation convex hull, which is an orientation-dependent, possibly disconnected, and non-convex enclosing shape that generalizes the convex hull. Let $R$ and $B$ be…

The Separating Hyperplane theorem is a fundamental result in Convex Geometry with myriad applications. Our first result, Random Separating Hyperplane Theorem (RSH), is a strengthening of this for polytopes. $\rsh$ asserts that if the…

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…

In a recent paper with Thomas Hoffmann-Ostenhof, we proved that the number of critical points in the boundary set of a k-minimal partition tends to infinity as k tends to infinity. In this note, we show that this number increases linearly…

A $(k,\ell)$-partition is a set partition which has $\ell$ blocks each of size $k$. Two uniform set partitions $P$ and $Q$ are said to be partially $t$-intersecting if there exist blocks $P_{i}$ in $P$ and $Q_{j}$ in $Q$ such that $\left|…

What is the smallest number of pieces that you can cut an n-sided regular polygon into so that the pieces can be rearranged to form a rectangle? Call it r(n). The rectangle may have any proportions you wish, as long as it is a rectangle.…

Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…