Texts in the Mathematical Sciences – serie

Many important phenomena are described and modeled by means of differential and integral equations. To understand these phenomena necessarily implies being able to solve the differential and integral equations that model them. Such equations, and the development of techniques for solving them, have always held a privileged place in the mathematical sciences. Today, theoretical advances have led to more abstract and comprehensive theories which are increasingly more complex in their mathematical concepts. Theoretical investigations along these lines have led to even more abstract and comprehensive theories, and to increasingly complex mathematical concepts. Long-standing teaching practice has, however, shown that the theory of differential and integral equations cannot be studied thoroughly and understood by mere contemplation. This can only be achieved by acquiring the necessary techniques; and the best way to achieve this is by working through as many different exercises as possible. The eight chapters of this book contain a large number of problems and exercises, selected on the basis of long experience in teaching students, which together with the author's original problems cover the whole range of current methods employed in solving the integral, differential equations, and the partial differential equations of order one, without, however, renouncing the classical problems. Every chapter of this book begins with the succinct theoretical exposition of the minimum of knowledge required to solve the problems and exercises therein.

Like other introductions to number theory, this one 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 phi(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. We have made the proofs of these theorems as elementary as possible. Unique to The Queen of Mathematics are its presentations of the topic 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.

Topology as a subject, in our opinion, plays a central role in university education. It is not really possible to design courses in differential geometry, mathematical analysis, differential equations, mechanics, functional analysis that correspond to the temporary state of these disciplines without involving topological concepts. Therefore, it is essential to acquaint students with topo­ logical research methods already in the first university courses. This textbook is one possible version of an introductory course in topo­ logy and elements of differential geometry, and it absolutely reflects both the authors' personal preferences and experience as lecturers and researchers. It deals with those areas of topology and geometry that are most closely related to fundamental courses in general mathematics. The educational material leaves a lecturer a free choice in designing his own course or his own seminar. We draw attention to a number of particularities in our book. The first chap­ ter, according to the authors' intention, should acquaint readers with topolo­ gical problems and concepts which arise from problems in geometry, analysis, and physics. Here, general topology (Ch. 2) is presented by introducing con­ structions, for example, related to the concept of quotient spaces, much earlier than various other notions of general topology thus making it possible for students to study important examples of manifolds (two-dimensional surfaces, projective spaces, orbit spaces, etc.) as topological spaces, immediately.

It is hard to imagine that another elementary analysis book would contain ma­ terial that in some vision could qualify as being new and needed for a discipline already abundantly endowed with literature. However, to understand analysis, be­ ginning with the undergraduate calculus student through the sophisticated math­ ematically maturing graduate student, the need for examples and exercises seems to be a constant ingredient to foster deeper mathematical understanding. To a talented mathematical student, many elementary concepts seem clear on their first encounter. However, it is the belief of the authors, this understanding can be deepened with a guided set of exercises leading from the so called "elementary" to the somewhat more "advanced" form. Insight is instilled into the material which can be drawn upon and implemented in later development. The first year graduate student attempting to enter into a research environment begins to search for some original unsolved area within the mathematical literature. It is hard for the student to imagine that in many circumstances the advanced mathematical formulations of sophisticated problems require attacks that draw upon, what might be termed elementary techniques. However, if a student has been guided through a serious repertoire of examples and exercises, he/she should certainly see connections whenever they are encountered.

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.

to the English Translation 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. With standard provisos the presentation is self-contained, exposing about a h- dred famous "named" theorems furnished with complete proofs and culminating in the Gelfand-Nalmark-Segal construction for C*-algebras. The first Russian edition was printed by the Siberian Division of "Nauka" P- lishers in 1983. Since then the monograph has served as the standard textbook on functional analysis at the University of Novosibirsk. This volume is translated from the second Russian edition printed by the Sobolev Institute of Mathematics of the Siberian Division of the Russian Academy of Sciences· in 1995. It incorporates new sections on Radon measures, the Schwartz spaces of distributions, and a supplementary list of theoretical exercises and problems. This edition was typeset using AMS-'lEX, the American Mathematical Society's 'lEX system. To clear my conscience completely, I also confess that := stands for the definor, the assignment operator, signifies the end of the proof.

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.

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.

Modern statistics consists of methods which help in drawing inferences about the population under consideration. These populations may actually exist, or could be generated by repeated· experimentation. The medium of drawing inferences about the population is the sample, which is a subset of measurements selected from the population. Each measurement in the sample is used for making inferences about the population. The populations and also the methods of sample selection differ from one field of science to the other. Social scientists use surveys tocollectthe sample information, whereas the physical scientists employ the method of experimentation for obtaining this information. This is because in social sciences the factors that cause variation in the measurements on the study variable for the population units can not be controlled, whereas in physical sciences these factors can be controlled, at least to some extent, through proper experimental design. Several excellent books on sampling theory are available in the market. These books discuss the theory of sample surveys in great depth and detail, and are suited to the postgraduate students majoring in statistics. Research workers in the field of sampling methodology can also make use of these books. However, not many suitable books are available, which can be used by the students and researchers in the fields of economics, social sciences, extension education, agriculture, medical sciences, business management, etc. These students and workers usually conduct sample surveys during their research projects.

This book should be accessible to students who have had a first course in matrix theory. The existence and uniqueness theorem of Chapter 4 requires the implicit function theorem, but we give a self-contained constructive proof ofthat theorem. The reader willing to accept the implicit function theorem can read the book without an advanced calculus background. Chapter 8 uses the Moore-Penrose pseudo-inverse, but is accessible to students who have facility with matrices. Exercises are placed at those points in the text where they are relevant. For U. S. universities, we intend for the book to be used at the senior undergraduate level or beginning graduate level. Chapter 2, which is on continued fractions, is not essential to the material of the remaining chapters, but is intimately related to the remaining material. Continued fractions provide closed form representations of the extreme solutions of some discrete matrix Riccati equations. Continued fractions solution methods for Riccati difference equations provide an approach analogous to series solution methods for linear differential equations. The book develops several topics which have not been available at this level. In particular, the material of the chapters on continued fractions (Chapter 2), symplectic systems (Chapter 3), and discrete variational theory (Chapter 4) summarize recent literature. Similarly, the material on transforming Riccati equations presented in Chapter 3 gives a self-contained unification of various forms of Riccati equations. Motivation for our approach to difference equations came from the work of Harris, Vaughan, Hartman, Reid, Patula, Hooker, Erbe & Van, and Bohner.

At the end of the twentieth century, nonlinear dynamics turned out to be one of the most challenging and stimulating ideas. Notions like bifurcations, attractors, chaos, fractals, etc. have proved to be useful in explaining the world around us, be it natural or artificial. However, much of our everyday understanding is still based on linearity, i. e. on the additivity and the proportionality. The larger the excitation, the larger the response-this seems to be carved in a stone tablet. The real world is not always reacting this way and the additivity is simply lost. The most convenient way to describe such a phenomenon is to use a mathematical term-nonlinearity. The importance of this notion, i. e. the importance of being nonlinear is nowadays more and more accepted not only by the scientific community but also globally. The recent success of nonlinear dynamics is heavily biased towards temporal characterization widely using nonlinear ordinary differential equations. Nonlinear spatio-temporal processes, i. e. nonlinear waves are seemingly much more complicated because they are described by nonlinear partial differential equations. The richness of the world may lead in this case to coherent structures like solitons, kinks, breathers, etc. which have been studied in detail. Their chaotic counterparts, however, are not so explicitly analysed yet. The wavebearing physical systems cover a wide range of phenomena involving physics, solid mechanics, hydrodynamics, biological structures, chemistry, etc.

The book Partial Differential Equations through Examples and Exercises has evolved from the lectures and exercises that the authors have given for more than fifteen years, mostly for mathematics, computer science, physics and chemistry students. By our best knowledge, the book is a first attempt to present the rather complex subject of partial differential equations (PDEs for short) through active reader-participation. Thus this book is a combination of theory and examples. In the theory of PDEs, on one hand, one has an interplay of several mathematical disciplines, including the theories of analytical functions, harmonic analysis, ODEs, topology and last, but not least, functional analysis, while on the other hand there are various methods, tools and approaches. In view of that, the exposition of new notions and methods in our book is "step by step". A minimal amount of expository theory is included at the beginning of each section Preliminaries with maximum emphasis placed on well selected examples and exercises capturing the essence of the material. Actually, we have divided the problems into two classes termed Examples and Exercises (often containing proofs of the statements from Preliminaries). The examples contain complete solutions, and also 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 still given. The book is implicitly divided in two parts, classical and abstract.

This book supplements the textbook of the authors" Lectures on Graph The­ ory" [6] by more than thousand exercises of varying complexity. The books match each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs. The exercises are grouped into eleven chapters and numerous sections accord­ ing to the topics of graph theory: paths, cycles, components, subgraphs, re­ constructibility, operations on graphs, graphs and matrices, trees, independence, matchings, coverings, connectivity, matroids, planarity, Eulerian and Hamiltonian graphs, degree sequences, colorings, digraphs, hypergraphs. Each section starts with main definitions and brief theoretical discussions. They constitute a minimal background, just a reminder, for solving the exercises. the presented facts and a more extended exposition may be found in Proofs of the mentioned textbook of the authors, as well as in many other books in graph theory. Most exercises are supplied with answers and hints. In many cases complete solutions are given. At the end of the book you may find the index of terms and the glossary of notations. The "Bibliography" list refers only to the books used by the authors during the preparation of the exercisebook. Clearly, it mentions only a fraction of available books in graph theory. The invention of the authors was also driven by numerous journal articles, which are impossible to list here.

Each undergraduate course of algebra begins with basic notions and results concerning groups, rings, modules and linear algebra. That is, it begins with simple notions and simple results. Our intention was to provide a collection of exercises which cover only the easy part of ring theory, what we have named the "Basics of Ring Theory". This seems to be the part each student or beginner in ring theory (or even algebra) should know - but surely trying to solve as many of these exercises as possible independently. As difficult (or impossible) as this may seem, we have made every effort to avoid modules, lattices and field extensions in this collection and to remain in the ring area as much as possible. A brief look at the bibliography obviously shows that we don't claim much originality (one could name this the folklore of ring theory) for the statements of the exercises we have chosen (but this was a difficult task: indeed, the 28 titles contain approximatively 15.000 problems and our collection contains only 346). The real value of our book is the part which contains all the solutions of these exercises. We have tried to draw up these solutions as detailed as possible, so that each beginner can progress without skilled help. The book is divided in two parts each consisting of seventeen chapters, the first part containing the exercises and the second part the solutions.

The book Complex Analysis through Examples and Exercises has come out from the lectures and exercises that the author held mostly for mathematician and physists . The book is an attempt to present the rat her involved subject of complex analysis through an active approach by the reader. Thus this book is a complex combination of theory and examples. Complex analysis is involved in all branches of mathematics. It often happens that the complex analysis is the shortest path for solving a problem in real circum­ stances. We are using the (Cauchy) integral approach and the (Weierstrass) power se ries approach . In the theory of complex analysis, on the hand one has an interplay of several mathematical disciplines, while on the other various methods, tools, and approaches. In view of that, the exposition of new notions and methods in our book is taken step by step. A minimal amount of expository theory is included at the beinning of each section, the Preliminaries, with maximum effort placed on weil selected examples and exercises capturing the essence of the material. Actually, I have divided the problems into two classes called Examples and Exercises (some of them often also contain proofs of the statements from the Preliminaries). 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 exercisesj the answers, and, occasionally, some hints, are still given.

It became more and more usual, from, say, the 1970s, for each book on Module Theory, to point out and prove some (but in no more than 15 to 20 pages) generalizations to (mostly modular) lattices. This was justified by the nowadays widely accepted perception that the structure of a module over a ring is best understood in terms of the lattice struc­ ture of its submodule lattice. Citing Louis H. Rowen "this important example (the lattice of all the submodules of a module) is the raison d'etre for the study of lattice theory by ring theorists". Indeed, many module-theoretic results can be proved by using lattice theory alone. The purpose of this book is to collect and present all and only the results of this kind, although for this purpose one must develop some significant lattice theory. The results in this book are of the following categories: the folklore of Lattice Theory (to be found in each Lattice Theory book), module­ theoretic results generalized in (modular, and possibly compactly gen­ erated) lattices (to be found in some 6 to 7 books published in the last 20 years), very special module-theoretic results generalized in lattices (e. g. , purity in Chapter 9 and several dimensions in Chapter 13, to be found mostly in [27], respectively, [34] and [18]) and some new con­ cepts (e. g.

Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book 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 book, in some sense, began to be written by the first author in 1983, when optional lectures on Abelian groups were held at the Fac­ ulty of Mathematics and Computer Science,'Babes-Bolyai' University in Cluj-Napoca, Romania. From 1992,these lectures were extended to a twosemester electivecourse on abelian groups for undergraduate stu­ dents, followed by a twosemester course on the same topic for graduate students in Algebra. All the other authors attended these two years of lectures and are now Assistants to the Chair of Algebra of this Fac­ ulty. The first draft of this collection, including only exercises solved by students as home works, the last ten years, had 160pages. We felt that there is a need for a book such as this one, because it would provide a nice bridge between introductory Abelian Group Theory and more advanced research problems. The book InfiniteAbelianGroups, published by LaszloFuchsin two volumes 1970 and 1973 willwithout doubt last as the most important guide for abelian group theorists. Many exercises are selected from this source but there are plenty of other bibliographical items (see the Bibliography) which were used in order to make up this collection. For some of the problems stated, recent developments are also given. Nevertheless, there are plenty of elementary results (the so called 'folklore') in Abelian Group Theory whichdo not appear in any written material. It is also one purpose of this book to complete this gap.

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.

Over the past decade there has been an increasing demand for suitable material in the area of mathematical modelling as applied to science, engineering, business and management. Recent developments in computer technology and related software have provided the necessary tools of increasing power and sophistication which have significant implications for the use and role of mathematical modelling in the above disciplines. In the past, traditional methods have relied heavily on expensive experimentation and the building of scaled models, but now a more flexible and cost effective approach is available through greater use of mathematical modelling and computer simulation. In particular, developments in computer algebra, symbolic manipulation packages and user friendly software packages for large scale problems, all have important implications in both the teaching of mathematical modelling and, more importantly, its use in the solution of real world problems. Many textbooks have been published which cover the art and techniques of modelling as well as specific mathematical modelling techniques in specialist areas within science and business. In most of these books the mathematical material tends to be rather tailor made to fit in with a one or two semester course for teaching students at the undergraduate or postgraduate level, usually the former. This textbook is quite different in that it is intended to build on and enhance students’ modelling skills using a combination of case studies and projects.

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 should be accessible to students who have had a first course in matrix theory. The existence and uniqueness theorem of Chapter 4 requires the implicit function theorem, but we give a self-contained constructive proof ofthat theorem. The reader willing to accept the implicit function theorem can read the book without an advanced calculus background. Chapter 8 uses the Moore-Penrose pseudo-inverse, but is accessible to students who have facility with matrices. Exercises are placed at those points in the text where they are relevant. For U. S. universities, we intend for the book to be used at the senior undergraduate level or beginning graduate level. Chapter 2, which is on continued fractions, is not essential to the material of the remaining chapters, but is intimately related to the remaining material. Continued fractions provide closed form representations of the extreme solutions of some discrete matrix Riccati equations. Continued fractions solution methods for Riccati difference equations provide an approach analogous to series solution methods for linear differential equations. The book develops several topics which have not been available at this level. In particular, the material of the chapters on continued fractions (Chapter 2), symplectic systems (Chapter 3), and discrete variational theory (Chapter 4) summarize recent literature. Similarly, the material on transforming Riccati equations presented in Chapter 3 gives a self-contained unification of various forms of Riccati equations. Motivation for our approach to difference equations came from the work of Harris, Vaughan, Hartman, Reid, Patula, Hooker, Erbe & Van, and Bohner.

Many important phenomena are described and modeled by means of differential and integral equations. To understand these phenomena necessarily implies being able to solve the differential and integral equations that model them. Such equations, and the development of techniques for solving them, have always held a privileged place in the mathematical sciences. Today, theoretical advances have led to more abstract and comprehensive theories which are increasingly more complex in their mathematical concepts. Theoretical investigations along these lines have led to even more abstract and comprehensive theories, and to increasingly complex mathematical concepts. Long-standing teaching practice has, however, shown that the theory of differential and integral equations cannot be studied thoroughly and understood by mere contemplation. This can only be achieved by acquiring the necessary techniques; and the best way to achieve this is by working through as many different exercises as possible. The eight chapters of this book contain a large number of problems and exercises, selected on the basis of long experience in teaching students, which together with the author's original problems cover the whole range of current methods employed in solving the integral, differential equations, and the partial differential equations of order one, without, however, renouncing the classical problems. Every chapter of this book begins with the succinct theoretical exposition of the minimum of knowledge required to solve the problems and exercises therein.

Topology as a subject, in our opinion, plays a central role in university education. It is not really possible to design courses in differential geometry, mathematical analysis, differential equations, mechanics, functional analysis that correspond to the temporary state of these disciplines without involving topological concepts. Therefore, it is essential to acquaint students with topo­ logical research methods already in the first university courses. This textbook is one possible version of an introductory course in topo­ logy and elements of differential geometry, and it absolutely reflects both the authors' personal preferences and experience as lecturers and researchers. It deals with those areas of topology and geometry that are most closely related to fundamental courses in general mathematics. The educational material leaves a lecturer a free choice in designing his own course or his own seminar. We draw attention to a number of particularities in our book. The first chap­ ter, according to the authors' intention, should acquaint readers with topolo­ gical problems and concepts which arise from problems in geometry, analysis, and physics. Here, general topology (Ch. 2) is presented by introducing con­ structions, for example, related to the concept of quotient spaces, much earlier than various other notions of general topology thus making it possible for students to study important examples of manifolds (two-dimensional surfaces, projective spaces, orbit spaces, etc.) as topological spaces, immediately.

It is hard to imagine that another elementary analysis book would contain ma­ terial that in some vision could qualify as being new and needed for a discipline already abundantly endowed with literature. However, to understand analysis, be­ ginning with the undergraduate calculus student through the sophisticated math­ ematically maturing graduate student, the need for examples and exercises seems to be a constant ingredient to foster deeper mathematical understanding. To a talented mathematical student, many elementary concepts seem clear on their first encounter. However, it is the belief of the authors, this understanding can be deepened with a guided set of exercises leading from the so called "elementary" to the somewhat more "advanced" form. Insight is instilled into the material which can be drawn upon and implemented in later development. The first year graduate student attempting to enter into a research environment begins to search for some original unsolved area within the mathematical literature. It is hard for the student to imagine that in many circumstances the advanced mathematical formulations of sophisticated problems require attacks that draw upon, what might be termed elementary techniques. However, if a student has been guided through a serious repertoire of examples and exercises, he/she should certainly see connections whenever they are encountered.

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.

to the English Translation 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. With standard provisos the presentation is self-contained, exposing about a h- dred famous "named" theorems furnished with complete proofs and culminating in the Gelfand-Nalmark-Segal construction for C*-algebras. The first Russian edition was printed by the Siberian Division of "Nauka" P- lishers in 1983. Since then the monograph has served as the standard textbook on functional analysis at the University of Novosibirsk. This volume is translated from the second Russian edition printed by the Sobolev Institute of Mathematics of the Siberian Division of the Russian Academy of Sciences· in 1995. It incorporates new sections on Radon measures, the Schwartz spaces of distributions, and a supplementary list of theoretical exercises and problems. This edition was typeset using AMS-'lEX, the American Mathematical Society's 'lEX system. To clear my conscience completely, I also confess that := stands for the definor, the assignment operator, signifies the end of the proof.

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.