All Questions
Tagged with packing-and-covering nt.number-theory
7 questions
9
votes
1
answer
204
views
Which unimodular lattices $L\subset \mathbb R^2$ minimize $f_t(L):=\sum_{ v\in L} e^{-t \|v\|_2}$? (for parameters $t>0$)
$\DeclareMathOperator\SL{SL}\DeclareMathOperator\SO{SO}$Consider the lattices in $\SL(2,\mathbb R)(\mathbb Z^2)$ up to rotation. The space of such lattices can be identified with the modular surface $\...
- 241
3
votes
0
answers
185
views
Lattice points in a rotated product-of-balls
Fix $U$ unitary over $\mathbb{R}^{K},$ take $U_n=I_{n\times n}\otimes U$ and denote the unit ball at 0 in $\mathbb{R}^n$ as $B^n$. For $d_1,\dots,d_K>0$, fix $S_n:=U_n\left(\prod_{k=1}^K d_k B^n\...
11
votes
4
answers
447
views
Sequential addition of points on a circle, optimizing asymptotic packing radius
Suppose I have to put $N$ points $x_1, x_2, \ldots, x_N$ on the circle $S^1$ of length 1 so as to achieve the largest minimum separation (packing radius). The optimal solution is the equally spaced ...
- 5,971
1
vote
0
answers
71
views
Packing the box $[0,X^{\delta_1}] \times [0,X^{\delta_2}] \times [0,X^{\delta_3}] \subseteq \mathbb{R}^3$ with cubes
Let $0 < \delta_1 \leq \delta_2 \leq \delta_3 \leq 1$, and consider the box $B := [0,X^{\delta_1}] \times [0,X^{\delta_2}] \times [0,X^{\delta_3}] \subseteq \mathbb{R}^3$. Let $X > 3$ say. Is it ...
- 579
5
votes
3
answers
417
views
Exact bin packing the harmonic series: references?
Given $n$ and $B_n= \lceil H_n \rceil$, where the latter is the $n$th harmonic number $\sum^n_{i=1} 1/i$, for most $n$ it is easy to pack the first $n$ terms of the harmonic series into $B_n$ many ...
- 13k
1
vote
0
answers
124
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) ...
- 13.4k
6
votes
0
answers
199
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,...
- 17.9k