Muutke küpsiste eelistusi

E-raamat: Introduction to Abstract Algebra

(Iowa State University, Ames, USA)
  • Formaat: 352 pages
  • Sari: Textbooks in Mathematics
  • Ilmumisaeg: 23-Oct-2015
  • Kirjastus: Chapman & Hall/CRC
  • Keel: eng
  • ISBN-13: 9781498731812
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 126,09 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: 352 pages
  • Sari: Textbooks in Mathematics
  • Ilmumisaeg: 23-Oct-2015
  • Kirjastus: Chapman & Hall/CRC
  • Keel: eng
  • ISBN-13: 9781498731812
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

Introduction to Abstract Algebra, Second Edition presents abstract algebra as the main tool underlying discrete mathematics and the digital world. It avoids the usual groups first/rings first dilemma by introducing semigroups and monoids, the multiplicative structures of rings, along with groups.

This new edition of a widely adopted textbook covers applications from biology, science, and engineering. It offers numerous updates based on feedback from first edition adopters, as well as improved and simplified proofs of a number of important theorems. Many new exercises have been added, while new study projects examine skewfields, quaternions, and octonions.

The first three chapters of the book show how functional composition, cycle notation for permutations, and matrix notation for linear functions provide techniques for practical computation. These three chapters provide a quick introduction to algebra, sufficient to exhibit irrational numbers or to gain a taste of cryptography.

Chapters four through seven cover abstract groups and monoids, orthogonal groups, stochastic matrices, Lagranges theorem, groups of units of monoids, homomorphisms, rings, and integral domains. The first seven chapters provide basic coverage of abstract algebra, suitable for a one-semester or two-quarter course.

Each chapter includes exercises of varying levels of difficulty, chapter notes that point out variations in notation and approach, and study projects that cover an array of applications and developments of the theory.

The final chapters deal with slightly more advanced topics, suitable for a second-semester or third-quarter course. These chapters delve deeper into the theory of rings, fields, and groups. They discuss modules, including vector spaces and abelian groups, group theory, and quasigroups.

This textbook is suitable for use in an undergraduate course on abstract algebra for mathematics, computer science, and education majors, along with students from other STEM fields.

Arvustused

"A complete course of instruction under one cover, Introduction to Abstract Algebra is a standard text that should be a part of every community and academic library mathematics reference collection in general, and algebraic studies supplemental reading in particular." Reviewers Bookwatch, December 2015

Smiths update to the first edition (CH, Jul'09, 46-6260) is an alternative approach to the usual first semester in higher algebra. The author accomplishes this by including many topics often absent from a first course, such as quasigroups, Noetherian domains, and modules, which, theoretically, are developed alongside their mainstream analogues, like groups, rings, and vector spaces. It is essentially a first semester wink at universal algebra. Smiths approach to axiomatic systems is few-too-manyhe starts with structures with very few axioms, like semigroups and monoids, and continues adding axioms. He finishes with more complex axiomatic systems, like unique factorization domains and fields. The book is very well written and easy to read, flowing naturally from one topic to the next. Numerous supportive homework exercises are also included to help the reader explore further topics. This book will best serve readers with a background in abstract algebra who desire to strengthen their understanding and build bridges between various topics. Unfortunately, because many similar topics are handled in tandem, an inexperienced reader might become confused, especially as many clarifying examples are missing. This book is for readers who want an under the hood view of algebra. --A. Misseldine, Southern Utah University 2015

1 Numbers 1(24)
1.1 Ordering numbers
1(2)
1.2 The Well-Ordering Principle
3(2)
1.3 Divisibility
5(1)
1.4 The Division Algorithm
6(3)
1.5 Greatest common divisors
9(1)
1.6 The Euclidean Algorithm
10(3)
1.7 Primes and irreducibles
13(1)
1.8 The Fundamental Theorem of Arithmetic
14(3)
1.9 Exercises
17(6)
1.10 Study projects
23(1)
1.11 Notes
24(1)
2 Functions 25(24)
2.1 Specifying functions
25(2)
2.2 Composite functions
27(1)
2.3 Linear functions
28(1)
2.4 Semigroups of functions
29(2)
2.5 Injectivity and surjectivity
31(3)
2.6 Isomorphisms
34(2)
2.7 Groups of permutations
36(3)
2.8 Exercises
39(5)
2.9 Study projects
44(3)
2.10 Notes
47(1)
2.11 Summary
47(2)
3 Equivalence 49(18)
3.1 Kernel and equivalence relations
49(2)
3.2 Equivalence classes
51(2)
3.3 Rational numbers
53(3)
3.4 The First Isomorphism Theorem for Sets
56(2)
3.5 Modular arithmetic
58(3)
3.6 Exercises
61(2)
3.7 Study projects
63(3)
3.8 Notes
66(1)
4 Groups And Monoids 67(30)
4.1 Semigroups
67(2)
4.2 Monoids
69(2)
4.3 Groups
71(2)
4.4 Componentwise structure
73(4)
4.5 Powers
77(1)
4.6 Submonoids and subgroups
78(4)
4.7 Cosets
82(2)
4.8 Multiplication tables
84(3)
4.9 Exercises
87(6)
4.10 Study projects
93(3)
4.11 Notes
96(1)
5 Homomorphisms 97(32)
5.1 Homomorphisms
97(3)
5.2 Normal subgroups
100(3)
5.3 Quotients
103(3)
5.4 The First Isomorphism Theorem for Groups
106(2)
5.5 The Law of Exponents
108(3)
5.6 Cayley's Theorem
111(3)
5.7 Exercises
114(6)
5.8 Study projects
120(8)
5.9 Notes
128(1)
6 Rings 129(32)
6.1 Rings
129(4)
6.2 Distributivity
133(2)
6.3 Subrings
135(2)
6.4 Ring homomorphisms
137(2)
6.5 Ideals
139(2)
6.6 Quotient rings
141(1)
6.7 Polynomial rings
142(5)
6.8 Substitution
147(2)
6.9 Exercises
149(6)
6.10 Study projects
155(5)
6.11 Notes
160(1)
7 Fields 161(30)
7.1 Integral domains
161(3)
7.2 Degrees
164(2)
7.3 Fields
166(2)
7.4 Polynomials over fields
168(3)
7.5 Principal ideal domains
171(3)
7.6 Irreducible polynomials
174(3)
7.7 Lagrange interpolation
177(2)
7.8 Fields of fractions
179(3)
7.9 Exercises
182(5)
7.10 Study projects
187(3)
7.11 Notes
190(1)
8 Factorization 191(30)
8.1 Factorization in integral domains
191(3)
8.2 Noetherian domains
194(2)
8.3 Unique factorization domains
196(3)
8.4 Roots of polynomials
199(3)
8.5 Splitting fields
202(2)
8.6 Uniqueness of splitting fields
204(4)
8.7 Structure of finite fields
208(2)
8.8 Galois fields
210(2)
8.9 Exercises
212(5)
8.10 Study projects
217(3)
8.11 Notes
220(1)
9 Modules 221(40)
9.1 Endomorphisms
221(4)
9.2 Representing a ring
225(1)
9.3 Modules
226(3)
9.4 Submodules
229(4)
9.5 Direct sums
233(4)
9.6 Free modules
237(4)
9.7 Vector spaces
241(5)
9.8 Abelian groups
246(3)
9.9 Exercises
249(6)
9.10 Study projects
255(5)
9.11 Notes
260(1)
10 Group Actions 261(36)
10.1 Actions
261(3)
10.2 Orbits
264(2)
10.3 Transitive actions
266(4)
10.4 Fixed points
270(3)
10.5 Faithful actions
273(2)
10.6 Cores
275(3)
10.7 Alternating groups
278(3)
10.8 Sylow Theorems
281(4)
10.9 Exercises
285(7)
10.10 Study projects
292(4)
10.11 Notes
296(1)
11 Quasigroups 297(34)
11.1 Quasigroups
297(2)
11.2 Latin squares
299(4)
11.3 Division
303(4)
11.4 Quasigroup homomorphisms
307(4)
11.5 Quasigroup homotopies
311(3)
11.6 Principal isotopy
314(2)
11.7 Loops
316(5)
11.8 Exercises
321(4)
11.9 Study projects
325(5)
11.10 Notes
330(1)
Index 331
Jonathan Smith is a Professor at Iowa State University. He earned his Ph.D., from Cambridge (England). His research focuses on combinatorics, algebra, and information theory; applications in computer science, physics, and biology.