Pages that link to "Item:Q3359328"
From MaRDI portal
The following pages link to On Counting Lattice Points in Polyhedra (Q3359328):
Displaying 18 items.
- A Euclid style algorithm for MacMahon's partition analysis (Q482232) (← links)
- Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements (Q857417) (← links)
- On integer points in polyhedra (Q1193530) (← links)
- Computing the Ehrhart polynomial of a convex lattice polytope (Q1330880) (← links)
- Counting curves via lattice paths in polygons (Q1417112) (← links)
- Recognition of digital polyhedra with a fixed number of faces is decidable in dimension 3 (Q1690410) (← links)
- Counting polytopes via the Radon complex (Q1826858) (← links)
- Polyhedral circuits and their applications (Q2039640) (← links)
- Rational polyhedral outer-approximations of the second-order cone (Q2042079) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- Distances to lattice points in knapsack polyhedra (Q2191767) (← links)
- (Q4432212) (← links)
- Lattice point counting in sectors of Hyperbolic 3-space (Q4602836) (← links)
- (Q4682565) (← links)
- (Q4815721) (← links)
- (Q5432043) (← links)
- Minimizing the number of lattice points in a translated polygon (Q5741788) (← links)
- A method of deducing \(L\)-polyhedra for \(n\)-lattices (Q5959457) (← links)