FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

Polynomial Methods in Combinatorics

Larry Guth
    Product form
      FORMAT: Paperback / softback
      YOU COULD EARN 0 FUTURE RETAIL DISCOUNTS.

      This product is either out of print or out of stock. Add it to your wishlist and we will automatically let you know if it comes back into stock. Add to Wishlist

      ESTIMATED DELIVERY: Possibly out of print
      BUY NOW PAY LATER
      From R 0.00 per month!
      3x monthly payments of R 0.00 with
      4x fortnightly payments of R 0.00 with

      This product is either out of print or out of stock. Add it to your wishlist and we will automatically let you know if it comes back into stock. Add to Wishlist

      This book explains some recent applications of the theory of polynomials and algebraic geometry to combinatorics and other areas of mathematics. One of the first results in this story is a short elegant solution of the Kakeya problem for finite fields, which was considered a deep and difficult problem in combinatorial geometry. The author also discusses in detail various problems in incidence geometry associated to Paul Erdos's famous distinct distances problem in the plane from the 1940s. The proof techniques are also connected to error-correcting codes, Fourier analysis, number theory, and differential geometry. Although the mathematics discussed in the book is deep and far-reaching, it should be accessible to first- and second-year graduate students and advanced undergraduates. The book contains approximately 100 exercises that further the reader's understanding of the main themes of the book.
      Format: Paperback / softback CONTRIBUTORS: Larry Guth EAN: 9781470428907 COUNTRY: United States PAGES: WEIGHT: 505 g HEIGHT: 254 cm
      PUBLISHED BY: American Mathematical Society DATE PUBLISHED: 2017-03-01 CITY: GENRE: MATHEMATICS / General WIDTH: 178 cm SPINE:

      Book Themes:

      Discrete mathematics, Geometry, Topology, Combinatorics and graph theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Larry Guth, Massachusetts Institute of Technology, Cambridge, MA, USA.
      This book explains some recent applications of the theory of polynomials and algebraic geometry to combinatorics and other areas of mathematics. One of the first results in this story is a short elegant solution of the Kakeya problem for finite fields, which was considered a deep and difficult problem in combinatorial geometry. The author also discusses in detail various problems in incidence geometry associated to Paul Erdos's famous distinct distances problem in the plane from the 1940s. The proof techniques are also connected to error-correcting codes, Fourier analysis, number theory, and differential geometry. Although the mathematics discussed in the book is deep and far-reaching, it should be accessible to first- and second-year graduate students and advanced undergraduates. The book contains approximately 100 exercises that further the reader's understanding of the main themes of the book.
      Format: Paperback / softback CONTRIBUTORS: Larry Guth EAN: 9781470428907 COUNTRY: United States PAGES: WEIGHT: 505 g HEIGHT: 254 cm
      PUBLISHED BY: American Mathematical Society DATE PUBLISHED: 2017-03-01 CITY: GENRE: MATHEMATICS / General WIDTH: 178 cm SPINE:

      Book Themes:

      Discrete mathematics, Geometry, Topology, Combinatorics and graph theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Larry Guth, Massachusetts Institute of Technology, Cambridge, MA, USA.

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account