The packing tag has no usage guidance.

**2**

votes

**0**answers

46 views

### lower bound for sum of (squared) distances under a minimum distance restriction

I am trying to solve a packing problem in discrete geometry and it would be useful to know the answer to the following problem.
Let $A_1$, $A_2$,..., $A_n$ be $n$ points in the Euclidean plane $\...

**10**

votes

**0**answers

156 views

### Electrons on a pancake ellipsoid

The problems of minimizing the potential energy of electrons
on a sphere, or maximizing the smallest distance between the electrons,
have been well-studied.
E.g., see the
earlier MO question
"...

**8**

votes

**1**answer

239 views

### Integer sets with forbidden differences

Given a finite set $S$ of positive integers, and a positive integer $n$, let $F(n,S)$ be the largest possible cardinality of a subset of {$1,2,\dots,n$} no two of whose elements differ by a number in $...

**3**

votes

**2**answers

118 views

### Sub-sector covers for disks and balls

Define an open $k$-sector of a disk as the portion between two radii separated
by an angle of $2\pi/k$, but open along the two radii (and closed along the
circle boundary).
Call a set a sub-$k$-sector ...

**7**

votes

**1**answer

127 views

### Optimal stacking of split logs

Consider firewood logs as unit-radius cylinders of the same length.
Each log is split into $k$ pieces by equiangular sectors
meeting in the circle center:
$k=2$ leads to semicircles, $180^\circ$;
$k=3$...

**1**

vote

**0**answers

111 views

### The smallest disk containing all cirular arcs

In a comment to my recent question about covering segments by a disk, Gerhard Paseman has suggested a generalisation: replacing the segments of the original $n$-gon by a simple closed (say, convex) ...

**15**

votes

**5**answers

604 views

### The smallest disk containing all sides of an $n$-gon

Start with a regular $n$-gon of side 1 and consider its sides as open segments that can be moved around in the plane, allowing only translations. Two segments may not intersect.
What is the ...

**7**

votes

**5**answers

354 views

### Packing obtuse vectors in $\mathbb{R}^d$

I came across this attractive theorem:
Theorem. In $\mathbb{R}^d$, there can be at most $d+1$ vectors that
form an obtuse angle with one another.
This was proved1 as a corollary of a lemma about ...

**8**

votes

**2**answers

1k views

### How to pack 3D boxes into a bigger box?

Given a box of given size $L\times M\times N$ and a list of smaller boxes of given sizes $(l_i,m_i,n_i)$, decide whether the smaller boxes altogether fit into the big box (and produce such a packing ...

**6**

votes

**2**answers

542 views

### Equitably distributed curve on a sphere

Let $\gamma=\gamma(L)$ be a
simple (non-self-intersecting) closed curve of length $L$
on the unit-radius sphere $S$.
So if $L=2\pi$, $\gamma$ could be a great circle.
I am seeking the most equitably ...

**9**

votes

**0**answers

186 views

### Randomly placing nonoverlapping unit cuboids

Suppose one places unit cuboids of dimension $d$ with min-corners
uniformly distributed to lie in $[0,n]^d$, but with cuboid (strict) overlap forbidden.
At some point, the region is "saturated," ...

**32**

votes

**1**answer

602 views

### What measurable quantity can constrain the number of odors human can discriminate?

This is not a very typical MO question, but I hope you bear with me. It concerns a recent disagreement in the biology literature about how many different odors humans can discriminate. The authors of ...

**2**

votes

**0**answers

147 views

### Is the kissing number in $n$ dimensions always divisible by $n$? And what is the base of exponential growth of the kissing number?

And why are the kissing numbers for 1, 2, 3, 4 and 8 dimensions all highly composite numbers?

**6**

votes

**1**answer

142 views

### Translative packing constant strictly larger than lattice packing constant

Simply put, my question is this: what is the smallest dimension, if any,
where we can know for sure that a convex body exists whose translative
packing constant is strictly larger than its lattice ...

**4**

votes

**0**answers

331 views

### Packing space by cones: Translates best?

Let $C$ be a right circular cone, the convex hull of a unit-radius disk
and a point directly above the disk center at height $h$.
Is the ...

**8**

votes

**1**answer

444 views

### Triangle (constrained number, rather than shape) packing?

Are there any interesting results on optimal packings in the plane using a fixed number of triangles (without a fixed size or shape constraint)?
For instance, what's the maximum area packing of the ...

**9**

votes

**0**answers

151 views

### Characterizing the norms on $\mathbb{R}^3$ coming from Platonic solids

Recall that any sufficiently nice compact centrally symmetric convex body in $B \subset \mathbb{R}^3$ gives rise to a Banach norm on $\mathbb{R}^3$ which has $B$ as its unit ball.
Is there a nice ...

**-2**

votes

**1**answer

124 views

### Combination of 2 × 1 × 1 cubes inside a 3 × 3 × n cube [closed]

You have a block with a width of 3, depth of 3 and a height n
Given n, in how many ways can you fill this block with smaller blocks of 2 x 1 x 1?
if n is uneven, one 1x1x1 block will be unused. This ...

**4**

votes

**1**answer

204 views

### Cover of a n-simplex with balls

Consider a n-simplex. For each edge (i,j), consider a n-ball, such that vertices i and j are antipodal on this ball. Is the simplex covered by the union of these balls? Thank you.

**7**

votes

**0**answers

366 views

### Rectangology and squareology

I thought that rectangles were simple, and squares even simpler. Until my research has led me to several questions about rectangles and squares, which I can't solve.
I started by posting this ...

**4**

votes

**1**answer

310 views

### Is there an “accepted” jamming limit for hard spheres placed in the unit cube by random sequential adsorption?

I have a unit cube, and operating in the continuum limit (i.e. not on a lattice), I sequentially place spheres of some radius $r$ inside the cube until a filled volume "jamming limit" $\theta_{spheres}...

**2**

votes

**1**answer

155 views

### Is this cube packing possible?

I know how to pack $5$ unit squares in a square of side length $2+\frac{\sqrt{2}}{2}$. Is there an $\varepsilon>0$ such that there exists a packing of $9$ unit cubes in a cube of side length $3-\...

**1**

vote

**0**answers

446 views

### 2d bin packing problem, with opportunity to optimize the size of the bin

I have been tasked with optimizing a manufacturing process. It is a non-trivial, NP hard problem. The problem is similar to the 2d bin packing problem, but we are trying to optimize the size of the ...

**9**

votes

**3**answers

414 views

### Mutually tangent ellipsoids in 3 space

I recently heard a claim that for any n, it is possible to arrange n ellipsoids in 3 space such that each pair of ellipsoids is kissing. Is this true, and if so, how?
Edit: By kissing, I mean that I ...

**1**

vote

**2**answers

148 views

### Disks Packing Variant

Usually disk packing problems require that no two disks of the packing intersect.
Does anybody know if the problem has been studied when disks may intersect but they are not allowed to contain the ...

**6**

votes

**4**answers

520 views

### Packing and isoperimetrics

Suppose a manufacturer bottles small units of liquid and ships them via very large trucks.
If the transportation cost nothing, spherical bottles would minimize the packaging cost (isoperimetric ...

**12**

votes

**2**answers

573 views

### What is the largest possible thirteenth kissing sphere?

It is well-known that it is impossible to arrange 13 spheres of unit radius all tangent to another unit sphere without their interiors intersecting. This was apparently the subject of disagreement ...

**26**

votes

**2**answers

673 views

### Careless packing

The sequence $\frac{1}{2}, \frac{1}{2\cdot 2}, \frac{1}{3\cdot 4}, \frac{1}{4\cdot 6}, \frac{1}{5\cdot 8}, \frac{1}{6\cdot 10},\ldots$ has a curious property, as follows:
a) the series with these ...

**13**

votes

**2**answers

2k views

### How many vertices/edges/faces at most for a convex polyhedron that tiles space?

I wonder if this problem has already been examined before:
Consider a convex polyhedron that tiles $\mathbb R^3$. What is the maximum of vertices/edges/faces that such a polyhedron can have?
...

**1**

vote

**1**answer

162 views

### Constant hole density on the area of a circle

I need to create about 100 (small) holes in a distributor plate (hole diam = 0.5 mm; plate diameter = 100 mm). The sm. holes should be distributed in such a way that the density (hole/area) is nearly ...

**12**

votes

**2**answers

787 views

### Average degree of contact graph for balls in a box

Imagine you dump congruent, hard, frictionless balls in a box,
letting gravity compress the balls into a stable configuration
(I believe such configurations are called
jammed.)
Assume the box ...

**3**

votes

**2**answers

514 views

### Torus in $\mathcal{R}^3$

Hi
I'm interested in packing the 3 space as dense as possible using equally sized tori whose major radius is much bigger than their minor radius in.
Do you have any idea how to attack this problem?
...

**5**

votes

**3**answers

1k views

### Packing density of randomly deposited circles on a plane

Let's say that I have a rectangular two-dimensional surface of bounded dimensions, $[0,A]$ and $[0,B]$:
Under "no overlap" constraints, I sequentially deposit circles of radii $r_c$ on this surface,...

**13**

votes

**0**answers

518 views

### $\epsilon$-nets with respect to the cut norm

The cut norm $||A||\_C$ of a real matrix $A = (a_{i,j}) \in \mathcal{R}^{n\times n}$ is the maximum over all $I \subseteq [n], J \subseteq [n]$ of the quantity $\left|\sum_{i \in I, j \in J}a_{i,j}\...

**4**

votes

**1**answer

403 views

### Are there non-tiling polyhedra that pack arbitrarily well?

The fact that an upper bound on the packing density $< 1$ has only recently been exhibited for regular tetrahedra in $\mathbb{R}^3$ (see this question) suggests that proving concrete bounds of ...

**1**

vote

**1**answer

797 views

### Sphere packing in a sphere

Let $S_a^d$ be the $(d-1)$-dimensional sphere of radius $a$ in $\mathbb{R}^d$. Let $r>0$ be a constant and $R=\nu r$ where $\nu>1$ (some constant). Are there any known upper bounds on the number ...

**6**

votes

**0**answers

183 views

### A polynomial counting some packings in $\mathbb Z/N\mathbb Z$

Given two integers $n$ and $N$ such that $N>{n+1\choose 2}$, we denote by $\alpha_n(N)$
the number of elements $(x_1,\dots,x_n)$ in $(\mathbb Z/N\mathbb Z)^n$ such that the
$2n$ elements $x_1,x_1+1,...

**11**

votes

**1**answer

841 views

### Cobounded ⇒ cocompact?

Assume $\Gamma$ acts by isometries on a separable Hilbert space $H$, and
$$\operatorname{diam} H/\Gamma\le 1.$$
Is it true that $H/\Gamma$ is compact?
Stupid example. Assume the action of $\...

**10**

votes

**1**answer

426 views

### Are packing-homogeneous spaces homogeneous?

Given a metric space (M,d) define the packing function P(x,R,r) to be the maximum number of non-intersecting balls of radius r with centers in the ball B(x,R). Let’s call M packing-homogeneous if the ...

**2**

votes

**1**answer

455 views

### Compute number vertex disjoint cycles in graph surrounding a face

Hi all,
If anyone has insight into the following variant of the classic problem of packing vertex-disjoint cycle into graphs I would be interested.
Given a finite undirected graph $G$ embedded in ...

**0**

votes

**0**answers

179 views

### Packing Icons Onto A screen

You are trying to pack icons onto a screen that is divided into n horizontal rows of uniformly varying size. The rows narrow by a fixed ratio as one goes up the screen from the bottom. Since the icons ...

**8**

votes

**0**answers

159 views

### Asymptotics of packing

Define $m(n,k,l)$ as the maximal size of a family $k$-element subsets of $[n]$ having the property that the intersection of every two sets is less than $l$.
As stated on wikipedia, in 1985 Rödl ...

**15**

votes

**1**answer

2k views

### A circle packing conjecture

Consider $n$ circles with variable radii $r_1,\ldots, r_n$ that pack inside a fixed circle of unit radius. In other words, all $n$ variable-radius circles are contained in the unit radius circle and ...

**16**

votes

**4**answers

950 views

### Pennies on a carpet problem

I recently read the following "open problem" titled "Pennies on a carpet" in "An Introduction To Probability and Random Processes" by Baclawski and Rota (page viii of book, page 10 of following pdf),...

**9**

votes

**1**answer

578 views

### Upper bound for tetrahedron packing?

There have been several recent advances on packing regular tetrahedra in $\mathbb{R}^3$. All the results I've seen have been lower bounds -- first John Conway and Sal Torquato showed that there ...

**54**

votes

**4**answers

6k views

### Can we cover the unit square by these rectangles?

The following question was a research exercise (i.e. an open problem) in R. Graham, D.E. Knuth, and O. Patashnik, "Concrete Mathematics", 1988, chapter 1.
It is easy to show that
$$\sum_{1 \leq k } (...

**4**

votes

**7**answers

1k views

### How to generate a net on a 8-dimensional sphere

Using Matlab, how to generate a net of 3^10 points that are evenly located (or distributed) on the 8-dimensional unit sphere?
Thanks for any helpful answers!

**7**

votes

**2**answers

495 views

### Coiling Rope in a Box: Decidable?

Is the problem Coiling Rope in a Box decidable? To be specific, is this decidable?
Given $L > 0$ and $r \in (0,\frac{1}{2})$,
both rational,
can a rope of length $L$ and radius $r$
fit ...

**17**

votes

**1**answer

2k views

### Coiling Rope in a Box

What is the longest rope length L of radius r that can fit into a box?
The rope is a smooth curve with a tubular
neighborhood of radius r, such that the rope does not
self-penetrate. For an open ...

**9**

votes

**1**answer

661 views

### Packing twelve spherical caps to maximize tangencies

Suppose that $v_i$, for $i \in \{1, 2, \ldots 11, 12\}$, are twelve unit length vectors
based at the origin in $R^3$. Suppose that $|v_i - v_j| \geq 1$ for all $i
\neq j$. What arrangement of the $...