Derek J. S. Robinson – författare

The central concept in this monograph is that of a soluble group - a group which is built up from abelian groups by repeatedly forming group extensions. It covers all the major areas, including finitely generated soluble groups, soluble groups of finite rank, modules over group rings, algorithmic problems, applications of cohomology, and finitely presented groups, whilst remaining fairly strictly within the boundaries of soluble group theory. An up-to-date survey of the area aimed at research students and academic algebraists and group theorists, it is a compendium of information that will be especially useful as a reference work for researchers in the field.

The book is an introduction to Linear Algebra with an account of its principal applications. It is addressed to students of mathematics, the physical, engineering and social sciences, and commerce. The reader is assumed to have completed the calculus sequence. Special features of the book are thorough coverage of all core areas of linear algebra, with a detailed account of such important applications as least squares, systems of linear recurrences, Markov processes, and systems of differential equations. The book also gives an introduction to some more advanced topics such as diagonalization of Hermitian matrices and Jordan form. A principal aim of the book is to make the material accessible to the reader who is not a mathematician, without loss of mathematical rigor. This is reflected in a wealth of examples, the clarity of writing and the organization of material. There is a growing need for knowledge of linear algebra that goes beyond the basic skills of solving systems of linear equations and this book is intended to meet it.

This is the second edition of the best-selling introduction to linear algebra. Presupposing no knowledge beyond calculus, it provides a thorough treatment of all the basic concepts, such as vector space, linear transformation and inner product. The concept of a quotient space is introduced and related to solutions of linear system of equations, and a simplified treatment of Jordan normal form is given.Numerous applications of linear algebra are described, including systems of linear recurrence relations, systems of linear differential equations, Markov processes, and the Method of Least Squares. An entirely new chapter on linear programing introduces the reader to the simplex algorithm with emphasis on understanding the theory behind it.The book is addressed to students who wish to learn linear algebra, as well as to professionals who need to use the methods of the subject in their own fields.

This book describes the construction of algebraic models which represent the operations of the double entry accounting system. It gives a novel, comprehensive, proof based treatment of the topic, using such concepts from abstract algebra as automata, digraphs, monoids and quotient structures.

This solution booklet is a supplement to the book “A Course in Linear Algebra with Applications”. It will be useful to lecturers and to students taking the subject since it contains complete solutions to all 283 exercises in the book.