The mathematical concepts of abstract algebra may indeed be considered abstract, but its utility is quite concrete and continues to grow in importance. Unfortunately, the practical application of abstract algebra typically involves extensive and cumbersome calculations-often frustrating even the most dedicated attempts to appreciate and employ its intricacies. Now, however, sophisticated mathematical software packages help obviate the need for heavy number-crunching and make fields dependent on the algebra more interesting-and more accessible. Applications of Abstract Algebra with Maple opens the door to cryptography, coding, Polya counting theory, and the many other areas dependent on abstract algebra. The authors have carefully integrated Maple V throughout the text, enabling readers to see realistic examples of the topics discussed without struggling with the computations. But the book stands well on its own if the reader does not have access to the software. The text includes a first-chapter review of the mathematics required-groups, rings, and finite fields-and a Maple tutorial in the appendix along with detailed treatments of coding, cryptography, and Polya theory applications. Applications of Abstract Algebra with Maple packs a double punch for those interested in beginning-or advancing-careers related to the applications of abstract algebra. It not only provides an in-depth introduction to the fascinating, real-world problems to which the algebra applies, it offers readers the opportunity to gain experience in using one of the leading and most respected mathematical software packages available.a3 + a + 1 a2 + l , 15 Let C be the BCH code that results from considering the first six powers of a. To determine the generator polynomial g(x) for C, we must find the minimum polynomials mi(x), 77i2(z), . . . , me(x). But p(a) = 0, and hence p(a2) anbsp;...
|Title||:||Applications of Abstract Algebra with MAPLE|
|Author||:||Richard Klima, Neil Sigmon, Ernest Stitzinger|
|Publisher||:||CRC Press - 1999-09-28|