Skip to main content

All Questions

Filter by
Sorted by
Tagged with
8 votes
0 answers
282 views

Meaning of the Ehrhart polynomial at $-1/2$?

I am studying a large collection of lattice polytopes, all of them being simple and empty. The dimension can be any integer. The dilatation by $2$ gives non-empty polytopes. For many of these ...
F. C.'s user avatar
  • 3,587
0 votes
0 answers
44 views

Lattice points in the boundary of a Minkowski sum of two convex lattice polygons

Let $P$ and $Q$ be two convex lattice polygons in $\mathbb{R}_+^2$ and let $P+Q$ be their Minkowski sum. Given a set $S \subset \mathbb{R}^2$, we let $L(S) =\#( S \bigcap \mathbb{Z}^2)$. The equality $...
Yromed's user avatar
  • 183
4 votes
1 answer
181 views

Denominators of rational polytopes in terms of hyperplane coefficients

Let $\mathcal{P}$ be a convex polytope in $\mathbb{R}^n$ given in the form $\mathcal{P} = \{ x \in \mathbb{R}^n\colon A x\leq b \}$. Suppose that the entries of $A$ and $b$ are integers. Then it is ...
Sam Hopkins's user avatar
  • 24.2k
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,\...
Dac0's user avatar
  • 295
1 vote
0 answers
110 views

Upper bound on the diameter of a convex lattice n-gon with a given area

Given the area $A$ of ​​a strictly convex polygon with $n$ vertices with integer Cartesian coordinates, there are usually several non-equivalent polygons. The relationship between the area, the number ...
Hugo Pfoertner's user avatar
1 vote
0 answers
100 views

All 3-dimensional symmetric reflexive polytopes

$\DeclareMathOperator\Conv{Conv}$I am finding all 3-dimensional symmetric reflexive polytopes. To do so, first, we know that all 2 dim symmetric reflexive polytopes are $X_3=\Conv((-1,-1),(1,0),(0,1))$...
King 's user avatar
  • 21
4 votes
2 answers
266 views

A rational polytope that is not a 01-polytope?

A 01-polytope is the convex hull of some points $S\subseteq\{0,1\}^n$. I wonder, which polytopes can be represented (combinatorially) as 01-polytopes? There are polytopes that cannot have rational ...
M. Winter's user avatar
  • 13.6k
3 votes
1 answer
274 views

Unimodality of $f$-vectors of $0/1$-polytopes

It is known that the face vectors (aka $f$-vectors) of general polytopes need not be unimodal. This even fails for simple or simplicial polytopes, as was shown first by Björner. My question is if ...
Luis Ferroni's user avatar
  • 1,889
10 votes
3 answers
322 views

Integer decomposition property with a partial order

Let $\mathcal{P}$ be a convex lattice polytope in $\mathbb{R}^n$. We say that $\mathcal{P}$ has the integer decomposition property (or "is IDP") if for all $k\in \mathbb{N}$ and $\alpha \in ...
Sam Hopkins's user avatar
  • 24.2k
12 votes
1 answer
428 views

Curve with no embedding in a toric surface

I am looking for a smooth proper curve $C$ such that there does not exist any closed embedding $C \to S$ where $S$ is a (normal projective) toric surface. Since $C$ is smooth I believe it suffices to ...
Ben C's user avatar
  • 3,625
1 vote
1 answer
103 views

A source for $01$-polytopes

Can you recommend any books or survey articles on $01$-polytopes, thats is, polytopes with vertices in $\{0,1\}^n$? I am less interested in random $01$-polytopes, but more in the combinatorial ...
M. Winter's user avatar
  • 13.6k
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'...
M. Winter's user avatar
  • 13.6k
4 votes
0 answers
142 views

Reciprocity for multi-parameter Ehrhart polynomials

In McMullen's 1977 paper "Valuations and Euler-type relations on certain classes of convex polytopes" (https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/plms/s3-35.1.113), he shows that for $...
Sam Hopkins's user avatar
  • 24.2k
28 votes
1 answer
1k views

Are Minkowski sums of upward closed "convex" sets in $\mathbb{N}^k$ still "convex"? (WAS: Comparing mana costs in Magic: The Gathering)

This was originally a question about comparing mana costs in Magic: The Gathering, but it's turned into a question about Minkowski sums of upward-closed convex sets in $\mathbb{N}^k$. The original ...
Harry Altman's user avatar
  • 2,585
18 votes
4 answers
802 views

Volume of convex lattice polytopes with one interior lattice point

Let $P$ be a convex polytope in $\mathbb{R}^3$ whose every vertex lies in the $\mathbb{Z}^3$ lattice. Question: If $P$ contains exactly one lattice point in its interior, what is the maximum possible ...
Wlodek Kuperberg's user avatar