All Questions
Tagged with lattices convex-polytopes
25 questions
0
votes
1
answer
116
views
How can I find the hyperplane passing through a 600-cell
I have a 600-cell, whose coordinates are given by
$$\begin{array}{ccc}
\text{8 vertices} & \left(0,0,0,\pm1\right) & \text{all permutations,}\\
\text{16 vertices} & \frac{1}{2}\left(\pm1,\...
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$...
1
vote
0
answers
47
views
Barnes-Wall lattices’ contact polytopes
The contact polytopes of the Barnes-Wall lattices in 1, 2, 4, and 8 dimensions are all uniform polytopes. Is this true in any higher number of dimensions?
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 ...
2
votes
1
answer
119
views
Anchor sets for lattice polygons: Part I
Suppose $V=\{(x_1,y_1), (x_2,y_2),\dots,(x_v,y_v)\}$ is a vertex set of lattice points satisfying
$$0=x_1<x_2<\dots<x_v \qquad \text{and} \qquad y_1>y_2>\cdots>y_{v-1}>y_v=0.$$
...
6
votes
1
answer
337
views
Edges of the contact polytope of the Leech lattice
Let $P\subset\Bbb R^{24}$ be the contact polytope of the Leech lattice, that is, $P$ is the convex hull of the 196,560 shortest vectors of $\Lambda_{24}$.
Question: What are the edges of $P$?
Let'...
2
votes
0
answers
111
views
Can computers take uniform samples from a polytope?
For each $r \in \mathbb N $ write $\mathbb Z/ 10^r = \{a/10^r: a \in \mathbb Z\}$ and $P(r)$ for the lattice $(\mathbb Z/10^r)^N \subset \mathbb R^N$.
Suppose the plane $P \subset \mathbb R^N$ is ...
2
votes
1
answer
159
views
Counting lattice points can some give all?
Given convex polytope $\mathcal P\subseteq\Bbb R^n$ with $\mathcal P_\Bbb Z\leq2^n$ integer points and given locations of $O(\log \mathcal P_\Bbb Z)$ integer points in some positions can we obtain $\...
4
votes
1
answer
150
views
On necessary condition for no integer points in polytope
For a convex polytope $\mathcal K$ in $\Bbb R^n$ presented by $O(n^c)$ linear inequalities is it true that for $|\mathcal K\cap \Bbb Z^n|=0$ it is necessary that at least one axis of John's ellipsoid ...
10
votes
3
answers
985
views
Approximate volume computation and lattice point enumeration - hardness
Both volume computation and lattice point enumeration of convex polyhedron are $\#P$ hard. However there is a randomized polytime algorithm for constant factor approximation for volume computation.
...
0
votes
2
answers
318
views
Lattice question
Consider a lattice $\mathcal{L} = \mathbb{Z}v_1 \oplus \ldots \oplus \mathbb{Z}v_l$ in $\mathbb{R}^n$ and let $S_0$ be the set of edges of the fundamental unit of $\mathcal{L}$. We call a region $X$ ...
5
votes
0
answers
129
views
Lattice paths in polytopes
Let $P$ be a polytope in $\mathbb{R}^n$. Let $A_ix = b_i$ be the defining equations of its codimension $1$ faces. Is there an algorithm or some kind of criterion to decide if the lattice points inside ...
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 ...
3
votes
0
answers
259
views
Lattice points in regular simplex
Suppose we are given a regular (closed) simplex $S$ in a vector space $V$ of dimension $n$, whose vertices have integer values. Then for a lattice $L$, is there a sufficient criterion, for $S$ to ...
2
votes
3
answers
381
views
Information needed to distinguish combinatorially isomorphic polytopes (up to affine equivalence)
I originally posted this question on Stack Exchange, thinking it perhaps does not qualify as "research-level" but it received no answers... hopefully someone here can help.
The title pretty much ...
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 ...
1
vote
1
answer
152
views
Submodular measures on the hypercube
By the hypercube I mean the lattice formed by all n-bit strings ordered by pointwise inequality. For example, $000 \leq 110$, $010 \leq 110$, $110$ and $001$ are not comparable. Further we have the ...
3
votes
1
answer
396
views
Lattice points in cross-polytopes
Let $E\subset \mathbb{R}^n$ be a cross-polytope:
$$E= \left\lbrace x : \frac{|x_1|}{q_1}+\cdots+\frac{|x_n|}{q_n}\leq 1 \right\rbrace, $$
where $q_1,\dots,q_n$ are positive integers. I am interested ...
4
votes
1
answer
250
views
Zoll Flat Finsler tori and convex bodies on a starry night
The starry night. The "celestial sphere" is given by set of non-zero vectors in $\mathbb{R}^n$ modulo positive dilations (i.e., $v \equiv w$ if $v = \lambda w$ for some $ \lambda > 0$) and the "...
5
votes
0
answers
324
views
Lattice points inside a (n-dimensional) tetrahedron
Hi, overflowers.
I was interested in a sharp lower bound for the number of lattice points (say, integral lattice points) inside the tetrahedron defined by the coordinate hyperplanes and $x_1/a_1+...+...
3
votes
0
answers
102
views
Versions of Helly's Theorem for Unbounded Parallelpipeds
I'm studying Frobenius splitting of toric varieties based on Sam Payne's characterization of Frobenius splitting ("Frobenius splittings of toric varieties" (2008)) and I came across a sort of Helly's ...
1
vote
1
answer
277
views
Representing integer points inside a polytope using a unit hypercube
Let $D\subset\mathbb{Z}\times\mathbb{Z}$ such that $D$ is formed by the points bounded by a convex polytope. Let $f:D\to\mathbb{R}$ defined by $f(x,y)=ax+by+c$, where $a,b,c\in\mathbb{R}$ and $g:D\to\...
8
votes
3
answers
2k
views
Listing lattice points in a simplex
Let $n \in \mathbf{Z}_{\geq 1}$. Is there an algorithm which, given a simplex $\Delta \subset \mathbf{R}^n$ specified as the convex hull of $v_0,\dots,v_n \in \mathbf{Z}^n$, computes the set $\Delta \...
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 ...
0
votes
2
answers
611
views
Is a lattice of convex sets distributive?
Is a lattice of convex sets in $R^2$ distributive?