Pages that link to "Item:Q1716001"
From MaRDI portal
The following pages link to Covering lattice points by subspaces and counting point-hyperplane incidences (Q1716001):
Displaying 14 items.
- Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem (Q1137067) (← links)
- Economical coverings of sets of lattice points (Q1190135) (← links)
- A general incidence bound in \(\mathbb{R}^d\) (Q2033938) (← links)
- Exact hyperplane covers for subsets of the hypercube (Q2037567) (← links)
- On topological graphs with at most four crossings per edge (Q2175439) (← links)
- An extremal problem for integer sparse recovery (Q2282769) (← links)
- The largest complete bipartite subgraph in point-hyperplane incidence graphs (Q2288177) (← links)
- (Q4352337) (← links)
- Covering lattice points by subspaces and counting point-hyperplane incidences (Q4580084) (← links)
- (Q4682565) (← links)
- The constant of point-line incidence constructions (Q6110067) (← links)
- Coloring lines and Delaunay graphs with respect to boxes (Q6201036) (← links)
- Minkowski's successive minima in convex and discrete geometry (Q6594637) (← links)
- Evasive sets, covering by subspaces, and point-hyperplane incidences (Q6624199) (← links)
