Search results for "Introduction to Module Theory"
Items we need to order for you

Substitution and Tiling Dynamics: Introduction to Self-inducing Structures
This book presents a panorama of recent developments in the theory of tilings and related dynamical systems. It contains an expanded version of courses given in 2017 at the research school associated with the Jean-Morlet chair program.Tilings have been designed, used and studied for centuries in various contexts. This field grew significantly after the discovery of aperiodic self-similar tilings in the 60s, linked to the proof of the undecidability of the Domino problem, and was driven futher by Dan Shechtman's discovery of quasicrystals in 1984. Tiling problems establish a bridge between the mutually influential fields of geometry, dynamical systems, aperiodic order, computer science, number theory, algebra and logic. The main properties of tiling dynamical systems are covered, with expositions on recent results in self-similarity (and its generalizations, fusions rules and S-adic systems), algebraic developments connected to physics, games and undecidability questions, and the spectrum of substitution tilings.
R 2,931.00

Introduction to Wavelet Modulated Inverters
AN INTRODUCTION TO Wavelet Modulated Inverters An authoritative guide to designing and constructing wavelet functions that accurately model complex circuits for better performance This is the first book to provide details, analysis, development, implementation, and performances of wavelet modulated (WM) inverters, a novel technique that keeps power systems stable and minimizes energy waste while enhancing power quality and efficiency. Written by experts in the power electronics field, it provides step-by-step procedures to implement the WM technique for single- and three-phase inverters. Also presented are key sample performance results for the new WM power inverters for different load types, which demonstrate the inverters’ simplicity, efficacy, and robustness. Beginning with the fundamentals of inverter technology, the book then describes wavelet basis functions and sampling theory with particular reference to the switching model of inverters. From there, comprehensive chapters explain: The connection between the non-uniform sampling theorem and wavelet functions to develop an ideal sampling-reconstruction process to operate an inverterThe development of scale-based linearly combined basis functions in order to successfully operate single-phase WM invertersPerformances of single-phase WM inverters for static, dynamic, and non-linear loadsThe simulation and experimental performances of three-phase wavelet modulated voltage source inverters for different loads at various operating conditions The book establishes, for the first time, a direct utilization of different concepts of the sampling theorem and signal processing in accurate modeling of the operation of single- and three-phase inverters. Figures are provided to help develop the basis of utilizing concepts of the sampling, signal processing, and wavelet theories in developing a new tool and technology for inverters. Also included are easy-to-follow mathematical derivations, as well as procedures and flowcharts to facilitate the implementation of the WM inverters. These items make this unique reference of great interest to academic researchers, industry-based researchers, and practicing engineers. It is ideally suited for senior undergraduate and graduate-level students in electrical engineering, computer engineering, applied signal processing, and power electronics courses.
R 3,776.00

Introduction to Complex Function Theory
This book provides a rigorous yet elementary introduction to the theory of analytic functions of a single complex variable. While presupposing in its readership a degree of mathematical maturity, it insists on no formal prerequisites beyond a sound knowledge of calculus. Starting from basic definitions, the text slowly and carefully develops the ideas of complex analysis to the point where such landmarks of the subject as Cauchy's theorem, the Riemann mapping theorem, and the theorem of Mittag-Leffler can be treated without sidestepping any issues of rigor. The emphasis throughout is a geometric one, most pronounced in the extensive chapter dealing with conformal mapping, which amounts essentially to a "short course" in that important area of complex function theory. Each chapter concludes with a wide selection of exercises, ranging from straightforward computations to problems of a more conceptual and thought-provoking nature.
R 2,275.70

Introduction to Number Theory
Introduction to Number Theory is a classroom-tested, student-friendly text that covers a diverse array of number theory topics, from the ancient Euclidean algorithm for finding the greatest common divisor of two integers to recent developments such as cryptography, the theory of elliptic curves, and the negative solution of Hilbert’s tenth problem. The authors illustrate the connections between number theory and other areas of mathematics, including algebra, analysis, and combinatorics. They also describe applications of number theory to real-world problems, such as congruences in the ISBN system, modular arithmetic and Euler’s theorem in RSA encryption, and quadratic residues in the construction of tournaments. Ideal for a one- or two-semester undergraduate-level course, this Second Edition:Features a more flexible structure that offers a greater range of options for course designAdds new sections on the representations of integers and the Chinese remainder theoremExpands exercise sets to encompass a wider variety of problems, many of which relate number theory to fields outside of mathematics (e.g., music)Provides calculations for computational experimentation using SageMath, a free open-source mathematics software system, as well as Mathematica® and Maple™, online via a robust, author-maintained websiteIncludes a solutions manual with qualifying course adoptionBy tackling both fundamental and advanced subjects—and using worked examples, numerous exercises, and popular software packages to ensure a practical understanding—Introduction to Number Theory, Second Edition instills a solid foundation of number theory knowledge.
R 6,692.95

Introduction to Axiomatic Set Theory
In 1963, the first author introduced a course in set theory at the University of Illinois whose main objectives were to cover Godel's work on the con sistency of the Axiom of Choice (AC) and the Generalized Continuum Hypothesis (GCH), and Cohen's work on the independence of the AC and the GCH. Notes taken in 1963 by the second author were taught by him in 1966, revised extensively, and are presented here as an introduction to axiomatic set theory. Texts in set theory frequently develop the subject rapidly moving from key result to key result and suppressing many details. Advocates of the fast development claim at least two advantages. First, key results are high lighted, and second, the student who wishes to master the subject is com pelled to develop the detail on his own. However, an instructor using a "fast development" text must devote much class time to assisting his students in their efforts to bridge gaps in the text.
R 2,762.06

Introduction to Operator Theory I
This book was written expressly to serve as a textbook for a one- or two-semester introductory graduate course in functional analysis. Its (soon to be published) companion volume, Operators on Hilbert Space, is in tended to be used as a textbook for a subsequent course in operator theory. In writing these books we have naturally been concerned with the level of preparation of the potential reader, and, roughly speaking, we suppose him to be familiar with the approximate equivalent of a one-semester course in each of the following areas: linear algebra, general topology, complex analysis, and measure theory. Experience has taught us, however, that such a sequence of courses inevitably fails to treat certain topics that are important in the study of functional analysis and operator theory. For example, tensor products are frequently not discussed in a first course in linear algebra. Likewise for the topics of convergence of nets and the Baire category theorem in a course in topology, and the connections between measure and topology in a course in measure theory. For this reason we have chosen to devote the first ten chapters of this volume (entitled Part I) to topics of a preliminary nature. In other words, Part I summarizes in considerable detail what a student should (and eventually must) know in order to study functional analysis and operator theory successfully.
R 1,588.40

Introduction to Architectural Theory
A sharp and lively text that covers issues in depth but not to the point that they become inaccessible to beginning students, An Introduction to Architectural Theory is the first narrative history of this period, charting the veritable revolution in architectural thinking that has taken place, as well as the implications of this intellectual upheaval. The first comprehensive and critical history of architectural theory over the last fifty yearssurveys the intellectual history of architecture since 1968, including criticisms of high modernism, the rise of postmodern and poststructural theory, critical regionalism and tectonicsOffers a comprehensive overview of the significant changes that architectural thinking has undergone in the past fifteen yearsIncludes an analysis of where architecture stands and where it will likely move in the coming years
R 2,882.00

Short Introduction to String Theory
Suitable for graduate students in physics and mathematics, this book presents a concise and pedagogical introduction to string theory. It focuses on explaining the key concepts of string theory, such as bosonic strings, D-branes, supersymmetry and superstrings, and on clarifying the relationship between particles, fields and strings, without assuming an advanced background in particle theory or quantum field theory, making it widely accessible to interested readers from a range of backgrounds. Important ideas underpinning current research, such as partition functions, compactification, gauge symmetries and T-duality are analysed both from the world-sheet (conformal field theory) and the space-time (effective field theory) perspective. Ideal for either self-study or a one semester graduate course, A Short Introduction to String Theory is an essential resource for students studying string theory, containing examples and homework problems to develop understanding, with fully worked solutions available to instructors.
R 1,901.99

Introduction to the Theory of Banach Representations of Groups
The theory of group representations plays an important roie in modern mathematics and its applica~ions to natural sciences. In the compulsory university curriculum it is included as a branch of algebra, dealing with representations of finite groups (see, for example, the textbook of A. I. Kostrikin [25]). The representation theory for compact, locally compact Abelian, and Lie groups is co vered in graduate courses, concentrated around functional analysis. The author of the present boo~ has lectured for many years on functional analysis at Khar'kov University. He subsequently con tinued these lectures in the form of a graduate course on the theory of group representations, in which special attention was devoted to a retrospective exposition of operator theory and harmo nic analysis of functions from the standpoint of representation theory. In this approach it was natural to consider not only uni tary, but also Banach representations, and not only representations of groups, but also of semigroups.
R 1,630.94

Computational Introduction to Number Theory and Algebra
Number theory and algebra play an increasingly significant role in computing and communications, as evidenced by the striking applications of these subjects to such fields as cryptography and coding theory. This introductory book emphasizes algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. The presentation alternates between theory and applications in order to motivate and illustrate the mathematics. The mathematical coverage includes the basics of number theory, abstract algebra and discrete probability theory. This edition now includes over 150 new exercises, ranging from the routine to the challenging, that flesh out the material presented in the body of the text, and which further develop the theory and present new applications. The material has also been reorganized to improve clarity of exposition and presentation. Ideal as a textbook for introductory courses in number theory and algebra, especially those geared towards computer science students.
R 3,266.91

Introduction to Algebraic Independence Theory
In the last five years there has been very significant progress in the development of transcendence theory. A new approach to the arithmetic properties of values of modular forms and theta-functions was found. The solution of the Mahler-Manin problem on values of modular function j(tau) and algebraic independence of numbers pi and e^(pi) are most impressive results of this breakthrough. The book presents these and other results on algebraic independence of numbers and further, a detailed exposition of methods created in last the 25 years, during which commutative algebra and algebraic geometry exerted strong catalytic influence on the development of the subject.
R 2,381.00

Introduction to Matrix Theory
This book is designed to serve as a textbook for courses offered to undergraduate and postgraduate students enrolled in Mathematics. Using elementary row operations and Gram-Schmidt orthogonalization as basic tools the text develops characterization of equivalence and similarity, and various factorizations such as rank factorization, OR-factorization, Schurtriangularization, Diagonalization of normal matrices, Jordan decomposition, singular value decomposition, and polar decomposition. Along with Gauss-Jordan elimination for linear systems, it also discusses best approximations and least-squares solutions. The book includes norms on matrices as a means to deal with iterative solutions of linear systems and exponential of a matrix. The topics in the book are dealt with in a lively manner. Each section of the book has exercises to reinforce the concepts, and problems have been added at the end of each chapter. Most of these problems are theoretical, and they do not fit into the running text linearly. The detailed coverage and pedagogical tools make this an ideal textbook for students and researchers enrolled in senior undergraduate and beginning postgraduate mathematics courses.
R 2,919.59

Introduction to Symmetry and Group Theory for Chemists
This book is based on a one-semester course for advanced undergraduates specializing in physical chemistry. I am aware that the mathematical training of most science majors is more heavily weighted towards analysis – typ- ally calculus and differential equations – than towards algebra. But it remains my conviction that the basic ideas and applications of group theory are not only vital, but not dif?cult to learn, even though a formal mathematical setting with emphasis on rigor and completeness is not the place where most chemists would feel most comfortable in learning them. The presentation here is short, and limited to those aspects of symmetry and group theory that are directly useful in interpreting molecular structure and spectroscopy. Nevertheless I hope that the reader will begin to sense some of the beauty of the subject. Symmetry is at the heart of our understanding of the physical laws of nature. If a reader is happy with what appears in this book, I must count this a success. But if the book motivates a reader to move deeper into the subject, I shall be grati?ed.
R 3,011.31

Introduction to Lie Groups and Lie Algebras
With roots in the nineteenth century, Lie theory has since found many and varied applications in mathematics and mathematical physics, to the point where it is now regarded as a classical branch of mathematics in its own right. This graduate text focuses on the study of semisimple Lie algebras, developing the necessary theory along the way. The material covered ranges from basic definitions of Lie groups to the classification of finite-dimensional representations of semisimple Lie algebras. Written in an informal style, this is a contemporary introduction to the subject which emphasizes the main concepts of the proofs and outlines the necessary technical details, allowing the material to be conveyed concisely. Based on a lecture course given by the author at the State University of New York, Stony Brook, the book includes numerous exercises and worked examples, and is ideal for graduate courses on Lie groups and Lie algebras.
R 1,968.29
Introduction to Syntactic Analysis and Theory
An Introduction to Syntactic Analysis and Theory offers beginning students a comprehensive overview of and introduction to our current understanding of the rules and principles that govern the syntax of natural languages. Includes numerous pedagogical features such as 'practice' boxes and sidebars, designed to facilitate understanding of both the 'hows' and the 'whys' of sentence structureGuides readers through syntactic and morphological structures in a progressive mannerTakes the mystery out of one of the most crucial aspects of the workings of language – the principles and processes behind the structure of sentencesIdeal for students with minimal knowledge of current syntactic research, it progresses in theoretical difficulty from basic ideas and theories to more complex and advanced, up to date concepts in syntactic theory
R 3,000.00

Introduction to Dynamical Systems
This book provides a broad introduction to the subject of dynamical systems, suitable for a one- or two-semester graduate course. In the first chapter, the authors introduce over a dozen examples, and then use these examples throughout the book to motivate and clarify the development of the theory. Topics include topological dynamics, symbolic dynamics, ergodic theory, hyperbolic dynamics, one-dimensional dynamics, complex dynamics, and measure-theoretic entropy. The authors top off the presentation with some beautiful and remarkable applications of dynamical systems to such areas as number theory, data storage, and Internet search engines. This book grew out of lecture notes from the graduate dynamical systems course at the University of Maryland, College Park, and reflects not only the tastes of the authors, but also to some extent the collective opinion of the Dynamics Group at the University of Maryland, which includes experts in virtually every major area of dynamical systems.
R 4,615.87

Introduction to Complex Systems
This book explores the interdisciplinary field of complex systems theory. By the end of the book, readers will be able to understand terminology that is used in complex systems and how they are related to one another; see the patterns of complex systems in practical examples; map current topics, in a variety of fields, to complexity theory; and be able to read more advanced literature in the field. The book begins with basic systems concepts and moves on to how these simple rules can lead to complex behavior. The author then introduces non-linear systems, followed by pattern formation, and networks and information flow in systems. Later chapters cover the thermodynamics of complex systems, dynamical patterns that arise in networks, and how game theory can serve as a framework for decision making. The text is interspersed with both philosophical and quantitative arguments, and each chapter ends with questions and prompts that help readers make more connections.“The text provides a useful overview of complex systems, with enough detail to allow a reader unfamiliar with the topic to understand the basics. The book stands out for its comprehensiveness and approachability. It will be particularly useful as a text for introductory physics courses. Tranquillo’s strength is in delivering a vast amount of information in a succinct manner.… A reader can find information quickly and efficiently—that is, in my opinion, the book’s greatest value.” (Stefani Crabtree, Physics Today)
R 3,928.24

Introduction to Mixed-Signal, Embedded Design
This textbook is written for junior/senior undergraduate and first-year graduate students in the electrical and computer engineering departments.Using PSoC mixed-signal array design, the authors define the characteristics of embedd design, embedded mixed-signal architectures, and top-down design. Optimized implementations of these designs are included to illustrate the theory. Exercises are provided at the end of each chapter for practice. Topics covered include the hardware and software used to implement analog and digital interfaces, various filter structures, amplifiers and other signal-conditioning circuits, pulse-width modulators, timers, and data structures for handling multiple similar peripheral devices.The practical exercises contained in the companion laboratory manual, which was co-authored by Cypress Staff Applications Engineer Dave Van Ess, are also based on PSoC. PSoC's integrated microcontroller, highly configurable analog/digital peripherals, and a full set of development tools make it an ideal learning tool for developing mixed-signal embedded design skills.
R 2,849.28

Introduction to Number Theory with Cryptography
Building on the success of the first edition, An Introduction to Number Theory with Cryptography, Second Edition, increases coverage of the popular and important topic of cryptography, integrating it with traditional topics in number theory. The authors have written the text in an engaging style to reflect number theory's increasing popularity. The book is designed to be used by sophomore, junior, and senior undergraduates, but it is also accessible to advanced high school students and is appropriate for independent study. It includes a few more advanced topics for students who wish to explore beyond the traditional curriculum.Features of the second edition includeOver 800 exercises, projects, and computer explorationsIncreased coverage of cryptography, including Vigenere, Stream, Transposition,and Block ciphers, along with RSA and discrete log-based systems"Check Your Understanding" questions for instant feedback to studentsNew Appendices on "What is a proof?" and on MatricesSelect basic (pre-RSA) cryptography now placed in an earlier chapter so that the topic can be covered right after the basic material on congruencesAnswers and hints for odd-numbered problemsAbout the Authors: Jim Kraft received his Ph.D. from the University of Maryland in 1987 and has published several research papers in algebraic number theory. His previous teaching positions include the University of Rochester, St. Mary's College of California, and Ithaca College, and he has also worked in communications security. Dr. Kraft currently teaches mathematics at the Gilman School.Larry Washington received his Ph.D. from Princeton University in 1974 and has published extensively in number theory, including books on cryptography (with Wade Trappe), cyclotomic fields, and elliptic curves. Dr. Washington is currently Professor of Mathematics and Distinguished Scholar-Teacher at the University of Maryland.
R 7,629.51

Introduction to the Theory of Numbers
An Introduction to the Theory of Numbers by G.H. Hardy and E. M. Wright is found on the reading list of virtually all elementary number theory courses and is widely regarded as the primary and classic text in elementary number theory. Developed under the guidance of D.R. Heath-Brown this Sixth Edition of An Introduction to the Theory of Numbers has been extensively revised and updated to guide today's students through the key milestones anddevelopments in number theory. Updates include a chapter by J.H. Silverman on one of the most important developments in number theory — modular elliptic curves and their role in the proof of Fermat's Last Theorem — a foreword by A. Wiles, and comprehensively updated end-of-chapter notes detailing the key developments in number theory. Suggestions for further reading are also included for the more avid readerThe text retains the style and clarity of previous editions making it highly suitable for undergraduates in mathematics from the first year upwards as well as an essential reference for all number theorists.
R 7,369.85


Introduction to Axiomatic Set Theory
This book presents the classic relative consistency proofs in set theory that are obtained by the device of 'inner models'. Three examples of such models are investigated in Chapters VI, VII, and VIII; the most important of these, the class of constructible sets, leads to G6del's result that the axiom of choice and the continuum hypothesis are consistent with the rest of set theory [1]I. The text thus constitutes an introduction to the results of P. Cohen concerning the independence of these axioms [2], and to many other relative consistency proofs obtained later by Cohen's methods. Chapters I and II introduce the axioms of set theory, and develop such parts of the theory as are indispensable for every relative consistency proof; the method of recursive definition on the ordinals being an import ant case in point. Although, more or less deliberately, no proofs have been omitted, the development here will be found to require of the reader a certain facility in naive set theory and in the axiomatic method, such e as should be achieved, for example, in first year graduate work (2 cycle de mathernatiques).
R 4,242.08

Introduction to Game Theory
This advanced textbook covers the central topics in game theory and provides a strong basis from which readers can go on to more advanced topics. The subject matter is approached in a mathematically rigorous, yet lively and interesting way. New definitions and topics are motivated as thoroughly as possible. Coverage includes the idea of iterated Prisoner's Dilemma (super games) and challenging game-playing computer programs.
R 2,221.79

Introduction to String Theory
Graduate students typically enter into courses on string theory having little to no familiarity with the mathematical background so crucial to the discipline. As such, this book, based on lecture notes, edited and expanded, from the graduate course taught by the author at SISSA and BIMSA, places particular emphasis on said mathematical background. The target audience for the book includes students of both theoretical physics and mathematics. This explains the book’s "strange" style: on the one hand, it is highly didactic and explicit, with a host of examples for the physicists, but, in addition, there are also almost 100 separate technical boxes, appendices, and starred sections, in which matters discussed in the main text are put into a broader mathematical perspective, while deeper and more rigorous points of view (particularly those from the modern era) are presented. The boxes also serve to further shore up the reader’s understanding of the underlying math. In writing this book, the author’s goal was not to achieve any sort of definitive conciseness, opting instead for clarity and "completeness". To this end, several arguments are presented more than once from different viewpoints and in varying contexts.
R 5,129.00

Introduction to Mathematical Structures and Proofs
As a student moves from basic calculus courses into upper-division courses in linear and abstract algebra, real and complex analysis, number theory, topology, and so on, a "bridge" course can help ensure a smooth transition. Introduction to Mathematical Structures and Proofs is a textbook intended for such a course, or for self-study. This book introduces an array of fundamental mathematical structures. It also explores the delicate balance of intuition and rigor—and the flexible thinking—required to prove a nontrivial result. In short, this book seeks to enhance the mathematical maturity of the reader. The new material in this second edition includes a section on graph theory, several new sections on number theory (including primitive roots, with an application to card-shuffling), and a brief introduction to the complex numbers (including a section on the arithmetic of the Gaussian integers). Solutions for even numbered exercises are available on springer.com for instructors adopting the text for a course.
R 1,754.64

Invitation to Model Theory
Model theory begins with an audacious idea: to consider statements about mathematical structures as mathematical objects of study in their own right. While inherently important as a tool of mathematical logic, it also enjoys connections to and applications in diverse branches of mathematics, including algebra, number theory and analysis. Despite this, traditional introductions to model theory assume a graduate-level background of the reader. In this innovative textbook, Jonathan Kirby brings model theory to an undergraduate audience. The highlights of basic model theory are illustrated through examples from specific structures familiar from undergraduate mathematics, paying particular attention to definable sets throughout. With numerous exercises of varying difficulty, this is an accessible introduction to model theory and its place in mathematics.
R 2,931.35

Introduction to Analytic Number Theory
"This book is the first volume of a two-volume textbook for undergraduates and is indeed the crystallization of a course offered by the author at the California Institute of Technology to undergraduates without any previous knowledge of number theory. For this reason, the book starts with the most elementary properties of the natural integers. Nevertheless, the text succeeds in presenting an enormous amount of material in little more than 300 pages."-—MATHEMATICAL REVIEWS
R 1,834.59

Introduction to Infinite-Dimensional Linear Systems Theory
Infinite dimensional systems is now an established area of research. Given the recent trend in systems theory and in applications towards a synthesis of time- and frequency-domain methods, there is a need for an introductory text which treats both state-space and frequency-domain aspects in an integrated fashion. The authors' primary aim is to write an introductory textbook for a course on infinite dimensional linear systems. An important consideration by the authors is that their book should be accessible to graduate engineers and mathematicians with a minimal background in functional analysis. Consequently, all the mathematical background is summarized in an extensive appendix. For the majority of students, this would be their only acquaintance with infinite dimensional systems.
R 3,079.16

Introduction to Homotopy Theory
This is a book in pure mathematics dealing with homotopy theory, one of the main branches of algebraic topology. The principal topics are as follows: Basic Homotopy; H-spaces and co-H-spaces; fibrations and cofibrations; exact sequences of homotopy sets, actions, and coactions; homotopy pushouts and pullbacks; classical theorems, including those of Serre, Hurewicz, Blakers-Massey, and Whitehead; homotopy Sets; homotopy and homology decompositions of spaces and maps; and obstruction theory. The underlying theme of the entire book is the Eckmann-Hilton duality theory. The book can be used as a text for the second semester of an advanced ungraduate or graduate algebraic topology course.
R 2,508.83

Set Theory And Foundations Of Mathematics: An Introduction To Mathematical Logic - Volume I: Set Theory
This book provides an introduction to axiomatic set theory and descriptive set theory. It is written for the upper level undergraduate or beginning graduate students to help them prepare for advanced study in set theory and mathematical logic as well as other areas of mathematics, such as analysis, topology, and algebra.The book is designed as a flexible and accessible text for a one-semester introductory course in set theory, where the existing alternatives may be more demanding or specialized. Readers will learn the universally accepted basis of the field, with several popular topics added as an option. Pointers to more advanced study are scattered throughout the text.
R 2,160.36

Recursive Introduction to the Theory of Computation
The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms. From there the book considers the complexity of computations and the notion of a complexity measure is introduced. Finally, the book culminates in considering time and space measures and in classifying computable functions as being either feasible or not. The author assumes only a basic familiarity with discrete mathematics and computing, making this textbook ideal for a graduate-level introductory course. It is based on many such courses presented by the author and so numerous exercises are included. In addition, the solutions to most of these exercises are provided.
R 1,533.60

Introduction to the Theory of Bases
Since the publication of Banach's treatise on the theory of linear operators, the literature on the theory of bases in topological vector spaces has grown enormously. Much of this literature has for its origin a question raised in Banach's book, the question whether every sepa rable Banach space possesses a basis or not. The notion of a basis employed here is a generalization of that of a Hamel basis for a finite dimensional vector space. For a vector space X of infinite dimension, the concept of a basis is closely related to the convergence of the series which uniquely correspond to each point of X. Thus there are different types of bases for X, according to the topology imposed on X and the chosen type of convergence for the series. Although almost four decades have elapsed since Banach's query, the conjectured existence of a basis for every separable Banach space is not yet proved. On the other hand, no counter examples have been found to show the existence of a special Banach space having no basis. However, as a result of the apparent overconfidence of a group of mathematicians, who it is assumed tried to solve the problem, we have many elegant works which show the tight connection between the theory of bases and structure of linear spaces.
R 1,534.32

Introduction to Graph Theory
In recent years graph theory has emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. Robin Wilson’s book has been widely used as a text for undergraduate courses in mathematics, computer science and economics, and as a readable introduction to the subject for non-mathematicians.The opening chapters provide a basic foundation course, containing definitions and examples, connectedness, Eulerian and Hamiltonian paths and cycles, and trees, with a range of applications. This is followed by two chapters on planar graphs and colouring, with special reference to the four-colour theorem. The next chapter deals with transversal theory and connectivity, with applications to network flows. A final chapter on matroid theory ties together material from earlier chapters, and an appendix discusses algorithms and their efficiency.
R 2,035.00

Introduction to Automata Theory, Languages, and Computation
This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Please note, Gradiance is no longer available with this book, as we no longer support this product.
R 7,062.00

Introduction to Coding Theory and Algebraic Geometry
These notes are based on lectures given in the semmar on "Coding Theory and Algebraic Geometry" held at Schloss Mickeln, Diisseldorf, November 16-21, 1987. In 1982 Tsfasman, Vladut and Zink, using algebraic geometry and ideas of Goppa, constructed a seqeunce of codes that exceed the Gilbert-Varshamov bound. The result was considered sensational. Furthermore, it was surprising to see these unrelated areas of mathematics collaborating. The aim of this course is to give an introduction to coding theory and to sketch the ideas of algebraic geometry that led to the new result. Finally, a number of applications of these methods of algebraic geometry to coding theory are given. Since this is a new area, there are presently no references where one can find a more extensive treatment of all the material. However, both for algebraic geometry and for coding theory excellent textbooks are available. The combination ofthe two subjects can only be found in a number ofsurvey papers. A book by C. Moreno with a complete treatment of this area is in preparation. We hope that these notes will stimulate further research and collaboration of algebraic geometers and coding theorists. G. van der Geer, J.H.van Lint Introduction to CodingTheory and Algebraic Geometry PartI -- CodingTheory Jacobus H. vanLint 11 1. Finite fields In this chapter we collect (without proof) the facts from the theory of finite fields that we shall need in this course.
R 1,410.25

Introduction To Classical And Modern Analysis And Their Application To Group Representation Theory
This book is suitable for use in any graduate course on analytical methods and their application to representation theory. Each concept is developed with special emphasis on lucidity and clarity. The book also shows the direct link of Cauchy-Pochhammer theory with the Hadamard-Reisz-Schwartz-Gel'fand et al. regularization. The flaw in earlier works on the Plancheral formula for the universal covering group of SL(2,R) is pointed out and rectified. This topic appears here for the first time in the correct form.Existing treatises are essentially magnum opus of the experts, intended for other experts in the field. This book, on the other hand, is unique insofar as every chapter deals with topics in a way that differs remarkably from traditional treatment. For example, Chapter 3 presents the Cauchy-Pochhammer theory of gamma, beta and zeta function in a form which has not been presented so far in any treatise of classical analysis.
R 2,798.19

Introduction to Proofs with Set Theory
This text is intended as an introduction to mathematical proofs for students. It is distilled from the lecture notes for a course focused on set theory subject matter as a means of teaching proofs. Chapter 1 contains an introduction and provides a brief summary of some background material students may be unfamiliar with. Chapters 2 and 3 introduce the basics of logic for students not yet familiar with these topics. Included is material on Boolean logic, propositions and predicates, logical operations, truth tables, tautologies and contradictions, rules of inference and logical arguments. Chapter 4 introduces mathematical proofs, including proof conventions, direct proofs, proof-by-contradiction, and proof-by-contraposition. Chapter 5 introduces the basics of naive set theory, including Venn diagrams and operations on sets. Chapter 6 introduces mathematical induction and recurrence relations. Chapter 7 introduces set-theoretic functions and covers injective, surjective, and bijective functions, as well as permutations. Chapter 8 covers the fundamental properties of the integers including primes, unique factorization, and Euclid's algorithm. Chapter 9 is an introduction to combinatorics; topics included are combinatorial proofs, binomial and multinomial coefficients, the Inclusion-Exclusion principle, and counting the number of surjective functions between finite sets. Chapter 10 introduces relations and covers equivalence relations and partial orders. Chapter 11 covers number bases, number systems, and operations. Chapter 12 covers cardinality, including basic results on countable and uncountable infinities, and introduces cardinal numbers. Chapter 13 expands on partial orders and introduces ordinal numbers. Chapter 14 examines the paradoxes of naive set theory and introduces and discusses axiomatic set theory. This chapter also includes Cantor's Paradox, Russel's Paradox, a discussion of axiomatic theories, an exposition on Zermelo‒Fraenkel Set Theory with the Axiom of Choice, and a brief explanation of Gödel's Incompleteness Theorems.
R 2,577.28

R 342.00

Introduction to Decision Theory
Now revised and updated, this introduction to decision theory is both accessible and comprehensive, covering topics including decision making under ignorance and risk, the foundations of utility theory, the debate over subjective and objective probability, Bayesianism, causal decision theory, game theory, and social choice theory. No mathematical skills are assumed, with all concepts and results explained in non-technical and intuitive as well as more formal ways. There are now over 140 exercises with solutions, along with a glossary of key terms and concepts. This second edition includes a new chapter on risk aversion as well as updated discussions of numerous central ideas, including Newcomb's problem, prisoner's dilemmas, and Arrow's impossibility theorem. The book will appeal particularly to philosophy students but also to readers in a range of disciplines, from computer science and psychology to economics and political science.
R 4,368.08

R 1,160.06

Introduction to Mathematical Systems Theory
This book provides an introduction to the theory of linear systems and control for students in business mathematics, econometrics, computer science, and engineering. The focus is on discrete time systems, which are the most relevant in business applications, as opposed to continuous time systems, requiring less mathematical preliminaries. The subjects treated are among the central topics of deterministic linear system theory: controllability, observability, realization theory, stability and stabilization by feedback, LQ-optimal control theory. Kalman filtering and LQC-control of stochastic systems are also discussed, as are modeling, time series analysis and model specification, along with model validation.This second edition has been updated and slightly expanded. In addition, supplementary material containing the exercises is now available on the Springer Link's book website.
R 2,015.00

Theoretical Introduction to Programming
Including easily digested information about fundamental techniques and concepts in software construction, this book is distinct in unifying pure theory with pragmatic details. Driven by generic problems and concepts, with brief and complete illustrations from languages including C, Prolog, Java, Scheme, Haskell and HTML.This book is intended to be both a how-to handbook and easy reference guide. Discussions of principle, worked examples and exercises are presented. All concepts outside introductory programming are explained with clear demarcation and dependencies so the experienced programmer can quickly locate material. Readable in a linear manner, with short mono-thematic to encourage dipping and reference. Also included are sections on open problems in software theory and practice.While little other than a novice programmer's knowledge is explicitly assumed, a certain conceptual maturity, either through commercial programming or academic training is required – each language is introduced and explained briefly as needed.
R 2,106.49


Introduction to Digital Communications
This book offers students, scientists, and engineers an extensive introduction to the theoretical fundamentals of digital communications, covering single-input single-output (SISO), multiple-input multiple-output (MIMO), and time-variant systems. Further, the main content is supplemented by a wealth of representative examples and computer simulations. The book is divided into three parts, the first of which addresses the principles of wire-line and wireless digital transmission over SISO links. Digital modulation, intersymbol interference, and various detection methods are discussed; models for realistic time-variant, wireless channels are introduced; and the equivalent time-variant baseband system model is derived. This book covers two new topics such as blockwise signal transmission and multicarrier modulation with orthogonal frequency-division multiplexing (OFDM) systems.Since not all readers may be familiar with this topic, Part II is devoted to the theory of linear time-variant systems. The generalized convolution is derived, and readers are introduced to impulse response, the delay spread function, and system functions in the frequency domain. In addition, randomly changing systems are discussed. Several new examples and graphs have been added to this book.In turn, Part III deals with MIMO systems. It describes MIMO channel models with and without spatial correlation, including the Kronecker model. Both linear and nonlinear MIMO receivers are investigated. The question of how many bits per channel use can be transmitted is answered, and maximizing channel capacity is addressed. Principles of space–time coding are outlined in order to improve transmission quality and increase data rates. In closing, the book describes multi-user MIMO schemes, which reduce interference when multiple users in the same area transmit their signals in the same time slots and frequency bands.
R 3,900.89

Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory (Fourth Edition)
This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.Just as with the first three editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.New to this edition are the Quick Check exercises at the end of each section. In all, the new edition contains about 240 new exercises. Extra examples were added to some sections where readers asked for them.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs, enumeration under group action, generating functions of labeled and unlabeled structures and algorithms and complexity.The book encourages students to learn more combinatorics, provides them with a not only useful but also enjoyable and engaging reading.The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to sales@wspc.com.The previous edition of this textbook has been adopted at various schools including UCLA, MIT, University of Michigan, and Swarthmore College. It was also translated into Korean.
R 4,094.06
















































