Book review of: L. Guth, Polynomial methods in combinatorics
From MaRDI portal
(Redirected from Publication:1647769)
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
- Algebraic methods in discrete analogs of the Kakeya problem
- An improved bound for Kakeya type maximal functions
- An improved lower bound on the size of Kakeya sets over finite fields
- Combinatorial Nullstellensatz
- Counting and cutting cycles of lines and rods in space
- Extremal problems in discrete geometry
- On joints in arrangements of lines in space and related problems
- On sets defining few ordinary lines
- On the size of Kakeya sets in finite fields
- Szemerédi-Trotter-type theorems in dimension 3
- The blocking number of an affine space
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
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)