Finite Fields, with Applications to Combinatorics

Finite Fields, with Applications to Combinatorics

Kannan Soundararajan
0 / 4.5
0 comments
你有多喜欢这本书?
下载文件的质量如何?
下载该书,以评价其质量
下载文件的质量如何?
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.
年:
2022
出版社:
American Mathematical Society
语言:
english
页:
185
ISBN 10:
1470469308
ISBN 13:
9781470469306
系列:
Student Mathematical Library, 99
文件:
PDF, 7.69 MB
IPFS:
CID , CID Blake2b
english, 2022
线上阅读
正在转换
转换为 失败

关键词