English
Related papers

Related papers: Borsuk's partition problem in four-dimensional $\e…

200 papers

We show that whenever a separable subset $S$ of a complete metric space $X$ admits a $d$-dimensional weak tangent field, the set $S$ is close to being $d$-dimensional in the following sense. Whenever $\mu$ is a Borel finite measure on $X$…

Metric Geometry · Mathematics 2026-04-20 Jakub Takáč

Given an arbitrary set of high dimensional points in $\ell_1$, there are known negative results that preclude the possibility of always mapping them to a low dimensional $\ell_1$ space while preserving distances with small multiplicative…

Data Structures and Algorithms · Computer Science 2024-04-09 Moses Charikar , Spencer Compton , Chirag Pabbaraju

We study the problem of partitioning the unit cube $[0,1]^n$ into $c$ parts so that each $d$-dimensional axis-parallel projection has small volume. This natural combinatorial/geometric question was first studied by Kopparty and Nagargoje…

Computational Complexity · Computer Science 2024-10-30 Swastik Kopparty , Harry Sha

In a convex n-gon, let d[1] > d[2] > ... denote the set of all distances between pairs of vertices, and let m[i] be the number of pairs of vertices at distance d[i] from one another. Erdos, Lovasz, and Vesztergombi conjectured that m[1] +…

Combinatorics · Mathematics 2011-08-01 Filip Morić , David Pritchard

In this paper we study constrained subspace approximation problem. Given a set of $n$ points $\{a_1,\ldots,a_n\}$ in $\mathbb{R}^d$, the goal of the {\em subspace approximation} problem is to find a $k$ dimensional subspace that best…

Data Structures and Algorithms · Computer Science 2025-04-30 Aditya Bhaskara , Sepideh Mahabadi , Madhusudhan Reddy Pittu , Ali Vakilian , David P. Woodruff

We consider the method of alternating (metric) projections for pairs of linear subspaces of finite dimensional Banach spaces. We investigate the size of the set of points for which this method converges to the metric projection onto the…

Functional Analysis · Mathematics 2023-06-01 Christian Bargetz , Franz Luggin

The article is a survey related to a classical unsolved problem in Banach space theory, appearing in Banach's famous book in 1932, and known as the Mazur rotations problem. Although the problem seems very difficult and rather abstract, its…

Functional Analysis · Mathematics 2021-04-07 Félix Cabello Sánchez , Valentin Ferenczi , Beata Randrianantoanina

In this paper, we give improved bounds on the Hausdorff dimension of pinned distance sets of planar sets with dimension strictly less than one. As the planar set becomes more regular (i.e., the Hausdorff and packing dimension become…

Classical Analysis and ODEs · Mathematics 2025-04-01 Jacob B. Fiedler , D. M. Stull

In this paper we study the regularity of embeddings of finite--dimensional subsets of Banach spaces into Euclidean spaces. In 1999, Hunt and Kaloshin [Nonlinearity 12 1263-1275] introduced the thickness exponent and proved an embedding…

Functional Analysis · Mathematics 2019-10-07 Alexandros Margaris , James C. Robinson

The Generalised Baker-Schmidt Problem (1970) concerns the Hausdorff $f$-measure of the set of $\Psi$-approximable points on a nondegenerate manifold. We refine and extend our previous work [Int. Math. Res. Not. IMRN 2021, no. 12,…

Number Theory · Mathematics 2023-02-22 Mumtaz Hussain , Johannes Schleischitz

We show that for every large enough integer $N$, there exists an $N$-point subset of $L_1$ such that for every $D>1$, embedding it into $\ell_1^d$ with distortion $D$ requires dimension $d$ at least $N^{\Omega(1/D^2)}$, and that for every…

Metric Geometry · Mathematics 2011-12-22 Oded Regev

The maximum cut problem for a quintic del Pezzo surface ${\rm Bl}_{4}(\mathbb{P}^2)$ asks: Among all partitions of the 10 exceptional curves into two disjoint sets, what is the largest possible number of pairwise intersections? In this…

Combinatorics · Mathematics 2012-07-18 Mauricio Junca Mauricio Velasco

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

If $X$ is an infinite-dimensional uniform algebra, if $X$ has the Daugavet property or if $X$ is a proper $M$-embedded space, every relatively weakly open subset of the unit ball of the Banach space $X$ is known to have diameter 2, i.e.,…

Functional Analysis · Mathematics 2013-04-29 Trond Abrahamsen , Vegard Lima , Olav Nygaard

A subset of a Banach space is called equilateral if the distances between any two of its distinct elements are the same. It is proved that there exist non-separable Banach spaces (in fact of density continuum) with no infinite equilateral…

Functional Analysis · Mathematics 2021-05-25 Piotr Koszmider , Hugh Wark

We characterize the unique minimizer of the three-dimensional double-bubble problem with respect to the $\ell_1$-norm for volume ratios between $1/2$ and $2$.

Analysis of PDEs · Mathematics 2024-03-29 Manuel Friedrich , Wojciech Górny , Ulisse Stefanelli

Denote by Q_d the d-dimensional hypercube. Addressing a recent question we estimate the number of ways the vertex set of Q_d can be partitioned into vertex disjoint smaller cubes. Among other results, we prove that the asymptotic order of…

Combinatorics · Mathematics 2025-12-01 Noga Alon , Jozsef Balogh , Vladimir N. Potapov

We obtain new lower bounds on the Hausdorff dimension of distance sets and pinned distance sets of planar Borel sets of dimension slightly larger than $1$, improving recent estimates of Keleti and Shmerkin, and of Liu in this regime. In…

Classical Analysis and ODEs · Mathematics 2018-11-09 Pablo Shmerkin

Let $P$ be a $d$-dimensional $n$-point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$ is $t$-tolerant if it remains a Tverberg partition after…

Computational Geometry · Computer Science 2015-05-28 Wolfgang Mulzer , Yannik Stein

We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…

Computational Geometry · Computer Science 2025-09-15 Jaehoon Chung , Kazuo Iwama , Chung-Shou Liao , Hee-Kap Ahn