Polynomial Methods in Combinatorics
Larry Guth
ມິ.ຖ. 2016 · University Lecture Series ຫົວທີ 64 · American Mathematical Soc.
5,0star
1 ຄຳຕິຊົມreport
ປຶ້ມອີບຸກ
273
ໜ້າ
reportບໍ່ໄດ້ຢັ້ງຢືນການຈັດອັນດັບ ແລະ ຄຳຕິຊົມ ສຶກສາເພີ່ມເຕີມ
ກ່ຽວກັບປຶ້ມ e-book ນີ້
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 Erdős'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.
ການຈັດອັນດັບ ແລະ ຄຳຕິຊົມ
5,0
1 ຄຳຕິຊົມ
ກ່ຽວກັບຜູ້ຂຽນ
Larry Guth: Massachusetts Institute of Technology, Cambridge, MA
ໃຫ້ຄະແນນ e-book ນີ້
ບອກພວກເຮົາວ່າທ່ານຄິດແນວໃດ.
ອ່ານຂໍ້ມູນຂ່າວສານ
ສະມາດໂຟນ ແລະ ແທັບເລັດ
ຕິດຕັ້ງ ແອັບ Google Play Books ສຳລັບ Android ແລະ iPad/iPhone. ມັນຊິ້ງຂໍ້ມູນໂດຍອັດຕະໂນມັດກັບບັນຊີຂອງທ່ານ ແລະ ອະນຸຍາດໃຫ້ທ່ານອ່ານທາງອອນລາຍ ຫຼື ແບບອອບລາຍໄດ້ ບໍ່ວ່າທ່ານຈະຢູ່ໃສ.
ແລັບທັອບ ແລະ ຄອມພິວເຕີ
ທ່ານສາມາດຟັງປຶ້ມສຽງທີ່ຊື້ໃນ Google Play ໂດຍໃຊ້ໂປຣແກຣມທ່ອງເວັບຂອງຄອມພິວເຕີຂອງທ່ານໄດ້.
eReaders ແລະອຸປະກອນອື່ນໆ
ເພື່ອອ່ານໃນອຸປະກອນ e-ink ເຊັ່ນ: Kobo eReader, ທ່ານຈຳເປັນຕ້ອງດາວໂຫຼດໄຟລ໌ ແລະ ໂອນຍ້າຍມັນໄປໃສ່ອຸປະກອນຂອງທ່ານກ່ອນ. ປະຕິບັດຕາມຄຳແນະນຳລະອຽດຂອງ ສູນຊ່ວຍເຫຼືອ ເພື່ອໂອນຍ້າຍໄຟລ໌ໄໃສ່ eReader ທີ່ຮອງຮັບ.
