Algebra, Abstract Algebra, and Linear Algebra

This introduction to modern or abstract algebra addresses the conventional topics of groups, rings, and fields with symmetry as a unifying theme, while it introduces readers to the active practice of mathematics. Its accessible presentation is designed to teach users to think things through for themselves and change their view of mathematics from a system of rules and procedures, to an arena of inquiry.

Popular computer algebra systems such as Maple, Macsyma, Mathematica, and REDUCE are now basic tools on most computers. Efficient algorithms for various algebraic operations underlie all these systems. Computer algebra, or algorithmic algebra, studies these algorithms and their properties and represents a rich intersection of theoretical computer science with classical mathematics.

This book is designed to introduce students to the use of Linear Algebra to solve real-world problems. These materials were developed specifically for students and instructors working in a “flipped classroom” model that emphasizes hands-on problem-solving activities during class meetings, with students watching lectures and completing readings and assignments outside of the class.

Combinatorics on words has arisen independently within several branches of mathematics, for instance, number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's Combinatorics on Words. Since its publication, the area has developed and the authors now aim to present several more topics as well as giving deeper insights into subjects that were discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area.