All Questions
8 questions
6
votes
2
answers
544
views
On circles and ellipses drawn on an infinite planar square lattice
Consider a plane with a square lattice formed by all points with both coordinates as integers. As can be easily seen, a simple parabola can be found that passes through infinitely many of the square ...
- 5,979
7
votes
3
answers
550
views
Minkowski's theorem for non-0-symmetric sets
Let $\Lambda \subseteq \mathbb{R}^n$ be a full-rank lattice, i.e. $\Lambda = A \mathbb{Z}^n$ for some $A \in \mathrm{GL}_n (\mathbb{R})$, and let $C \subseteq \mathbb{R}^n$ be a $0$-symmetric convex ...
user92170
4
votes
0
answers
164
views
Two variants of the Littlewood-Offord theorem
I found two different looking things being called the Littlewood-Offord theorem,
If $\vec{a} \in \mathbb{R}^k \setminus 0$ and $t \in \mathbb{R}$ then there are $O(\frac{2^k}{\sqrt{k}})$ points $x \...
- 2,246
4
votes
1
answer
493
views
Counting number of points on a lattice in a hypercube
Suppose I have a lattice $\Lambda \in \mathbb{R}^n$. Let $X_i >0$ for $i=1,..,n$. I am interested in some references regarding counting number of points of $\Lambda$ inside $[-X_1, X_1] \times \...
- 3,625
5
votes
2
answers
342
views
Minimum length of a convex lattice polygon containing k lattice points?
Let $f(k)$ denote the minimum length of a convex lattice polygon containing exactly $k$ lattice points (including lattice points on the boundary).
It is not too hard to show that $k = \frac{1}{4\pi} ...
- 191
21
votes
5
answers
5k
views
What arrangement of unit cubes minimizes surface area?
For each of these two questions, one can assume that the arrangements are polycubes (for which a definition can be found in the excerpt-image below).
Question A. How does one arrange $n$ unit cubes ...
- 7,831
4
votes
2
answers
506
views
Empty lattice simplex or White's theorem
White has proved (White, G. K. Lattice tetrahedra -- Canad. J. Math. 16 1964 389–396.) the following theorem:
If $T$ is a closed tetrahedron and $\Lambda$ is a lattice which contains the vertices of $...
- 12.3k
6
votes
2
answers
381
views
Lattice-cube minimal blocking sets
Let $C_d(n)$ be the lattice cube consisting of the $n^d$ points with
each of its $d$ coorindates in $\lbrace 1,2,\ldots,n \rbrace$.
Define a blocking set for a lattice cube to be a set of points
in ...
- 151k