Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6093492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique |
scientific article; zbMATH DE number 6093492 |
Statements
Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (English)
0 references
15 October 2012
0 references
The paper reproves some classical theorems of discrete geometry (the Szemerédi-Trotter theorem and the Pach-Sharir theorem bounding the number of incidences between points and lines, and the theorem of Chazelle and Welzl about spanning trees with low crossing number) using the Guth-Katz partitioning of finite point sets in a Euclidean space based on the Stone-Tukey ham-sandwich theorem. The proofs are self-contained and appropriate for teaching.
0 references
incidences
0 references
algebraic methods
0 references
crossing number
0 references
spanning tree with low crossing number
0 references
polynomial ham-sandwich
0 references
partitioning polynomial
0 references
0 references
0.7713536024093628
0 references
0.7706621289253235
0 references
0.7676032185554504
0 references
0.7583654522895813
0 references
0.7468676567077637
0 references
