Texts in the Mathematical Sciences – serie

This volume presents a collection of problems and exercises, together with guidelines and worked solutions, of a wide range of commonly occurring differential and integral equations. The various chapters deal with the classical type of differential equations of first and higher order; problems relating to existence and uniqueness theorems; linear differential equations; the method of the Laplace transform; integral and integro-differential equations; numerical and approximation methods; and first order partial differential equations.

Like other introductions to number theory, this text includes the usual curtsy to divisibility theory, the bow to congruence, and the little chat with quadratic reciprocity. It also includes proofs of results such as Lagrange's Four Square Theorem, the theorem behind Lucas's test for perfect numbers, the theorem that a regular n-gon is constructible just in case o(n) is a power of 2, the fact that the circle cannot be squared, Dirichlet's theorem on primes in arithmetic progressions, the Prime Number Theorem and Rademacher's partition theorem. The proofs of these theorems have been made as elementary as possible. The book includes presentations of palindromic simple continued fractions, an elementary solution of Lucas's square pyramid problem, Baker's solution for simultaneous Fermat equations, an elementary proof of Fermat's polygonal number conjecture, and the Lambek-Moser-Wild theorem.

This introduction to topology, which is a revised, rewritten, second edition of the work first published in Russian in 1980, is a primary manual of topology. It contains the basic concepts and theorems of general topology and homotopy theory, the classification of two-dimensional surfaces, an outline of smooth manifold theory and mappings of smooth manifolds. Elements of Morse and homology theory, with their application to fixed points, are also included. Finally, the role of topology in mathematical analysis, geometry, mechanics and differential equations is illustrated. The book contains many illustrations drawn by A.T. Frenko, which, while forming an integral part of the book, also reflect the visual and philosophical aspects of modern topology. Each chapter ends with a review of the recommended literature. This text is aimed at researchers and graduate students whose work involves the application of topology, homotopy and homology theories.

This volume on mathematical analysis offers a set of both traditional and new examples, and exercises with detailed solutions. It includes many topics important in current research. It begins with a comparison of real numbers viewed as a totally ordered field or, alternatively, constructed using the Dedekind cut method. Properties surrounding real numbers are explored and many interesting relationships are proven using mathematical induction. Functions are then developed with special emphasis on topics such as asymptotics, n-levels of composition and periodicity of certain functions. Sequences and series for both the discrete and continuous case are concurrently developed showing contrast wherever possible. The order of growth for sequences diverging to infinity is incorporated with its counterpart given for functions. The usual properties of functions, together with their limit theory including the differential calculus are compared carefully with examples illustrating their fundamental properties. The graphs of these functions are then closely studied giving as much detail as possible for a wide variety of functions.

This book is an extensively revised version of my textbook "¥esodot HaAlgebra HaLiniarit" (The Foundations of Linear Algebra) used at many universities in Israel. It is designed for a comprehensive one-year course in linear algebra (112 lecture hours) for mathematics majors. Therefore, I assume that the student already has a certain amount of mathematical background - including set theory, mathematical induction, basic analytic geometry, and elementary calculus - as wellas a modicum of mathematical sophistication. My intention is to provide not only a solid basis in the abstract theory of linear algebra, but also to provide examples of the application of this theory to other branches ofmathematics and computer science. Thus, for example, the introduction of finite fields is dictated by the needs of students studying algebraic coding theory as an immediate followup to their linear algebra studies. Many of the students studying linear algebra either are familiar with the care and feeding of computers before they begin their studies or are simultaneously en­ rolled in an introductory computer science course. Therefore, consideration of the more computational aspects of linear algebra - such as the solution of systems of linear equations and the calculation of eigenvalues - is delayed until all students are assumed able to write computer programs for this purpose. Beginning with Chap­ ter VII, there is an implicit assumption that the student has access to a personal computer and knows how to use it.

This is a guide to basic sections of modern functional analysis. Included are such topics as the principles of Banach and Hilbert spaces, the theory of multinormed and uniform spaces, the Riesz-Dunford holomorphic functional calculus, the Fredholm index theory, convex analysis and duality theory for locally convex spaces. More than one hundred famous "named" theorems, culminating in the Gelfand-Naimark-Segal construction for C*-algebras, are treated, and complete proofs are given. This volume, which is regarded already as a standard textbook in functional analysis, has been translated from the second, completely revised and updated Russian edition. It incorporates new sections on the Schwartz spaces of distributions, Radon measures, and a supplementary list of theoretical exercises and problems.

Starting at an introductory level, this work leads to important and often new results in synthetic differential geometry. From rudimentary analysis the book moves to such results as: a new proof of De Rham's theorem; the synthetic view of global action, going as far as the Weil characteristic homomorphism; the systematic account of structured Lie objects, such as Riemannian, symplectic, or Poisson Lie objects; the view of global Lie algebras as Lie algebras of a Lie group in the synthetic sense; and, lastly, the synthetic construction of symplectic structure on the cotangent bundle in general. Thus, while the book is limited to a naive point of view developing synthetic differential geometry as a theory in itself, the author nevertheless treats somewhat advanced topics, which are classic in classical differential geometry but new in the synthetic context.

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.

This volume serves as an elementary textbook and reference book in sampling methods. The first two chapters provide the basis for the different techniques which are treated in detail in the remaining 11 chapters. Chapters 3-6 deal with basic sampling schemes such as simple random sampling, unequal probability sampling, stratified sampling, and systematic sampling. Chapters 7 and 8 cover ratio, product, and regression estimators, while in Chapters 9-11 other sampling schemes are discussed, such as multiphase, cluster, and multistage sampling. Chapter 12 is devoted to the estimation of the size of mobile populations, and the last chapter considers techniques for dealing with nonresponse and surveys involving confidential data. The material presented uses only elementary algebraic symbols. Formulas appropriate to different sampling strategies have been presented without proofs. Important definitions and algebraic expressions have been placed in boxes to enable quick overviews. Readers should benefit from the many solved examples and exercises included.

This text explores several aspects of discrete Hamiltonian systems. It provides interconnections between symplectic systems, recessive and dominant solutions, various discrete Riccati equations, and continued fraction representations of solutions of Riccati equations. It also covers variable step size discrete variational theory, a discrete Legendre transformation from discrete Euler-Lagrange equations to discrete Hamiltonian systems. Use is made of the implicit function theorem to show the importance of step size in numerical solutions of Hamiltonian systems. An "a priori" step size criterion shows how one can avoid parasitic numerical solutions.

The general idea advocated in this work is to start from complicated mathematical models describing wave motion as it results from the rules of continuum mechanics, and then to find a simpler viewpoint that still keeps everything essential preserved. Special attention is paid to the description of the sources of nonlinearities. The complexities in modelling are demonstrated by several examples including solitons, propagating instabilities and waves in waveguides. The selected case studies show some unconventional approaches in order to explain the richness of nonlinear wave motion. The final chapters are of more general character, including the essays on nonlinearity, beauty, and complexity. In this way, the thread of the analysis is the following: simple basic arguments result in a complicated theory that, in turn, needs certain simplifications in order to grasp the physical phenomena involved. What makes this book special compared to other books in the field is that all the examples are cast into a general philosophical network of complexity and simplicity.

This book examines the complicated subject of Partial Differential Equations (PDEs). It involves the reader throughout by presenting theory, examples and exercises together. Both the classical and abstract aspects of the theory are dealt with, so that, for example, classical and generalised solutions in Sobolev and distribution spaces are treated. Most of the work is devoted to second or higher order PDEs; part of the distribution theory is included, covering Dirac's delta distribution delta function. Many practical tools are offered for solving important problems with the basic three PDEs, namely the wave equation, the Laplace equation, the heat equation and their generalizations. The majority of the problems are mathematical in character, although often physical interpretations are given. This volume is intended for undergraduate and graduate students in mathematics, physics technology and economics interested in PDEs for modelling complex systems.

This volume covers the principal branches of graph theory in more than a thousand exercises of varying complexity. Each section starts with the main definitions and a brief theoretical discussion, which will serve as a reminder when solving the problems. Answers and hints are supplied separately. Topics include trees, independence and coverings, matchings, tours, planarity, colourings, degree sequences, connectivity, digraphs and hypergraphs. This work is intended for researchers, lecturers and graduate students in graph theory, combinatorics, VLSI design, circuits and systems, and mathematical programming and optimization.

This text contains almost 350 exercises in basic ring theory, with the solutions given in as much detail as possible. Subjects treated include zero divisors, ring homomorphisms, divisibility in integral domains, division rings, automorphisms, the tensor product, artinian and noetherian rings, socle and radical rings, semisimple rings, polynomial rings, rings of quotients, and rings of continuous functions. This volume is recommended for lecturers and graduate students involved in associative rings and algebras, commutative rings and algebras, algebraic number theory, field theory and polynomials, order, lattices, and general topology.

This volume on complex analysis offers an exposition of the theory of complex analysis via a comprehensive set of examples and exercises. The book is self-contained and the exposition of new notions and methods is introduced step-by-step. A minimal amount of expository theory is included at the beginning of each section in the preliminaries, with maximum effort placed on well-selected examples and exercises capturing the essence of the material. The examples contain complete solutions and serve as a model for solving similar problems given in the exercises. The readers are left to find the solution in the exercises; the answers, and occasionally, some hints, are given. Special sections contain so-called composite examples which consist of combinations of different types of examples explaining some problems completely and giving the reader an opportunity to check all his previously accepted knowledge.

This volume is dedicated to the use of lattice theory in module theory. Its main purpose is to present all module-theoretic results that can be proved by lattice theory only, and to develop the theory necessary to do so. The results treated fall into categories such as the origins of lattice theory, module-theoretic results generalized in modular and likely compactly generated lattices, very special module-theoretic results generalized in lattices, and new concepts in lattices introduced by the author.

This title investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. Aiming to provide an introduction to the topic, the text requires only basic pre-requisites. Rather than attempting to be encyclopedic, it illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature.

This work on Abelian Group Theory (or Group Theory) to cover elementary results in Abelian Groups. It contains comprehensive coverage of almost all the topics related to the theory and is designed to be used as a course book for students at both undergraduate and graduate level. The text caters to students of differing capabilities by categorising the exercises in each chapter according to their level of difficulty starting with simples exercises (marked S1, S2 etc), medium difficulty (M1, M2 etc) and ending with the difficult exercises (D1, D2 etc). Solutions for all of the exercises are included. This book should also appeal to experts in the field as an excellent reference to a large number of examples in Group Theory.

The understanding of results and notions for a student in mathematics requires solving ex­ ercises. The exercises are also meant to test the reader's understanding of the text material, and to enhance the skill in doing calculations. This book is written with these three things in mind. It is a collection of more than 450 exercises in Functional Analysis, meant to help a student understand much better the basic facts which are usually presented in an introductory course in Functional Analysis. Another goal of this book is to help the reader to understand the richness of ideas and techniques which Functional Analysis offers, by providing various exercises, from different topics, from simple ones to, perhaps, more difficult ones. We also hope that some of the exercises herein can be of some help to the teacher of Functional Analysis as seminar tools, and to anyone who is interested in seeing some applications of Functional Analysis. To what extent we have managed to achieve these goals is for the reader to decide.

Unlike a traditional textbook, this book deals completely with Case Studies and Projects. The Case Studies and Projects involve Mathematical and Computational Methods from the three key areas of ODEs, PDEs and Optimization. The leading author, Dr Caldwell, has had extensive experience of Mathematical Modelling throughout his career in both university teaching and industry and was instructor for a team of three Hong Kong mathematics undergraduate students, one of which was Mr Ng, the second author, who won the first place award, Meritorious, in the 2000 Netease Cup China Undergraduate Mathematical Contest in Modelling (CUMCM). Mathematical Modelling is most effectively taught using a Case Study approach. An important aspect of the book is the use of scientific computer software packages such as MAPLE for symbolic algebraic manipulations, MATLAB for numerical simulation and LINDO for linear programming. The book will be useful for senior undergraduates/postgraduates using Mathematical Modelling as part of their Programmes in areas including Mathematics, Engineering, Science and Management Science. It will also prove helpful for Research students in these areas, Industrialists with Mo

This book is based on the lecture notes from a course we taught at Penn State University during the fall of 2002. The main goal of the course was to give a complete and detailed proof of the Morse Homology Theorem (Theo­ rem 7.4) at a level appropriate for second year graduate students. The course was designed for students who had a basic understanding of singular homol­ ogy, CW-complexes, applications of the existence and uniqueness theorem for O.D.E.s to vector fields on smooth Riemannian manifolds, and Sard's Theo­ rem. We would like to thank the following students for their participation in the course and their help proofreading early versions of this manuscript: James Barton, Shantanu Dave, Svetlana Krat, Viet-Trung Luu, and Chris Saunders. We would especially like to thank Chris Saunders for his dedication and en­ thusiasm concerning this project and the many helpful suggestions he made throughout the development of this text. We would also like to thank Bob Wells for sharing with us his extensive knowledge of CW-complexes, Morse theory, and singular homology. Chapters 3 and 6, in particular, benefited significantly from the many insightful conver­ sations we had with Bob Wells concerning a Morse function and its associated CW-complex.

Starting at an introductory level, the book leads rapidly to important and often new results in synthetic differential geometry. From rudimentary analysis the book moves to such important results as: a new proof of De Rham's theorem; the synthetic view of global action, going as far as the Weil characteristic homomorphism; the systematic account of structured Lie objects, such as Riemannian, symplectic, or Poisson Lie objects; the view of global Lie algebras as Lie algebras of a Lie group in the synthetic sense; and lastly the synthetic construction of symplectic structure on the cotangent bundle in general. Thus while the book is limited to a naive point of view developing synthetic differential geometry as a theory in itself, the author nevertheless treats somewhat advanced topics, which are classic in classical differential geometry but new in the synthetic context. Audience: The book is suitable as an introduction to synthetic differential geometry for students as well as more qualified mathematicians.

This book explores several aspects of discrete Hamiltonian systems. It is unique in that it provides interconnections between symplectic systems, recessive and dominant solutions, various discrete Riccati equations, and continued fraction representations of solutions of Riccati equations. It also presents variable step size discrete variational theory, a discrete Legendre transformation from discrete Euler-Lagrange equations to discrete Hamiltonian systems. Novel use is made of the implicit function theorem to show the importance of step size in numerical solutions of Hamiltonian systems. An 'a priori' step size criterion shows how one can avoid parasitic numerical solutions. This book is accessible to students of mathematics, engineering, physics, chemistry and economics at the senior or beginning graduate level who have completed a course in matrix theory. It provides foundation work for engineering students studying optimal control and estimation as well as the variational problems arising in physics, chemistry, and economics. Audience: Mathematics, engineering and physics students who have had a course in matrix theory.

This volume presents a valuable and comprehensive collection of problems and exercises, together with guidelines and worked solutions, of a wide range of the most important commonly occurring differential and integral equations. The book is divided into two parts. Part I, which comprises eight chapters, contains the problems and exercises, and Part II, having eight corresponding chapters, presents the worked solutions. The various chapters deal, respectively, with: (1) the classical type of differential equations of first and higher order; (2) problems relating to existence and uniqueness theorems; (3) linear differential equations; (4) the method of the Laplace transform; (5) integral and integro-differential equations; (6) numerical and approximation methods; and (7) first-order partial differential equations. The final chapter (8) presents a miscellaneous selection of problems and exercises dealing with the deepest areas of differential, integral and partial differential equations. Many of the problems discussed are original, and all have been tried and tested in a teaching environment.This volume provides an invaluable guide to the solving of differential and integral equations and can be recommended to all researchers, students and teachers, whose work involves this fundamental aspect of mathematics.

This Introduction to Topology, which is a thoroughly revised, extensively rewritten, second edition of the work first published in Russian in 1980, is a primary manual of topology. It contains the basic concepts and theorems of general topology and homotopy theory, the classification of two-dimensional surfaces, an outline of smooth manifold theory and mappings of smooth manifolds. Elements of Morse and homology theory, with their application to fixed points, are also included. Finally, the role of topology in mathematical analysis, geometry, mechanics and differential equations is illustrated. Introduction to Topology contains many attractive illustrations drawn by A. T. Frenko, which, while forming an integral part of the book, also reflect the visual and philosophical aspects of modern topology. Each chapter ends with a review of the recommended literature. Audience: Researchers and graduate students whose work involves the application of topology, homotopy and homology theories.

This volume on mathematical analysis offers a comprehensive set of both traditional and new examples and exercises with detailed solutions. It includes many topics important in current research that are not found in other basic analysis books. It begins with a comparison of real numbers viewed as a totally ordered field or, alternatively, constructed using the Dedekind cut method. Properties surrounding real numbers are explored and many interesting relationships are proven using mathematical induction. Functions are then developed with special emphasis on topics such as asymptotics, n-levels of composition and periodicity of certain functions. Sequences and series for both the discrete and continuous case are concurrently developed showing contrast wherever possible. The order of growth for sequences diverging to infinity is incorporated with its counterpart given for functions. The usual properties of functions, together with their limit theory including the differential calculus are compared carefully with examples illustrating their fundamental properties.The graphs of these functions are then closely studied giving as much detail as possible for a wide variety of functions. Audience: Undergraduate and graduate students in all areas of mathematical science and its applications.

This volume presents a course in linear algebra for undergraduate mathematics students. It is considerably wider in its scope than most of the available methods and prepares the students for advanced work in algebra, differential equations, and functional analysis. Therefore, for example, it is transformation-oriented rather than matrix oriented, and whenever possible results are proved for arbitrary vector spaces and not merely for finite-dimensional vector spaces. Also, by proving results for vector spaces over arbitrary fields, rather than only the field of real or complex numbers, it prepares the way for the study of algebraic coding theory, automata theory, and other subjects in theoretical computer science. Topics are dealt with thoroughly, including ones that normally do not feature in undergraduate textbooks, and many novel and challenging exercises are given. The fact that most students are computer-literate is taken into account, not so much by emphasizing computational aspects of linear algebra which are best left to the computer, but by concentrating on the theory behind it. Audience: Recommended for a one-year undergraduate course in linear algebra.

This is a concise guide to basic sections of modern functional analysis. Included are such topics as the principles of Banach and Hilbert spaces, the theory of multinormed and uniform spaces, the Riesz-Dunford holomorphic functional calculus, the Fredholm index theory, convex analysis and duality theory for locally convex spaces. More than one hundred famous 'named' theorems, culminating in the Gelfand-Naimark-Segal construction for C*-algebras, are treated, and complete proofs are given. This volume, which is regarded already as a standard textbook in functional analysis, has been translated from the second, completely revised and updated Russian edition. It incorporates new sections on the Schwartz spaces of distributions, Radon measures, and a supplementary list of theoretical exercises and problems. Audience: This monograph will be of value to researchers and students who are interested in functional analysis.

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.