English
Related papers

Related papers: A note on Borsuk's problem in Minkowski spaces

200 papers

In 2013, Sun conjectured that the partition function $p(n)$ is never a perfect power for $n \geq 2$. Building on this, Merca, Ono, and Tsai recently observed that for any fixed integers $d \geq 0$ and $k \geq 2$, there appear to be only…

Number Theory · Mathematics 2026-01-27 Summer Haag , Praneel Samanta , Swati , Holly Swisher , Stephanie Treneer , Robin Visser

In 1999, Katona and Kierstead conjectured that if a $k$-uniform hypergraph $\cal H$ on $n$ vertices has minimum co-degree $\lfloor \frac{n-k+3}{2}\rfloor$, i.e., each set of $k-1$ vertices is contained in at least $\lfloor…

Combinatorics · Mathematics 2022-10-14 Guanwu Liu , Xiaonan Liu

We construct a map from $d|1$-dimensional Euclidean field theories to complexified K-theory when $d=1$ and complex analytic elliptic cohomology when $d=2$. This provides further evidence for the Stolz--Teichner program, while also…

Algebraic Topology · Mathematics 2023-08-02 Daniel Berwick-Evans

The notion of age of elements of complex linear groups was introduced by M. Reid and is of importance in algebraic geometry, in particular in the study of crepant resolutions and of quotients of Calabi-Yau varieties. In this paper, we solve…

Group Theory · Mathematics 2010-09-15 Robert Guralnick , Pham Huu Tiep

We solve the following problem of Z. F\"uredi, J. C. Lagarias and F. Morgan [FLM]: Is there an upper bound polynomial in $n$ for the largest cardinality of a set S of unit vectors in an n-dimensional Minkowski space (or Banach space) such…

Metric Geometry · Mathematics 2007-07-23 Konrad J Swanepoel

The aim of this paper is to provide the results that answer the Kuratowski problem posed in 1935 concerning the existence of nonmeasurable sets. The Kuratowski problem was considered for partitions, here we provide a generalization to…

Logic · Mathematics 2023-03-30 Joanna Jureczko

We prove that a bounded open set U in Euclidean n-space has k-width less than C(n) Volume(U)^{k/n}. Using this estimate, we give lower bounds for the k-dilation of degree 1 maps between certain domains in Euclidean space. In particular, we…

Differential Geometry · Mathematics 2007-05-23 Larry Guth

A finite set X in the d-dimensional Euclidean space is called an s-distance set if the set of Euclidean distances between any two distinct points of X has size s. Larman--Rogers--Seidel proved that if the cardinality of a two-distance set…

Metric Geometry · Mathematics 2011-02-01 Hiroshi Nozaki

We review the relationship between discrete groups of symmetries of Euclidean three-space, constructions in algebraic geometry around Kleinian singularities including versions of Hilbert and Quot schemes, and their relationship to…

Algebraic Geometry · Mathematics 2024-10-24 Lukas Bertsch , Ádám Gyenge , Balázs Szendrői

We obtain the first strong coresets for the $k$-median and subspace approximation problems with sum of distances objective function, on $n$ points in $d$ dimensions, with a number of weighted points that is independent of both $n$ and $d$;…

Data Structures and Algorithms · Computer Science 2022-04-15 Christian Sohler , David P. Woodruff

Around the early 2000-s, Bourgain, Katz and Tao introduced an arithmetic approach to study Kakeya-type problems. They showed that the Euclidean Kakeya conjecture follows from a natural problem in additive combinatorics, now referred to as…

Combinatorics · Mathematics 2024-11-21 Cosmin Pohoata , Dmitrii Zakharov

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

Combinatorics · Mathematics 2021-03-16 Boris Bukh , Ting-Wei Chao , Ron Holzman

A generalization of the Borsuk-Ulam theorem to Stiefel manifolds is considered. This theorem is applied to derive bounds on $d$ that guarantee-for a given set of $m$ measures in $\mathbb{R}^d$-the existence of $k$ mutually orthogonal…

Algebraic Topology · Mathematics 2026-05-26 Oleg R. Musin

This paper considers coresets for the robust $k$-medians problem with $m$ outliers, and new constructions in various metric spaces are obtained. Specifically, for metric spaces with a bounded VC or doubling dimension $d$, the coreset size…

Data Structures and Algorithms · Computer Science 2025-07-16 Lingxiao Huang , Zhenyu Jiang , Yi Li , Xuan Wu

A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…

Combinatorics · Mathematics 2023-12-20 Hiroshi Nozaki , Masashi Shinohara , Sho Suda

The Minkowski sum and Minkowski product can be considered as the addition and multiplication of subsets of $\mathbb{R}$. If we consider a compact subset $K\subseteq[0,1]$ and a power series $f$ which is absolutely convergent on $[0,1]$,…

Classical Analysis and ODEs · Mathematics 2020-05-07 Donát Nagy

Starting with assumptions both simple and natural from "physical" point of view we present a direct construction of transformations preserving wide class of (anti)commutation relations which describe Euclidean/Minkowski superspace…

High Energy Physics - Theory · Physics 2015-06-03 C. Gonera , M. Wodzislawski

We are considering typed hierarchies of total, continuous functionals using complete, separable metric spaces at the base types. We pay special attention to the so called Urysohn space constructed by P. Urysohn. One of the properties of the…

Logic in Computer Science · Computer Science 2015-07-01 Dag Normann

There are many distance-based methods for classification and clustering, and for data with a high number of dimensions and a lower number of observations, processing distances is computationally advantageous compared to the raw data matrix.…

Methodology · Statistics 2020-06-25 Christian Hennig