Search arXiv⌕ Search

arXiv · 2610.36766

On surfaces, that fill the space

Abstract

The article is devoted to the construction of dimension-raising maps of cubes with the highest possible Holder exponent. In particular, a square-to-cube mapping with a Holder exponent of $2/3$ is constructed, which is a solution to the V.I.Arnold problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

E. V. Shchepin. 2026-10-27. On surfaces, that fill the space. https://arxiv.org/abs/2610.36766

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Every Extended Metric Space Is Isometrically Embeddable into the Gromov-Hausdorff Class

Let $\mathfrak{GH}$ denote the Gromov--Hausdorff class of isometry classes of nonempty metric spaces, equipped with the Gromov--Hausdorff extended pseudometric. We prove that every nonempty extended metric space is isometrically embeddable into $\mathfrak{GH}$. More precisely, for every nonempty extended metric space $X$, all image points may be represented by metrics on a common set of cardinality $\max\{\operatorname{dens} X,\aleph_0\}$. The main ingredient is a realization theorem for function spaces: for every nonempty set $I$, the space of all real-valued functions on $I$, endowed with the uniform extended metric, can be realized as a family of metrics on a fixed underlying set. Under this realization, the Gromov--Hausdorff distance agrees exactly with the uniform extended distance, including the case of infinite distance. The resulting metric spaces are complete, uniformly discrete, and unbounded, and have cardinality $\max\{|I|,\aleph_0\}$. If $I$ is countable, they may moreover be chosen proper and of bounded geometry. As further consequences, we obtain sharp cardinality results for clouds and universality results for cardinality-restricted parts of $\mathfrak{GH}$ and for spheres in the associated zero-distance quotients.

math.MG↗

New upper bounds for average kissing numbers

A packing of balls in Euclidean space is a set of balls with non-overlapping interiors. For a finite packing of balls, its average contact number is the average number of balls tangent to a ball in this packing, that is, twice the total number of tangencies divided by the number of balls. The average kissing number of the space is defined as the supremum of average contact numbers over all finite ball packings. In this paper, we present a new semidefinite programming approach to average kissing numbers and improve upon known upper bounds in all dimensions \(3\) through \(30\). In particular, we provide the first improvements to the upper bounds in dimensions \(10\) through \(30\) obtained from kissing numbers. We also fully solve the average kissing number problem in dimensions \(8\) and \(24\) by showing that the average kissing numbers coincide with the kissing numbers, 240 and 196560, respectively. These values are limits of average contact numbers of finite subpackings from the \(E_8\) and Leech lattices.

math.MG↗

Non-separable arrangements of convex bodies revisited

A problem posed by Erdős in 1945 initiated the study of non-separable arrangements of convex bodies. A finite collection of convex bodies in Euclidean $d$-space is called a non-separable family (or NS-family) if every hyperplane intersecting their convex hull also intersects at least one member of the family. Recent work has focused on minimal coverings of NS-families consisting of positive homothetic convex bodies. In this paper, we strengthen these results by establishing their stability analogues and analyze weakly non-separable families of convex polytopes. We also examine weakly $k$-impassable families of convex $d$-polytopes for $0<k<d-1$ and study tightness of NS-lattice arrangements.

math.MG↗