You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Covers a notably broad range of topics, including some topics not generally found in linear algebra books Contains a discussion of the basics of linear algebra
Intended for graduate courses or for independent study, this book presents the basic theory of fields. The first part begins with a discussion of polynomials over a ring, the division algorithm, irreducibility, field extensions, and embeddings. The second part is devoted to Galois theory. The third part of the book treats the theory of binomials. The book concludes with a chapter on families of binomials - the Kummer theory.
Intended for a one-term course in discrete mathematics, to prepare freshmen and sophomores for further work in computer science as well as mathematics. Sets, proof techniques, logic, combinatorics, and graph theory are covered in concise form. All topics are motivated by concrete examples, often emphasizing the interplay between computer science and mathematics. Examples also illustrate all definitions. Applications and references cover a wide variety of realistic situations. Coverage of mathematical induction includes the stroung form of induction, and new sections have been added on nonhomogeneous recurrence relations and the essentials of probability.
This book is intended to be a thorough introduction to the subject of order and lattices, with an emphasis on the latter. It can be used for a course at the graduate or advanced undergraduate level or for independent study. Prerequisites are kept to a minimum, but an introductory course in abstract algebra is highly recommended, since many of the examples are drawn from this area. This is a book on pure mathematics: I do not discuss the applications of lattice theory to physics, computer science or other disciplines. Lattice theory began in the early 1890s, when Richard Dedekind wanted to know the answer to the following question: Given three subgroups EF , and G of an abelian group K, what ...
None
Fundamentals of Group Theory provides a comprehensive account of the basic theory of groups. Both classic and unique topics in the field are covered, such as an historical look at how Galois viewed groups, a discussion of commutator and Sylow subgroups, and a presentation of Birkhoff’s theorem. Written in a clear and accessible style, the work presents a solid introduction for students wishing to learn more about this widely applicable subject area. This book will be suitable for graduate courses in group theory and abstract algebra, and will also have appeal to advanced undergraduates. In addition it will serve as a valuable resource for those pursuing independent study. Group Theory is a timely and fundamental addition to literature in the study of groups.
This textbook provides an introduction to elementary category theory, with the aim of making what can be a confusing and sometimes overwhelming subject more accessible. In writing about this challenging subject, the author has brought to bear all of the experience he has gained in authoring over 30 books in university-level mathematics. The goal of this book is to present the five major ideas of category theory: categories, functors, natural transformations, universality, and adjoints in as friendly and relaxed a manner as possible while at the same time not sacrificing rigor. These topics are developed in a straightforward, step-by-step manner and are accompanied by numerous examples and ex...
This book is intended to introduce coding theory and information theory to undergraduate students of mathematics and computer science. It begins with a review of probablity theory as applied to finite sample spaces and a general introduction to the nature and types of codes. The two subsequent chapters discuss information theory: efficiency of codes, the entropy of information sources, and Shannon's Noiseless Coding Theorem. The remaining three chapters deal with coding theory: communication channels, decoding in the presence of errors, the general theory of linear codes, and such specific codes as Hamming codes, the simplex codes, and many others.
This book is an introduction to information and coding theory at the graduate or advanced undergraduate level. It assumes a basic knowledge of probability and modern algebra, but is otherwise self- contained. The intent is to describe as clearly as possible the fundamental issues involved in these subjects, rather than covering all aspects in an encyclopedic fashion. The first quarter of the book is devoted to information theory, including a proof of Shannon's famous Noisy Coding Theorem. The remainder of the book is devoted to coding theory and is independent of the information theory portion of the book. After a brief discussion of general families of codes, the author discusses linear codes (including the Hamming, Golary, the Reed-Muller codes), finite fields, and cyclic codes (including the BCH, Reed-Solomon, Justesen, Goppa, and Quadratic Residue codes). An appendix reviews relevant topics from modern algebra.
An elementary introduction to probability and mathematical finance including a chapter on the Capital Asset Pricing Model (CAPM), a topic that is very popular among practitioners and economists. Dr. Roman has authored 32 books, including a number of books on mathematics, such as Coding and Information Theory, Advanced Linear Algebra, and Field Theory, published by Springer-Verlag.