English
Related papers

Related papers: Cube packings in Euclidean spaces

200 papers

We construct and study the space C(\R^d,n) of all partitions of \R^d into n non-empty open convex regions (n-partitions). A representation on the upper hemisphere of an n-sphere is used to obtain a metric and thus a topology on this space.…

Metric Geometry · Mathematics 2021-11-30 Emerson León , Günter M. Ziegler

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

Given a nowheredense closed subset $X$ of a metrizable compact space $\tx$, we characterize the dimension of $X$ in terms of the multiplicity of the canonicals covers of the complementary of $X$, specially in some particular cases, like…

General Topology · Mathematics 2013-06-25 Jesús P. Moreno-Damas

We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…

Metric Geometry · Mathematics 2023-10-10 Naser T. Sardari , Masoud Zargar

The conditions for cubic equations, to have 3 real roots and 2 of the roots lie in the closed interval $[-1, 1]$ are given. These conditions are visualized. This question arises in physics in e.g. the theory of tops.

Numerical Analysis · Mathematics 2025-01-14 Helmut Ruhland

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

We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packings are in fact optimal. When applied to the previously…

Metric Geometry · Mathematics 2007-05-23 David W. Boll , Jerry Donovan , Ronald L. Graham , Boris D. Lubachevsky

In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…

Metric Geometry · Mathematics 2013-12-10 Zakhar Ovsyannikov

The main problem considered in this paper is construction and theoretical study of efficient $n$-point coverings of a $d$-dimensional cube $[-1,1]^d$. Targeted values of $d$ are between 5 and 50; $n$ can be in hundreds or thousands and the…

Statistics Theory · Mathematics 2020-06-05 Jack Noonan , Anatoly Zhigljavsky

The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…

Computational Geometry · Computer Science 2014-01-03 Mabel Iglesias-Ham , Michael Kerber , Caroline Uhler

We analyze the general problem of determining optimally dense packings, in a Euclidean or hyperbolic space, of congruent copies of some fixed finite set of bodies. We are strongly guided by examples of aperiodic tilings in Euclidean space…

Metric Geometry · Mathematics 2018-07-11 Lewis Bowen , Charles Holton , Charles Radin , Lorenzo Sadun

Given a poset $P$, a family $\mathcal{S}=\{S_x:x\in P\}$ of sets indexed by the elements of $P$ is called an inclusion representation of $P$ if $x\leqslant y$ in $P$ if and only if $S_x\subseteq S_y$. The cube height of a poset is the least…

Combinatorics · Mathematics 2025-10-02 Paul Bastide , Jędrzej Hodor , Hoang La , William T. Trotter

A $q$-covering design $\mathbb{C}_q(n, k, r)$, $k \ge r$, is a collection $\mathcal X$ of $(k-1)$-spaces of $\mathrm{PG}(n-1, q)$ such that every $(r-1)$-space of $\mathrm{PG}(n-1, q)$ is contained in at least one element of $\mathcal X$ .…

Combinatorics · Mathematics 2019-04-30 Francesco Pavese

We provide a tight result for a fundamental problem arising from packing disks into a circular container: The critical density of packing disks in a disk is 0.5. This implies that any set of (not necessarily equal) disks of total area…

Computational Geometry · Computer Science 2019-03-20 Sándor P. Fekete , Phillip Keldenich , Christian Scheffer

In this paper we obtain new lower bounds for the upper box dimension of $\alpha\beta$ sets. As a corollary of our main result, we show that if $\alpha$ is not a Liouville number and $\beta$ is a Liouville number, then the upper box…

Dynamical Systems · Mathematics 2021-02-12 Simon Baker

This paper is a continuation of the papers [2,3,4,5,6]. In this paper the osculating spaces of arbitrary order of a manifold embedded in Euclidean space are considered. A better estimation of their dimensions as well as the description of…

General Mathematics · Mathematics 2025-01-28 Kostadin Trencevski

Following Ghomi and Tabachnikov we study topological obstructions to totally skew embeddings of a smooth manifold M in Euclidean spaces. This problem is naturally related to the question of estimating the geometric dimension of the stable…

Algebraic Topology · Mathematics 2010-11-23 Djordje Baralic , Branislav Prvulovic , Gordana Stojanovic , Sinisa Vrecica , Rade Zivaljevic

Yudin's lower bound for the spherical designs is generalized to the cubature formulas on the projective spaces over a field K, where K can be R, C, or H (the field of quaternions), and thus to isometric embeddings of l_2 into l_p with p an…

Combinatorics · Mathematics 2007-05-23 Yuri Lyubich

We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an…

Data Structures and Algorithms · Computer Science 2009-03-16 Rolf Harren , Rob van Stee

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