Skip to main content

Questions tagged [sphere-packing]

Filter by
Sorted by
Tagged with
25 votes
1 answer
1k views

The $D = 24$ kissing number is $196{,}560$, and the dimension of the smallest non-trivial complex representation of the Monster group is $196{,}883$. These two numbers are nearly but not quite equal, ...
0 votes
0 answers
49 views

To build aperiodic tilings, you can take a periodic tiling in a higher dimensional and use a "cut-and-project" to produce a tiling in a lower dimensional space. See app for Penrose tiling ...
1 vote
0 answers
87 views

Let $\alpha$ be an angle contained in $(0,\pi/2]$ -- to fix ideas, let $\alpha = \pi/3$. Then with $d > 1$ a positive integer, what is a minimal bound $M_d(\alpha)$ for the maximum number of ...
8 votes
1 answer
413 views

We are given the following packing of the flat torus with 25 circles below : Our goal is to compute the minimal polynomial of the corresponding circle diameter $l$. Using classical trigonometric ...
27 votes
2 answers
3k views

Apologies if this is a bit off-topic or if I'm just not doing the right searches. I asked the question on MSE a few days ago and didn't get an answer. I understand from the paper by Bill Casselman The ...
22 votes
1 answer
2k views

More precisely, in a regular sphere packing, either the HCP or FCC lattice packing, does there exist a line $L$ disjoint from every sphere, i.e., not touching any sphere? If so, one could "look ...
1 vote
0 answers
129 views

If by linear or semi-definite programming this number could be shown to be less than 24, then this could be a route to showing that the 24-cell (consisting of 12 antipodal pairs of spheres) is the ...
7 votes
1 answer
188 views

Let $L$ be the square or triangular lattice in the plane, with nearest neighbors having distance 1. Has anyone studied the problem of finding the maximum (okay, supremum) density achieved by a subset ...
5 votes
0 answers
226 views

Let $S$ be a unit-radius sphere in $\mathbb{R}^3$, and $c$ a cylinder of length $L$ and radius $r<2$. It appears to me that for $L \in [\sqrt{2},2]$ and "small" $r$, the optimal packing ...
18 votes
3 answers
745 views

I will describe the question first in 2D, but my interest is in $\mathbb{R}^3$. An electron $x$ will shoot from the origin along an initial vector $v$. You know the speed $|v|$ but not the direction. ...
5 votes
1 answer
284 views

Viazovska constructed magic functions via integral transforms of (quasi-)modular forms that gives a tight bound for linear programming bounds in 8 and 24 dimensions (with other mathematicians after ...
3 votes
2 answers
1k views

Today I attended a talk by Terence Tao, attended by (I'm guessing) probably at least a couple of thousand people, in which among other things he said it had been proved that no packing of spheres in ...
2 votes
1 answer
705 views

According to en.wikipedia.org, https://en.wikipedia.org/wiki/Kissing_number#Some_known_bounds It says the kissing numbers $K$ have lower bound $K_L$ and upper bound $K_S$: $$ K_L < K < K_U. $$ I ...
0 votes
1 answer
188 views

Let $S^1$ be the unit circle of radius $1$. For any $k\geq 1$, let the $k$-dimensional torus $T^k= \underbrace{S^1\times S^1\times\cdots\times S^1}_k$ be the $k$-fold self-Cartesian ...
6 votes
0 answers
162 views

Hamming-distance-4 binary codes have a very direct relationship to sphere packings. That's because we can identify the codewords with the cosets of $\mathbb{Z}^n/(2\mathbb{Z})^n$, and Hamming-distance-...
12 votes
2 answers
527 views

Question Let \begin{align*} \theta_2(q) & = \sum_{n=-\infty}^{\infty} q^{(n+1/2)^2} \\ \theta_3(q) & = \sum_{n=-\infty}^{\infty} q^{n^2} \\ \theta_4(q) & = \sum_{n=-\infty}^{\infty} (-1)^n ...
1 vote
1 answer
134 views

If I sample three points independently, uniformly at random on an $n$-dimensional sphere of radius $R$, what is the probability density function of their polar sine? More generally, for $k<n$ if I ...
2 votes
1 answer
529 views

Given a Barlow packing of $\mathbb{R}^n$ by balls with at most a finite number of different radii, the centers of the balls will form a Delone set in $\mathbb{R}^n.$ For a highest density sphere ...
1 vote
1 answer
186 views

I am working on a paper and quoted the following result from these lecture notes. Where can I find a reference to this result either in a book or a paper, that I can cite? (I looked on the course ...
3 votes
1 answer
182 views

Let $q$ be an positive integer and $F = \{0,1,\dots,q-1\}$, we define Hamming distance in $F^n$ between $x = (x_1, \dots, x_n), y = (y_1, \dots, y_n) \in F^n$ is the number of indices $i$ such that $...
35 votes
6 answers
9k views

This is a direct (and obvious) generalization of the recent MO question, "Covering disks with smaller disks": How many balls of radius $\frac{1}{2}$ are needed to cover completely a ball of ...
23 votes
1 answer
789 views

Let $v_i$ be $2n$ points in $\mathbf{R}^n$, with equal distance $|v_i|$ from the origin. Suppose that the convex hull of these points contains the unit ball. Is it known that $|v_i|\geq\sqrt{n}$? ...
8 votes
1 answer
652 views

After the groundbreaking work of Viazovska, now we have a proof for the optimal density of sphere packings in dimensions 8 and 24. Both packings emerge from very particular algebraic lattice ...
34 votes
3 answers
4k views

In a recent publication by the Ukrainian mathematician Maryna Viazovska the Kepler problem for dimension $8$ and $24$, namely the densest packing of spheres, was solved. Admittedly it is very ...
0 votes
0 answers
90 views

What is the values of the following integral: $$\int_{w \in S^{n-1}} e^{i\lambda< x,w >} dw.$$ where $\lambda\in\Bbb R, i^2=-1,x\in\Bbb R^n;<,>$ the inner product scalar on $\Bbb R^n$ ...
3 votes
1 answer
180 views

I'll first describe my problem in layman's terms. I have a map with $m$ countries and I want to color each country with a different color (this has nothing to do with the 4-color theorem). How do I ...
3 votes
0 answers
128 views

The simplicity of Chang and Wang's proof of Thue’s Theorem (link on arxiv) on circular packing took me by surprise. Have similar ideas been found helpful in other dimensions? For example, partition ...
5 votes
1 answer
382 views

Let $v,w \in S^{n-1}$ be two $n$ dimensional real vectors on sphere. Consider the following integral: $$ \int_{x \in S^{n-1}} \big|\langle x,v \rangle\big|\cdot\big|\langle x,w \rangle\big|\; dx. $$ ...
0 votes
0 answers
113 views

Let $k$, $m$ and $n$ be positive integers. Let $r$ be a positive real number. The $n$-th ordered $r$-disk configuration space on the Euclidean space $\mathbb{R}^{mk}$ is $$ F_r(\mathbb{R}^{mk},...
1 vote
0 answers
300 views

I placed four spheres of radius R at vertices of a tetrahedron of edge length 2R .When I calculated density I got 88.86.Actualy I wanted to calculate what is the maximum number of earth that can be ...
6 votes
1 answer
465 views

Within the context of mathematical biology, a sphere packing problem occurred to me. I must note that unlike the typical sphere packing problems, the variant I consider involves minimising the average ...
2 votes
1 answer
306 views

Looking for a simple upper-bound for the packing number of hamming cube, I'm led to consider the following. Fix $p \in (0,1/2]$. For a positive integer $n$, define $S_n(p) := \sum_{i=1}^{\lfloor np\...
3 votes
1 answer
893 views

The following problem came up in one of my research works. Suppose that $C$ denotes the positive face of the $d$-dimensional unit sphere surface, i.e. $$C := \{\mathbf{x} \in \mathbb{R}^d: x_1 >0,\...
2 votes
0 answers
232 views

I'm looking for references pertaining to the remark at the bottom of p.18 of Conway-Sloane, "Sphere Packings, Lattices and Groups" (3rd ed), henceforth referred to as "SPLG". First,...
8 votes
1 answer
314 views

I came across this question when I was discussing the rather wonderful Devil's Chessboard Problem with my colleague, Francis Hunt. We realised that there is a nice connection to a packing question in $...
16 votes
1 answer
604 views

I recently noticed an interesting fact which leads to a perhaps difficult question. If $n$ is a natural number, let $k_n$ be the smallest number $k$ such that an open ball of radius $k$ in a real ...
6 votes
0 answers
143 views

Does there exist a finite set of radii such that some aperiodic packing of the plane by disks of those radii is believed to achieve the maximal packing density (not achieved by any periodic packing)? ...
16 votes
4 answers
4k views

Consider the unit sphere $\mathbb{S}^d.$ Pick now some $\alpha$ (I am thinking of $\alpha \ll 1,$ but I don't know how germane this is). The question is: how many spherical caps of angular radius $\...
11 votes
2 answers
1k views

Sphere packing problem in $\mathbb R^n$ asks for the densest arrangement of non-overlapping spheres within $\mathbb R^n$. It is now know that the problem is solved at $n=8$ and $n=24$ using modular ...
35 votes
3 answers
2k views

How many nonoverlapping unit squares can (nonoverlappingly) touch one unit square? By "nonoverlapping" I mean: not sharing an interior point. By "touch" I mean: sharing a boundary point.   &...
1 vote
1 answer
525 views

I have been looking for litterature on results obtained by deep neural networks to find dense (and quite possibly non-lattice, perhaps even non-periodic) sphere packings, but I have not been too ...
2 votes
0 answers
75 views

I am confused about the proof of Corollary 4.2 in "Ball Packings in Spaces of Constant Curvature and the Simplicial Density Function". The point of confusion is equation 4.3, where Kellerhals states ...
13 votes
1 answer
796 views

I'm a physicist interested in the conformal bootstrap, one version of which was recently shown to have many similarities to the problem of sphere packing. Sphere packing in $\mathbf{R}^d$ has been ...
1 vote
1 answer
1k views

When one looks at the way cannon balls and oranges are normally packed by the military and by groceries, it seems intuively clear that there is no way anybody can pack these any tighter. However, it ...
8 votes
2 answers
1k views

Given a unit sphere (radius 1), I would like to know how many cones I can pack into this unit sphere. Restrictions: The top of the cone needs to be in the center of origin. The bottom of the cone ...
4 votes
0 answers
159 views

Let $A_d(n)$ be the largest number of points that can be packed on the $n$-unit sphere, such that every point is at least $d$ apart. Compare with, for instance, https://arxiv.org/abs/1507.03631 When ...
12 votes
5 answers
2k views

The Koebe–Andreev–Thurston theorem states that any planar graph can be represented "in such a way that its vertices correspond to disjoint disks, which touch if and only if the corresponding vertices ...
26 votes
0 answers
416 views

It is known that $\mathbb{R}^3$ can be partitioned into disjoint circles, or into disjoint unit circles, or into congruent copies of a real-analytic curve (Is it possible to partition $\mathbb R^3$ ...
25 votes
1 answer
738 views

I've believed that the answer is "yes" for years, as suggested in various sources with reference to Tóth's work. For example, the Wikipedia article for Kepler Conjecture says: The next step toward a ...