Pages that link to "Item:Q2366288"
From MaRDI portal
The following pages link to On the number of convex lattice polytopes (Q2366288):
Displaying 23 items.
- John-type theorems for generalized arithmetic progressions and iterated sumsets (Q944315) (← links)
- Classification of lattice-regular lattice convex polytopes (Q952227) (← links)
- Computing the Ehrhart polynomial of a convex lattice polytope (Q1330880) (← links)
- Lattice-free polytopes and their diameter (Q1346126) (← links)
- An output sensitive algorithm for discrete convex hulls (Q1388138) (← links)
- A discrete version of Koldobsky's slicing inequality (Q1686312) (← links)
- The limit shape of convex lattice polygons (Q1892410) (← links)
- Probabilistic approach to the analysis of statistics for convex polygonal lines (Q1896955) (← links)
- The limit shape of convex lattice polygons and related topics (Q1909908) (← links)
- On finitely generated closures in the theory of cutting planes (Q1926485) (← links)
- On the number of lattice free polytopes (Q1964651) (← links)
- Borsuk's partition conjecture (Q2067690) (← links)
- Tropically planar graphs (Q2112284) (← links)
- Skyscraper polytopes and realizations of plane triangulations (Q2407381) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- CONVEX CURVES AND A POISSON IMITATION OF LATTICES (Q3191159) (← links)
- Existence of unimodular triangulations — positive results (Q3380553) (← links)
- Random points and lattice points in convex bodies (Q3518215) (← links)
- Convex polygons in Cartesian products (Q5088949) (← links)
- (Q5214211) (← links)
- Cutting corners (Q5916326) (← links)
- Bounds on the number of higher-dimensional partitions (Q6154340) (← links)
- Cells in the box and a hyperplane (Q6172690) (← links)
