English
Related papers

Related papers: On the multiple Borsuk numbers of sets

200 papers

We prove that for $1\le k<d$, if $E$ is a Borel subset of $\mathbb{R}^d$ of Hausdorff dimension strictly larger than $k$, the set of $(k+1)$-volumes determined by $k+2$ points in $E$ has positive one-dimensional Lebesgue measure. In the…

Classical Analysis and ODEs · Mathematics 2025-03-31 Pablo Shmerkin , Alexia Yavicoli

We say a map f:X \to Y is an \epsilon-embedding if it is continuous and the diameter of the fibres is less than \epsilon. This type of maps is used in the notion of Urysohn width (sometimes referred to as Alexandrov width), a_n(X). It is…

Metric Geometry · Mathematics 2021-01-05 Antoine Gournay

The point sets of all known optimal rectilinear drawings of $K_n$ share an unmistakeable clustering property, the so--called {\em 3--decomposability}. It is widely believed that the underlying point sets of all optimal rectilinear drawings…

Combinatorics · Mathematics 2007-12-28 Bernardo Abrego , Silvia Fernandez-Merchant , Jesus Leanos , Gelasio Salazar

A map from a manifold to a Euclidean space is said to be k-regular if the image of any distinct k points are linearly independent. In this paper, we give some lower bounds of the dimension of the ambient Euclidean space for complex…

Algebraic Topology · Mathematics 2016-10-05 Shiquan Ren

We give the sharp lower bound of the volume product of three dimensional convex bodies which are invariant under two kinds of discrete subgroups of $O(3)$ of order four. We also characterize the convex bodies with the minimal volume product…

Metric Geometry · Mathematics 2024-10-02 Hiroshi Iriyeh , Masataka Shibata

Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…

Combinatorics · Mathematics 2010-01-07 Jan Kratochvil , Boris Horvat , Tomaz Pisanski

A subset $A$ of the $k$-dimensional grid $\{1,2, \cdots, N\}^k$ is called $k$-dimensional corner-free if it does not contain a set of points of the form $\{ a \} \cup \{ a + de_i : 1 \leq i \leq k \}$ for some $a \in \{1,2, \cdots, N\}^k$…

Combinatorics · Mathematics 2022-03-04 Younjin Kim

For a set $S$ of (positive definite and integral) quadratic forms with bounded rank, a quadratic form $f$ is called $S$-universal if it represents all quadratic forms in $S$. A subset $S_0$ of $S$ is called an $S$-universality criterion set…

Number Theory · Mathematics 2020-09-10 Kyoungmin Kim , Jeongwon Lee , Byeong-Kweon Oh

Let $B_n$ be the $n$-dimensional unit ball given by the inequality $\|x\|\leq 1$, where $\|x\|$ is the standard Euclid norm in ${\mathbb R}^n$. For an $n$-dimensional nondegenerate simplex $S$, we denote by $E$ the ellipsoid of minimum…

Metric Geometry · Mathematics 2026-05-22 Mikhail Nevskii

The present work considers the properties of generally convex sets in the $n$-dimensional real Euclidean space $\mathbb{R}^n$, $n>1$, known as weakly $m$-convex, $m=1,2,\ldots,n-1$. An open set of $\mathbb{R}^n$ is called weakly $m$-convex…

Metric Geometry · Mathematics 2021-11-03 Tetiana Osipchuk

The $k$-median and $k$-means clustering objectives are classic objectives for modeling clustering in a metric space. Given a set of points in a metric space, the goal of the $k$-median (resp. $k$-means) problem is to find $k$ representative…

Computational Geometry · Computer Science 2026-03-11 Vincent Cohen-Addad , Karthik C. S. , David Saulpic , Chris Schwiegelshohn

We show that directed minimal cones in (n+1)-dimensional Euclidean space which have at most one singularity are - besides the trivial cases: empty set, whole space - half spaces. Using blow-up techniques, this result can be used to get…

Analysis of PDEs · Mathematics 2007-05-23 Oliver C. Schnuerer

Constructing small-sized coresets for various clustering problems in different metric spaces has attracted significant attention for the past decade. A central problem in the coreset literature is to understand what is the best possible…

Data Structures and Algorithms · Computer Science 2024-03-14 Lingxiao Huang , Jian Li , Xuan Wu

The aim of this paper is to study the topological properties of algebraic sets with zero divisors. We impose a subbasic topology on the set of proper ideals of a $k$-algebra and this new ``$k$-space'' becomes a generalization of the…

Algebraic Geometry · Mathematics 2024-10-02 Amartya Goswami

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áč

Multidimensional Scaling (MDS) is one of the most popular methods for dimensionality reduction and visualization of high dimensional data. Apart from these tasks, it also found applications in the field of geometry processing for the…

Computational Geometry · Computer Science 2017-09-12 Amit Boyarski , Alex M. Bronstein , Michael M. Bronstein

A set of points in d-dimensional Euclidean space is almost equidistant if among any three points of the set, some two are at distance 1. We show that an almost-equidistant set in $\mathbb{R}^d$ has cardinality $O(d^{4/3})$.

Combinatorics · Mathematics 2019-03-27 Andrey Kupavskii , Nabil H. Mustafa , Konrad J. Swanepoel

In this paper we fill in a fundamental gap in the extremal bootstrap percolation literature, by providing the first proof of the fact that for all $d \geq 1$, the size of the smallest percolating sets in $d$-neighbour bootstrap percolation…

Combinatorics · Mathematics 2019-07-04 Michał Przykucki , Thomas Shelton

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

Probability · Mathematics 2021-03-03 Steven D. Hoehner , Carsten Schuett , Elisabeth M. Werner

The $R$-hulloid, in the Euclidean space $\mathbb{R}^3$, of the set of vertices $V$ of a tetrahedron $T$ is the minimal closed set containing $V$ such that its complement is the union of open balls of radius $R$. When $R$ is greater than the…

Metric Geometry · Mathematics 2026-01-29 Marco Longinetti , Simone Naldi , Adriana Venturi