Book review of: L. Guth, Polynomial methods in combinatorics
DOI10.1365/S13291-017-0170-9zbMATH Open1392.00014OpenAlexW2746782960MaRDI QIDQ1647769FDOQ1647769
Authors: Simeon Ball
Publication date: 26 June 2018
Published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1365/s13291-017-0170-9
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Polynomials in number theory (11C08) External book reviews (00A17) Factorials, binomial coefficients, combinatorial functions (05A10) Algebraic combinatorics (05E99) Polynomials over finite fields (11T06) Linear codes (general theory) (94B05) Discrete geometry (52C99) Approximation to algebraic numbers (11J68) Transcendental field extensions (12F20)
Cites Work
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- On sets defining few ordinary lines
- Szemerédi-Trotter-type theorems in dimension 3
- Extremal problems in discrete geometry
- The blocking number of an affine space
- Algebraic methods in discrete analogs of the Kakeya problem
- On the size of Kakeya sets in finite fields
- Combinatorial Nullstellensatz
- An improved bound for Kakeya type maximal functions
- An improved lower bound on the size of Kakeya sets over finite fields
- Counting and cutting cycles of lines and rods in space
- On joints in arrangements of lines in space and related problems
Cited In (2)
This page was built for publication: Book review of: L. Guth, Polynomial methods in combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647769)