Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
0 answers
67 views

maximizing number of lattice points with bounded diameter

Suppose I have a lattice $L$ that's just $\mathbb{Z}^k$ but scaled in every coordinate by some (potentially different) real numbers. Now I want to construct a finite set of lattice points $S \subset L$...
Yan X Zhang's user avatar
3 votes
1 answer
171 views

Covering radius of a lattice from relevant vectors

Let $L$ be an $n-$dimensional lattice. The Voronoi region of $L$ is given by $$ \mathcal{V}(L)=\big\{x\in\mathbb{R}^n~|~ \|x\|_2\leq \|x-v\|_2~\forall v\in L\setminus\{0\}\big\}. $$ Considering the ...
FermaX's user avatar
  • 33
1 vote
0 answers
243 views

16-cell honeycomb (4D tiling by cross-polytopes)

A 4-dimensional cross-polytope (also called 16-cell) is a regular polytope whose vertices are all permutations of $(\pm1,0,0,0)$. It is known that this body tiles the space $\mathbb{R}^4$ by ...
aleph's user avatar
  • 503
3 votes
1 answer
518 views

n-dimensional Delaunay Triangulation of Lattices

I have several questions concerning the Delaunay triangulation of a high dimensional lattice. Given an $n$-dimensional lattice $L$ and its Delaunay triangulation (partition of $R^n$ into simplices ...
Jinx's user avatar
  • 31
13 votes
3 answers
1k views

When are Ehrhart functions of compact convex sets polynomials?

Given a lattice $L$ and a subset $P\subset \mathbb R^d$, we define for each positive integer $t$ $$f_P(L,t)=|(tP\cap L)|$$ the number of lattice points in $tP$. Let's say $P$ is nice if $f_P(L,t)$ is ...
Gjergji Zaimi's user avatar