Skip to main content

All Questions

Filter by
Sorted by
Tagged with
8 votes
0 answers
149 views

Do the $\ell^{\infty}$ and $\ell^1$ norms yield minimal doubling constants amongst all norms on $\mathbb{R}^n$?

Setting: Let $X:=\mathbb{R}^n$ for some positive integer $n$. For each $1\le p\le \infty$ let $d_p$ denote the metric induced by the $\ell^p_n$ norm thereon. Note that, the doubling constant of a ...
ABIM's user avatar
  • 5,405
6 votes
1 answer
413 views

How many unit cubes are needed to 'hide' a unit cube fully in 3D?

Question: What is the smallest number of nonoverlapping unit cubes that can hide a unit cube C - in the sense that every ray emanating from the boundary of C meets the interior or the boundary of one ...
Nandakumar R's user avatar
  • 5,979
11 votes
1 answer
403 views

Smallest sphere containing three tetrahedra?

What is the smallest possible radius of a sphere which contains 3 identical plastic tetrahedra with side length 1?
trionyx's user avatar
  • 111
2 votes
0 answers
84 views

Another variant of the Malfatti problem

We try to add to A Variant of the Malfatti Problem As stated in the Wikipedia entry on Malfatti circles, it is an open problem to decide, given a number $n$ and any triangle, whether a greedy method ...
Nandakumar R's user avatar
  • 5,979
5 votes
1 answer
230 views

Which pyramids fill space?

Let us define a pyramid as a convex polyhedron with one quadrilateral face and four triangular faces. Question: How many pyramids (or families of pyramids) are known that can fill 3D space without ...
Nandakumar R's user avatar
  • 5,979
4 votes
0 answers
144 views

Approximation of a convex shape in the $d$-dimensional Euclidean space for $d\gg 1$

We are given a convex shape $C$ lying inside the hypercube $[0,1]^d$ in the $d$-dimensional Euclidean space. Let the volume of $C$ be $\tfrac12$ (I guess nothing changes for any other fixed constant ...
Penelope Benenati's user avatar
2 votes
1 answer
164 views

Packing densities of non-centrally symmetric planar convex regions

Reference: https://en.wikipedia.org/wiki/Smoothed_octagon Background: The smoothed octagon is conjectured to have the lowest maximum packing density of the plane of all centrally symmetric convex ...
Nandakumar R's user avatar
  • 5,979
4 votes
2 answers
312 views

Which convex pentagon gives least packing density?

Among all convex pentagons, does the regular pentagon give least packing density? Further question: For each $n > 6$, is the regular $n$-gon the minimum of packing density? An analogous question ...
Nandakumar R's user avatar
  • 5,979
1 vote
3 answers
146 views

On packing axisymmetric bodies in 3D

Consider any 3D body with an axis of rotational symmetry (e.g. cone, cylinder...) and packing the 3d space efficiently with infinitely many copies of this body. Is the following claim valid? Claim: ...
Nandakumar R's user avatar
  • 5,979
2 votes
0 answers
125 views

Bound on covering number for overparametrized manifold

I am trying to wrap my head around the following problem: I have $p$ real parameters $\boldsymbol{\theta} \in \Theta = [0, 2\pi)^p$ that parametrize functions $f(\boldsymbol{\theta}) \in f(\Theta)$ ...
Johannes Jakob Meyer's user avatar
0 votes
0 answers
90 views

On Covering a Planar Region with Copies of a Tile of Different Shape

Background: Consider trying to cover the largest possible scaled copy of a planar region $C$ with specified shape with n instances of a tile $T$ of specified shape and size. Several families of this ...
Nandakumar R's user avatar
  • 5,979
22 votes
1 answer
886 views

Happy ants never leave compact domain?

I am curious if the following seemingly simple question has an easy answer? Consider an ant population of $N$ ants that lives in $\mathbb R^2$. Each ant can be labeled by some coordinate $x\in \mathbb ...
Pritam Bemis's user avatar
2 votes
0 answers
131 views

Optimal way to group points in the plane into clusters

Consider a strictly decreasing sequence $d = (d_k)_{k\ge 1}$ of distances in $(0,1)$. Given a constant $C>2$, we say that $d$ has the $C$-grouping property if any finite non-empty subset $S$ (of ...
Mohan Swaminathan's user avatar
5 votes
1 answer
114 views

Packing in uniform domains

Given $N$ points $X:=(x_i)_{i \in \{1,..,N\}}$, we now define a score function $S:X \rightarrow \mathbb{N}$ that is $S(X)= \sum_{i=1}^N S(x_i)$ where the score of $S(x_i)$ is $$S(x_i) = 2* \vert \{x_j;...
Sascha's user avatar
  • 536
5 votes
0 answers
313 views

Trade-off between covering number, ball radius and diameter of $d$-dimensional shapes

Given any $d$-dimensional shape $X$ in the Euclidean space, let $\ell(X)$ be the length of the longest line segment connecting two points of $X$. How can we prove the following statement? There exists ...
Penelope Benenati's user avatar
3 votes
0 answers
134 views

Two questions on counterexamples to Borsuk's conjecture and ball-packings

In 1933 Karol Borsuk conjectured the following Can every bounded subset $E$ of $\mathbb{R}^d$ be partitioned into $(d+1)$ sets, each of which has a smaller diameter than $E$? Whilst new to this ...
Felix's user avatar
  • 31
5 votes
0 answers
199 views

Existence of a honeycomb composed by nearly-hyperspherical $d$-dimensional cells having the same shape and size

Let $\mathcal{H}$ the class of all honeycombs composed by $d$-dimensional cells $C$ having all the same shape and size in a $d$-dimensional space $\mathcal{S}$. Let $s(C)$ and $\ell(C)$ be ...
Penelope Benenati's user avatar
26 votes
0 answers
359 views

Can 4-space be partitioned into Klein bottles?

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$ ...
Joseph O'Rourke's user avatar
6 votes
0 answers
1k views

How to pack 27 $a\times b\times c$ blocks into a cube of side $a+b+c$ with some kind of symmetry?

Recently I stumbled on the problem quoted here about a geometric proof of the AM-GM inequality $$(a_1+\cdots+a_n)^n\ge n^n a_1\cdots a_n$$ by packing $n^n$ rectangular $ n$-dimensional boxes of sides $...
Wolfgang's user avatar
  • 13.4k
11 votes
2 answers
455 views

Dodecahedral rolling distance

Let a dodecahedron sit on the plane, with one face's vertices on an origin-centered unit circle. Fix the orientation so that the edge whose indices are $(1,2)$ is horizontal. For any $p \in \mathbb{R}...
Joseph O'Rourke's user avatar
13 votes
5 answers
1k 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 ...
Joseph O'Rourke's user avatar
5 votes
1 answer
547 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.
Max's user avatar
  • 195
10 votes
0 answers
493 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 question ...
Erel Segal-Halevi's user avatar
35 votes
3 answers
2k views

The kissing number of a square, cube, hypercube?

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.   &...
Joseph O'Rourke's user avatar
9 votes
3 answers
525 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 ...
Linda Brown Westrick's user avatar
1 vote
1 answer
227 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 ...
Hobbit's user avatar
  • 13
13 votes
2 answers
1k 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 ...
Joseph O'Rourke's user avatar
2 votes
1 answer
1k 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 ...
alext87's user avatar
  • 3,217
5 votes
3 answers
2k views

Optimal packing of spheres tangent to a central sphere

Please consider a central, ordinary 2-sphere $S_1$, of some radius $r_1$, and a second ordinary sphere, $S_2$, of radius $r_2$, where $r_2 \leq r_1$. My question concerns optimal values for the ...
AfternoonCoffee's user avatar
99 votes
7 answers
20k 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 \...
Kaveh's user avatar
  • 5,502
2 votes
2 answers
5k views

Best fit for multiple shapes inside an area

Is there a forumla to come up with the best fit for multiple shapes inside a rectangular area, so that none of the shapes are overlapping?
user5052's user avatar
  • 121
20 votes
3 answers
3k views

How many unit squares can you pack into a rectangle with nearly integer side lengths?

Earlier today, somebody asked what looks like a homework problem, but admits the following reading which I think is interesting: Suppose $a_1,\dots, a_n$ are positive integers, and $\varepsilon$ is ...
Anton Geraschenko's user avatar