Pages that link to "Item:Q5729375"
From MaRDI portal
The following pages link to A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points (Q5729375):
Displaying 41 items.
- On the complexity of the family of convex sets in \(\mathbb{R}^d\) (Q325664) (← links)
- The number of different digital \(N\)-discs (Q333607) (← links)
- On the convex hull of solutions to polynomial congruences (Q643546) (← links)
- Restriction of toral eigenfunctions to hypersurfaces and nodal sets (Q690620) (← links)
- Constructing metrics on a 2-torus with a partially prescribed stable norm (Q692607) (← links)
- The layer number of \(\alpha \)-evenly distributed point sets (Q785830) (← links)
- Integer points on curves and surfaces (Q801098) (← links)
- Integral points on convex curves (Q829779) (← links)
- Integer points on hypersurfaces (Q1076059) (← links)
- An output sensitive algorithm for discrete convex hulls (Q1388138) (← links)
- The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. (Q1408266) (← links)
- On the combinatorial complexity of approximating polytopes (Q1688856) (← links)
- An improved construction of progression-free sets (Q1758902) (← links)
- The limit shape of convex lattice polygons and related topics (Q1909908) (← links)
- Modular hyperbolas (Q1936715) (← links)
- Upper bounds on the maximal number of facets of 0/1-polytopes (Q1964653) (← links)
- Best and random approximation of a convex body by a polytope (Q2136855) (← links)
- Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)
- Lattice points on convex curves (Q2264704) (← links)
- Approximating a planar convex set using a sparse grid (Q2274483) (← links)
- Embedding stacked polytopes on a polynomial-size grid (Q2358818) (← links)
- Tight bounds on discrete quantitative Helly numbers (Q2360726) (← links)
- On a question of V.~I.~Arnol'd (Q2392026) (← links)
- Minimum-perimeter intersecting polygons (Q2429366) (← links)
- On finding a large number of 3D points with a small diameter (Q2457016) (← links)
- On maximal convex lattice polygons inscribed in a plane convex set (Q2472723) (← links)
- Mean lattice point discrepancy bounds. II: Convex domains in the plane (Q2474564) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Lattice points close to the Heisenberg spheres (Q2691629) (← links)
- Geometric properties of points on modular hyperbolas (Q3065697) (← links)
- The Convex Hull of the Prime Number Graph (Q3119766) (← links)
- Random points and lattice points in convex bodies (Q3518215) (← links)
- Convex bodies, economic cap coverings, random polytopes (Q3828623) (← links)
- A Theorem Concerning the Integer Lattice (Q4170530) (← links)
- On the Number of Convex Lattice Polygons (Q4291189) (← links)
- Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem (Q4602859) (← links)
- The diameter of lattice zonotopes (Q5113413) (← links)
- The Number of Gröbner Bases in Finite Fields (Research) (Q5118668) (← links)
- Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
- Cutting corners (Q5916326) (← links)
- Primitive point packing (Q6074967) (← links)
