Algebra

Algebra

Polynomials, Galois Theory and Applications

eBook - 2017
Rate this:
Suitable for advanced undergraduates and graduate students in mathematics and computer science, this precise, self-contained treatment of Galois theory features detailed proofs and complete solutions to exercises. Originally published in French as Algèbre -- Polynômes, théorie de Galois et applications informatiques, this 2017 Dover Aurora edition marks the volume's first English-language publication. The three-part treatment begins by providing the essential introduction to Galois theory. The second part is devoted to the algebraic, normal, and separable Galois extensions that constitute the center of the theory and examines abelian, cyclic, cyclotomic, and radical extensions. This section enables readers to acquire a comprehensive understanding of the Galois group of a polynomial. The third part deals with applications of Galois theory, including excellent discussions of several important real-world applications of these ideas, including cryptography and error-control coding theory. Symbolic computation via the Maple computer algebra system is incorporated throughout the text (though other software of symbolic computation could be used as well), along with a large number of very interesting exercises with full solutions.
Publisher: [Place of publication not identified] : Dover Publications, [2017]
Copyright Date: ©2017
ISBN: 9780486818849
Branch Call Number: Internet Access
Characteristics: 1 online resource (288 pages).

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age Suitability

Add Age Suitability

There are no age suitabilities for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Browse by Call Number

Recommendations

Subject Headings

  Loading...

Find it at EPL

  Loading...
[]
[]
To Top