Algebra: Chapter 0 is a self-contained introduction to the main topics of algebra, suitable for a first sequence on the subject at the beginning graduate or upper undergraduate level. The primary distinguishing feature of the book, compared to standard textbooks in algebra, is the early introduction of categories, used as a unifying theme in the presentation of the main topics. A second feature consists of an emphasis on homological algebra: basic notions on complexes are presented as soon as modules have been introduced, and an extensive last chapter on homological algebra can form the basis for a follow-up introductory course on the subject. Approximately 1,000 exercises both provide adequate practice to consolidate the understanding of the main body of the text and offer the opportunity to explore many other topics, including applications to number theory and algebraic geometry. This will allow instructors to adapt the textbook to their specific choice of topics and provide the independent reader with a richer exposure to algebra. Many exercises include substantial hints, and navigation of the topics is facilitated by an extensive index and by hundreds of cross-references.

This volume offers a compendium of exercises of varying degree of difficulty in the theory of modules and rings. It is the companion volume to GTM 189. All exercises are solved in full detail. Each section begins with an introduction giving the general background and the theoretical basis for the problems that follow.

Finally a self-contained, one volume, graduate-level algebra text that is readable by the average graduate student and flexible enough to accommodate a wide variety of instructors and course contents. The guiding principle throughout is that the material should be presented as general as possible, consistent with good pedagogy. Therefore it stresses clarity rather than brevity and contains an extraordinarily large number of illustrative exercises.

Many years of practical experience in teaching discrete mathematics form the basis of this text book. Part I contains problems on such topics as Boolean algebra, k-valued logics, graphs and networks, elements of coding theory, automata theory, algorithms theory, combinatorics, Boolean minimization and logical design. The exercises are preceded by ample theoretical background material. For further study the reader is referred to the extensive bibliography. Part II follows the same structure as Part I, and gives helpful hints and solutions. Audience:This book will be of great value to undergraduate students of discrete mathematics, whereas the more difficult exercises, which comprise about one-third of the material, will also appeal to postgraduates and researchers.

The author, the founder of the Greek Statistical Institute, has based this book on the two volumes of his Greek edition which has been used by over ten thousand students during the past fifteen years. It can serve as a companion text for an introductory or intermediate level probability course. Those will benefit most who have a good grasp of calculus, yet, many others, with less formal mathematical background can also benefit from the large variety of solved problems ranging from classical combinatorial problems to limit theorems and the law of iterated logarithms. It contains 329 problems with solutions as well as an addendum of over 160 exercises and certain complements of theory and problems.

The fundamental mathematical tools needed to understand machine learning include linear algebra, analytic geometry, matrix decompositions, vector calculus, optimization, probability and statistics. These topics are traditionally taught in disparate courses, making it hard for data science or computer science students, or professionals, to efficiently learn the mathematics. This self-contained textbook bridges the gap between mathematical and machine learning texts, introducing the mathematical concepts with a minimum of prerequisites. It uses these concepts to derive four central machine learning methods: linear regression, principal component analysis, Gaussian mixture models and support vector machines. For students and others with a mathematical background, these derivations provide a starting point to machine learning texts. For those learning the mathematics for the first time, the methods help build intuition and practical experience with applying mathematical concepts. Every chapter includes worked examples and exercises to test understanding. Programming tutorials are offered on the book's web site.

Designed to provide tools for independent study, this book contains student-tested mathematical exercises joined with MATLAB programming exercises. Most chapters open with a review followed by theoretical and programming exercises, with detailed solutions provided for all problems including programs. Many of the MATLAB exercises are presented as Russian dolls: each question improves and completes the previous program and results are provided to validate the intermediate programs. The book offers useful MATLAB commands, advice on tables, vectors, matrices and basic commands for plotting. It contains material on eigenvalues and eigenvectors and important norms of vectors and matrices including perturbation theory; iterative methods for solving nonlinear and linear equations; polynomial and piecewise polynomial interpolation; Bézier curves; approximations of functions and integrals and more. The last two chapters considers ordinary differential equations including two point boundary value problems, and deal with finite difference methods for some partial differential equations. The format is designed to assist students working alone, with concise Review paragraphs, Math Hint footnotes on the mathematical aspects of a problem and MATLAB Hint footnotes with tips on programming.