Related papers: An elementary proof of borsuk theorem

In recent work by Isett (arXiv:1211.4065), and later by Buckmaster, De Lellis, Isett and Sz\'ekelyhidi Jr. (arXiv:1302.2815), iterative schemes where presented for constructing solutions belonging to the H\"older class $C^{1/5-\epsilon}$ of…

We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…

We demonstrate counterexamples to Wilmshurst's conjecture on the valence of harmonic polynomials in the plane, and we conjecture a bound that is linear in the analytic degree for each fixed anti-analytic degree. Then we initiate a…

In this paper we investigate three unsolved conjectures in geometric combinatorics, namely Falconer's distance set conjecture, the dimension of Furstenburg sets, and Erdos's ring conjecture. We formulate natural $\delta$-discretized…

These informal notes, not intended for publication, provide an approach to the Borsuk--Ulam theorem via Stokes' theorem, in a similar spirit to Lima's proof of the Brouwer fixed point theorem. They are intended to be accessible to anyone…

The union-closed sets conjecture, attributed to P\'eter Frankl from 1979, states that for any non-empty finite union-closed family of finite sets not consisting of only the empty set, there is an element that is in at least half of the sets…

The bellows conjecture claims that the volume of any flexible polyhedron of dimension 3 or higher is constant during the flexion. The bellows conjecture was proved for flexible polyhedra in the Euclidean spaces of dimensions 3 and higher,…

Two digraphs of order $n$ are said to pack if they can be found as edge-disjoint subgraphs of the complete digraph of order $n$. It is well established that if the sum of the sizes of the two digraphs is at most $2n-2$, then they pack, with…

A nonlinear version of Roth's theorem states that dense sets of integers contain configurations of the form $x$, $x+d$, $x+d^2$. We obtain a multidimensional version of this result, which can be regarded as a first step towards…

In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…

We show that in $\mathbb{R}^d$ there are purely unrectifiable sets of Hausdorff (and even box counting) dimension $d-1$ which are not tube null, settling a question of Carbery, Soria and Vargas, and improving a number of results by the same…

This paper is an extension program of the notion of circle of partition developed in our first paper \cite{CoP}. As an application we prove the Erd\H{o}s-Tur\'{a}n additive base conjecture.

After a Hessian computation, we quickly prove the 3D simplex mean width conjecture using classical methods. Then, we generalize some components to $d$ dimensions.

We give a simple, short and self-contained presentation of Bourgain's discretised projection theorem from 2010, which is a fundamental tool in many recent breakthroughs in geometric measure theory, harmonic analysis, and homogeneous…

Let $X\subset\mathbb P^4$ be a very general hypersurface of degree $d\ge6$. Griffiths and Harris conjectured in 1985 that the degree of every curve $C\subset X$ is divisible by $d$. Despite substantial progress by Koll\'ar in 1991, this…

Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…

In 1999, K. Bezdek posed a conjecture stating that among all convex bodies in $\mathbb R^3$, ellipsoids and bodies of revolution are characterized by the fact that all their planar sections have an axis of reflection. We prove Bezdek's…

We prove two conjectures in this paper. The first conjecture is by Lund, Pham and Thu: Given a Borel set $A\subset \mathbb{R}^n$ such that $\dim A\in (k,k+1]$ for some $k\in\{1,\dots,n-1\}$. For $0<s<k$, we have \[ \text{dim}(\{y\in…

Stein proposed the following conjecture: if the edge set of $K_{n,n}$ is partitioned into $n$ sets, each of size $n$, then there is a partial rainbow matching of size $n-1$. He proved that there is a partial rainbow matching of size…

Let $L(n,d)$ denote the minimum possible number of leaves in a tree of order $n$ and diameter $d.$ In 1975 Lesniak gave the lower bound $B(n,d)=\lceil 2(n-1)/d\rceil$ for $L(n,d).$ When $d$ is even, $B(n,d)=L(n,d).$ But when $d$ is odd,…