Finite Fields, with Applications to Combinatorics
Regular price
€63.99
14 days return policy
Shipping & Delivery
A01=Kannan Soundararajan
Age Group_Uncategorized
Age Group_Uncategorized
Author_Kannan Soundararajan
automatic-update
Category1=Non-Fiction
Category=PBD
Category=PBF
Category=PBH
Category=PBMW
Category=PBV
COP=United States
Delivery_Delivery within 10-20 working days
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Language_English
PA=Available
Price_€50 to €100
PS=Active
softlaunch
Product details
- ISBN 9781470469306
- Weight: 272g
- Dimensions: 140 x 216mm
- Publication Date: 18 Feb 2023
- Publisher: American Mathematical Society
- Publication City/Country: US
- Product Form: Paperback
- Language: English
Secure
checkout
Fast Shipping
Easy returns
This book uses finite field theory as a hook to introduce the reader to a range of ideas from algebra and number theory. It constructs all finite fields from scratch and shows that they are unique up to isomorphism. As a payoff, several combinatorial applications of finite fields are given: Sidon sets and perfect difference sets, de Bruijn sequences and a magic trick of Persi Diaconis, and the polynomial time algorithm for primality testing due to Agrawal, Kayal and Saxena. The book forms the basis for a one term intensive course with students meeting weekly for multiple lectures and a discussion session. Readers can expect to develop familiarity with ideas in algebra (groups, rings and fields), and elementary number theory, which would help with later classes where these are developed in greater detail. And they will enjoy seeing the AKS primality test application tying together the many disparate topics from the book. The pre-requisites for reading this book are minimal: familiarity with proof writing, some linear algebra, and one variable calculus is assumed. This book is aimed at incoming undergraduate students with a strong interest in mathematics or computer science.
Kannan Soundararajan, Stanford University, CA.
