English
Related papers

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

200 papers

Using the $ku$- and $BP$-theoretic versions of Astey's cobordism obstruction for the existence of smooth Euclidean embeddings of stably almost complex manifolds, we prove that, for $e$ greater than or equal to $\alpha(n)$--the number of…

Algebraic Topology · Mathematics 2009-06-08 Jesus Gonzalez , Peter Landweber , Thomas Shimkus

In this paper a convergent series expansion is constructed to solve the prescribed mean curvature equation for n-dimensional hypersurfaces in n+1 dimensional Euclidean or Minkowskian space(time) which are graphs of a smooth real function u,…

Analysis of PDEs · Mathematics 2015-08-18 Holly Carley , Michael Kiessling

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Combinatorics · Mathematics 2025-12-02 Nikolai Avdeev

Let $(X,d)$ be a finite metric space with $|X|=n$. For a positive integer $k$ we define $A_k(X)$ to be the quotient set of all $k$-subsets of $X$ by isometry, and we denote $|A_k(X)|$ by $a_k$. The sequence $(a_1,a_2,\ldots,a_{n})$ is…

Combinatorics · Mathematics 2018-02-22 Mitsugu Hirasaka , Masashi Shinohara

Finding the maximum cardinality of a $2$-distance set in Euclidean space is a classical problem in geometry. Lison\v{e}k in 1997 constructed a maximum $2$-distance set in $\mathbb R^8$ with $45$ points. That $2$-distance set constructed by…

Combinatorics · Mathematics 2022-11-07 Eiichi Bannai , Etsuko Bannai , Chin-Yen Lee , Ziqing Xiang , Wei-Hsuan Yu

A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a finite set of balls in Euclidean space is repositioned so that…

Metric Geometry · Mathematics 2011-09-29 Karoly Bezdek

We establish pointwise and distributional fractal tube formulas for a large class of compact subsets of Euclidean spaces of arbitrary dimensions. These formulas are expressed as sums of residues of suitable meromorphic functions over the…

Mathematical Physics · Physics 2018-09-13 Michel L. Lapidus , Goran Radunović , Darko Žubrinić

In 3-dimensional Euclidean space, Scherk second surfaces are singly periodic embedded minimal surfaces with four planar ends. In this paper, we obtain a natural generalization of these minimal surfaces in any higher dimensional Euclidean…

Differential Geometry · Mathematics 2007-05-23 Frank Pacard

$\newcommand{\Re}{\mathbb{R}}$We study the minWSPD problem of computing the minimum-size well-separated pairs decomposition of a set of points, and show constant approximation algorithms in low-dimensional Euclidean space and doubling…

Computational Geometry · Computer Science 2026-02-04 Kevin Buchin , Jacobus Conradi , Sariel Har-Peled , Antonia Kalb , Abhiruk Lahiri , Lukas Plätz , Carolin Rehs , Sampson Wong

In 1988, Kalai extended a construction of Billera and Lee to produce many triangulated (d-1)-spheres. In fact, in view of upper bounds on the number of simplicial d-polytopes by Goodman and Pollack, he derived that for every dimension d>=5,…

Combinatorics · Mathematics 2007-05-23 Julian Pfeifle

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

The celebrated Dvoretzky theorem asserts that every $N$-dimensional convex body admits central sections of dimension $d = \Omega(\log N)$, which is nearly spherical. For many instances of convex bodies, typically unit balls with respect to…

Metric Geometry · Mathematics 2026-03-02 Stanislaw Szarek , Pawel Wolff

For Euclidean space ($\ell_2$), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss, with a host of known applications. Here, we consider the problem of dimension reduction for all $\ell_p$ spaces $1 \le p…

Computational Geometry · Computer Science 2015-12-08 Yair Bartal , Lee-Ad Gottlieb

Composition principles for reduced moduli are extended to the case of domains in the $n$-dimensional Euclidean space, $n>2$. As a consequence analogues of extremal decomposition theorems of Kufarev, Dubinin and Kirillova in the planer case…

Complex Variables · Mathematics 2015-11-06 Karina Gulyaeva , Sergei Kalmykov , Elena Prilepkina

It is well known that, whenever $k$ divides $n$, the complete $k$-uniform hypergraph on $n$ vertices can be partitioned into disjoint perfect matchings. Equivalently, the set of $k$-subsets of an $n$-set can be partitioned into parallel…

Combinatorics · Mathematics 2020-07-24 Yeow Meng Chee , Tuvi Etzion , Han Mao Kiah , Alexander Vardy , Chengmin Wang

We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…

Computational Geometry · Computer Science 2021-10-08 Piotr Indyk , Tal Wagner

For fixed $k$ we prove exponential lower bounds on the equilateral number of subspaces of $\ell_{\infty}^n$ of codimension $k$. In particular, we show that if the unit ball of a normed space of dimension $n$ is a centrally symmetric…

Combinatorics · Mathematics 2020-05-12 Nora Frankl

In a recent paper, Chan, \L aba, and Pramanik investigated geometric configurations inside thin subsets of the Euclidean set possessing measures with Fourier decay properties. In this paper we ask which configurations can be found inside…

Classical Analysis and ODEs · Mathematics 2016-07-06 Mike Bennett , Alex Iosevich , Krystal Taylor

A set in d dimensional Euclidean space with d larger than 2 having Hausdorff dimension at least d/2 must have distance set with Hausdorff dimension strictly greater than 1/2.

Classical Analysis and ODEs · Mathematics 2007-05-23 Nets Hawk Katz

Let $P_{d}(n)$ denote the number of $n \times \ldots \times n$ $d$-dimensional partitions with entries from $\left\{0,1,\ldots,n\right\}$. Building upon the works of Balogh-Treglown-Wagner and Noel-Scott-Sudakov, we show that when $d \to…

Combinatorics · Mathematics 2024-02-28 Cosmin Pohoata , Dmitriy Zakharov