Skip to main content

All Questions

Filter by
Sorted by
Tagged with
9 votes
1 answer
442 views

You have $n$ rectangles of area $1$ and variable height. Pack as many as possible in a semicircle of area $n$. How many leftovers will there be?

You have $n$ rectangles of area $1$ and variable height. Pack as many of these rectangles as possible in a semicircle of area $n$. How many leftover rectangles will there be, in terms of $n$? How to ...
Dan's user avatar
  • 3,527
9 votes
0 answers
193 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 ...
Manu's user avatar
  • 393
2 votes
1 answer
315 views

Packing number of $\ell_1$ ball in $\ell_{\infty}$ metric

Consider the $d$-dimensional $\ell_1$ ball $\mathbb B_d=\{x\in\mathbb R^d: \|x\|_1\leq 1\}$, where $\|x\|_1=\sum_{i=1}^d{|x_i|}$. I'm interested in the maximum size of the (finite) subset $S\subseteq\...
Yining Wang's user avatar