Pages that link to "Item:Q2118223"

The following pages link to Bounds on the lattice point enumerator via slices and projections (Q2118223):

Displaying 12 items.

• A discrete version of Koldobsky's slicing inequality (Q1686312) (← links)
• Brunn-Minkowski type inequalities for the lattice point enumerator (Q2189483) (← links)
• Weighted \(1\times 1\) cut-and-project sets in bounded distance to a lattice (Q2324630) (← links)
• On a discrete version of Alexandrov's projection theorem (Q2392005) (← links)
• A generalization of the discrete version of Minkowski's fundamental theorem (Q2827908) (← links)
• Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
• On Discrete LOG-Brunn--Minkowski Type Inequalities (Q5096585) (← links)
• On Rogers–Shephard-type inequalities for the lattice point enumerator (Q6116346) (← links)
• Polynomial bounds in Koldobsky's discrete slicing problem (Q6554704) (← links)
• A remark on discrete Brunn-Minkowski type inequalities via transportation of measure (Q6594747) (← links)
• Discrete geometry. Abstracts from the workshop held January 21--26, 2024 (Q6613406) (← links)
• The best ways to slice a polytope (Q6657200) (← links)