English
Related papers

Related papers: An elementary proof of borsuk theorem

200 papers

Monsky's theorem from 1970 states that a square cannot be dissected into an odd number of triangles of the same area, but it does not give a lower bound for the area differences that must occur. We extend Monsky's theorem to "constrained…

Metric Geometry · Mathematics 2021-05-11 Jean-Philippe Labbé , Günter Rote , Günter M. Ziegler

We prove several results of the following type: any $d$ measures in $\mathbb R^d$ can be partitioned simultaneously into $k$ equal parts by a convex partition (this particular result is proved independently by Pablo Sober\'on). Another…

Metric Geometry · Mathematics 2013-06-17 R. N. Karasev

In 1971 Trotter conjectured that every finite poset on at least $3$ points has a pair whose removal does not decrease the dimension by more than $1$. In 1992 Brightwell and Scheinerman introduced fractional dimension of posets, and they…

Combinatorics · Mathematics 2014-02-03 Csaba Biró , Peter Hamburger , Attila Pór

It is shown that $m$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with minimum Gaussian surface area must be $(m-1)$-dimensional. This follows from a second variation argument using infinitesimal translations.…

Functional Analysis · Mathematics 2021-07-13 Steven Heilman

A Besicovitch set is a subset of $\R^d$ that contains a unit line segment in every direction and the famous Kakeya conjecture states that Besicovitch sets should have full dimension. We provide a number of results in support of this…

Classical Analysis and ODEs · Mathematics 2018-04-26 Jonathan M. Fraser , Eric J. Olson , James C. Robinson

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

Combinatorics · Mathematics 2007-05-23 Christian Haase , Günter M. Ziegler

The well know theorem of Tverberg states that if n > (d+1)(r-1) then one can partition any set of n points in R^d to r disjoint subsets whose convex hulls have a common point. The numbers T(d,r) = (d + 1)(r - 1) + 1 are known as Tverberg…

Combinatorics · Mathematics 2014-09-11 Micha A. Perles , Moriah Sigron

Sendov's conjecture, which was first introduced in the last 50s, asserts that if all the zeros of a polynomial $p$ lie in the closed unit disk then for each zero there must be a critical point of $p$ within unit distance. This paper…

Complex Variables · Mathematics 2022-10-25 Stephen Drury , Minghua Lin

A well known consequence of the Borsuk-Ulam theorem is that if the $d$-dimensional sphere $S^d$ is covered with less than $d+2$ open sets, then there is a set containing a pair of antipodal points. In this paper we provide lower and upper…

Combinatorics · Mathematics 2014-12-17 Imre Bárány , Ruy Fabila-Monroy , Birgit Vogtenhuber

For positive integers $s$ and $L \geq 3$, Berkovich and Uncu (Ann. Comb. $23$ ($2019$) $263$--$284$) conjectured an inequality between the sizes of two closely related sets of partitions whose parts lie in the interval $\{s, \ldots, L+s\}$.…

Combinatorics · Mathematics 2021-08-16 Damanvir Singh Binner , Amarpreet Rattan

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

Combinatorics · Mathematics 2019-09-02 Archy Will He

A famous theorem of Dilworth asserts that any finite poset of width $k$ can be decomposed into $k$ chains. We study the following problem: given a Borel poset $P$ of finite width $k$, is it true that it can be decomposed into $k$ Borel…

Combinatorics · Mathematics 2020-04-07 Bartłomiej Bosek , Jarosław Grytczuk , Zbigniew Lonc

A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}^d$ of $n=T(d,r)=(d+1)(r-1)+1$ points can be partitioned into $r$ pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition…

Combinatorics · Mathematics 2017-05-17 Moshe White

Recently the problem of constructing a perfect Euler cuboid was related with three conjectures asserting the irreducibility of some certain three polynomials depending on integer parameters. In this paper a partial result toward proving the…

Number Theory · Mathematics 2011-09-13 Ruslan Sharipov

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…

Combinatorics · Mathematics 2020-02-25 Richard Montgomery , Alexey Pokrovskiy , Benny Sudakov

For $n \geq 2$ we construct a measurable subset of the unit ball in $\mathbb{R}^n$ that does not contain pairs of points at distance 1 and whose volume is greater than $(1/2)^n$ times the volume of the ball. This disproves a conjecture of…

Metric Geometry · Mathematics 2019-05-15 Fernando Mário de Oliveira Filho , Frank Vallentin

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 theorem of Harald Bohr (1914) states that if f is a holomorphic map from the unit disc into itself, then the sum of absolute values of its Taylor expansion is less than 1 for |z|<1/3. The bound 1/3 is optimal. This result has been…

Complex Variables · Mathematics 2009-04-09 Guy Roos

In 1951, Bang posed the affine plank conjecture, which remains open: If a convex body in $\mathbb{R}^d$ is covered by planks, then the total relative width of the planks is at least one. We prove a lower bound of $2/(1+\sqrt{d})$ for this…

Metric Geometry · Mathematics 2026-02-25 Egor Bakaev , Amir Yehudayoff

In 2002, Koh and Tay conjectured that every bridgeless graph of order $n\geq 5$ and size at least ${n\choose 2}-n+5$ has an orientation of diameter two. Later, Cochran, Czabarka, Dankelmann and Sz\'{e}kely proved this conjecture and asked…

Combinatorics · Mathematics 2025-08-26 Sopon Boriboon , Teeradej Kittipassorn