CMS Books in Mathematics – serie

A majority of the chapters in this book first saw the light of day as talks at a conference organised and held at Queen’s University in Kingston, Ontario, Canada in April 2001. This small, invitational meeting, tellingly entitled Beauty and the Mathematical Beast, brought together a range of academics int- ested in and committed to exploring connections between mathematics and aesthetics. The enthusiastic response of participants at this gathering enco- aged the presenters to expand upon their initial contributions and persuaded the organisers to recruit further chapters in order to bring a greater balance to the whole. The timing of this event was not arbitrary. The preceding decade had seen a resurgence in serious writing dealing with deeper relations between mathematics (and science) and ‘the beautiful’. In many ways, we the editors of this volume found these contributions to the literature were revisiting and drawing on themes that had been prominent over two thousand five h- dred years ago, in certain writings of the Pythagoreans. While not intending to offer a historical reappraisal of these ancient thinkers here, we have none the less chosen to invoke this profound interweaving of the mathematical and the aesthetic to which this reputedly secretive philosophical sect was ext- sively attuned. This book is divided into three sections comprising three chapters each, each with its own short introduction discussing the particular chapters within.

This book is intended as a course in numerical analysis and approximation theory for advanced undergraduate students or graduate students, and as a reference work for those who lecture or research in this area. Its title pays homage to Interpolation and Approximation by Philip J. Davis, published in 1963 by Blaisdell and reprinted by Dover in 1976. My book is less g- eral than Philip Davis’s much respected classic, as the quali?cation “by polynomials” in its title suggests, and it is pitched at a less advanced level. I believe that no one book can fully cover all the material that could appearinabookentitledInterpolation and Approximation by Polynomials. Nevertheless, I have tried to cover most of the main topics. I hope that my readers will share my enthusiasm for this exciting and fascinating area of mathematics, and that, by working through this book, some will be encouraged to read more widely and pursue research in the subject. Since my book is concerned with polynomials, it is written in the language of classical analysis and the only prerequisites are introductory courses in analysis and linear algebra.

1. The Inverse of a Nonsingular Matrix It is well known that every nonsingular matrix A has a unique inverse, ?1 denoted by A , such that ?1 ?1 AA = A A =I, (1) where I is the identity matrix. Of the numerous properties of the inverse matrix, we mention a few. Thus, ?1 ?1 (A ) = A, T ?1 ?1 T (A ) =(A ) , ? ?1 ?1 ? (A ) =(A ) , ?1 ?1 ?1 (AB) = B A , T ? where A and A , respectively, denote the transpose and conjugate tra- pose of A. It will be recalled that a real or complex number ? is called an eigenvalue of a square matrix A, and a nonzero vector x is called an eigenvector of A corresponding to ?,if Ax = ?x. ?1 Another property of the inverse A is that its eigenvalues are the recip- cals of those of A. 2. Generalized Inverses of Matrices A matrix has an inverse only if it is square, and even then only if it is nonsingular or, in other words, if its columns (or rows) are linearly in- pendent. In recent years needs have been felt in numerous areas of applied mathematics for some kind of partial inverse of a matrix that is singular or even rectangular.

In mathematical modeling of processes one often encounters optimization problems involving more than one objective function, so that Multiobjective Optimization (or Vector Optimization) has received new impetus. The growing interest in multiobjective problems, both from the theoretical point of view and as it concerns applications to real problems, asks for a general scheme which embraces several existing developments and stimulates new ones. In this book the authors provide the newest results and applications of this quickly growing field. This book will be of interest to graduate students in mathematics, economics, and engineering, as well as researchers in pure and applied mathematics, economics, engineering, geography, and town planning. A sound knowledge of linear algebra and introductory real analysis should provide readers with sufficient background for this book.

Variational arguments are classical techniques whose use can be traced back to the early development of the calculus of variations and further. Rooted in the physical principle of least action they have wide applications in diverse fields. This book provides a concise account of the essential tools of infinite-dimensional first-order variational analysis. These tools are illustrated by applications in many different parts of analysis, optimization and approximation, dynamical systems, mathematical economics and elsewhere. Much of the material in the book grows out of talks and short lecture series given by the authors in the past several years. Thus, chapters in this book can easily be arranged to form material for a graduate level topics course. A sizeable collection of suitable exercises is provided for this purpose. In addition, this book is also a useful reference for researchers who use variational techniques---or just think they might like to.

This book brings together for the first time the Kenneth May Lectures that were given at the annual meetings of the Canadian Society for History and Philosophy of Mathematics. All contributions are of high scholarly value, yet accessible to an audience with a wide range of interests. They provide a historian’s perspective on mathematical developments and deal with a variety of topics covering Greek applied mathematics, the mathematics and science of Leonhard Euler, mathematical modeling and phenomena in ancient astronomy, Turing and the origins of artificial intelligence to name only a few.

The theory of convex optimization has been developing constantly over the past 30 years. Recently, researchers have been studying more complicated classes of problems that still can be studied by means of convex analysis, so-called "anticonvex" and "convex-anticonvex" optimization problems. This monograph contains an exhaustive presentation of the duality theory for these classes of problems and their generalizations.

This book deals mainly with the study of convex functions and their behavior from the point of view of stability with respect to perturbations. We shall consider convex functions from the most modern point of view: a function is de?ned to be convex whenever its epigraph, the set of the points lying above the graph, is a convex set. Thus many of its properties can be seen also as properties of a certain convex set related to it. Moreover, we shall consider extended real valued functions, i. e. , functions taking possibly the values?? and +?. The reason for considering the value +? is the powerful device of including the constraint set of a constrained minimum problem into the objective function itself (by rede?ning it as +? outside the constraint set). Except for trivial cases, the minimum value must be taken at a point where the function is not +?, hence at a point in the constraint set. And the value ?? is allowed because useful operations, such as the inf-convolution, can give rise to functions valued?? even when the primitive objects are real valued. Observe that de?ning the objective function to be +? outside the closed constraint set preserves lower semicontinuity, which is the pivotal and mi- mal continuity assumption one needs when dealing with minimum problems. Variational calculus is usually based on derivatives.

Optimization is a rich and thriving mathematical discipline. The theory underlying current computational optimization techniques grows ever more sophisticated. The powerful and elegant language of convex analysis unifies much of this theory. The aim of this book is to provide a concise, accessible account of convex analysis and its applications and extensions, for a broad audience. It can serve as a teaching text, at roughly the level of first year graduate students. While the main body of the text is self-contained, each section concludes with an often extensive set of optional exercises. The new edition adds material on semismooth optimization, as well as several new proofs that will make this book even more self-contained.

A majority of the chapters in this book first saw the light of day as talks at a conference organised and held at Queen’s University in Kingston, Ontario, Canada in April 2001. This small, invitational meeting, tellingly entitled Beauty and the Mathematical Beast, brought together a range of academics int- ested in and committed to exploring connections between mathematics and aesthetics. The enthusiastic response of participants at this gathering enco- aged the presenters to expand upon their initial contributions and persuaded the organisers to recruit further chapters in order to bring a greater balance to the whole. The timing of this event was not arbitrary. The preceding decade had seen a resurgence in serious writing dealing with deeper relations between mathematics (and science) and ‘the beautiful’. In many ways, we the editors of this volume found these contributions to the literature were revisiting and drawing on themes that had been prominent over two thousand five h- dred years ago, in certain writings of the Pythagoreans. While not intending to offer a historical reappraisal of these ancient thinkers here, we have none the less chosen to invoke this profound interweaving of the mathematical and the aesthetic to which this reputedly secretive philosophical sect was ext- sively attuned. This book is divided into three sections comprising three chapters each, each with its own short introduction discussing the particular chapters within.

In this book the authors study the differential geometry of varieties with degenerate Gauss maps. They use the main methods of differential geometry, namely, the methods of moving frames and exterior differential forms as well as tensor methods. By means of these methods, the authors discover the structure of varieties with degenerate Gauss maps, determine the singular points and singular varieties, find focal images and construct a classification of the varieties with degenerate Gauss maps.The authors introduce the above mentioned methods and apply them to a series of concrete problems arising in the theory of varieties with degenerate Gauss maps. What makes this book unique is the authors’ use of a systematic application of methods of projective differential geometry along with methods of the classical algebraic geometry for studying varieties with degenerate Gauss maps.This book is intended for researchers and graduate students interested in projective differential geometry and algebraic geometry and their applications. It can be used as a text for advanced undergraduate and graduate students.Each author has published over 100 papers and they have each written a number of books, including Conformal Differential Geometry and Its Generalizations (Wiley 1996), Projective Differential Geometry of Submanifolds (North-Holland 1993), and Introductory Linear Algebra (Prentice-Hall 1972), which were written by them jointly.

This book is about three seemingly independent areas of mathematics: combinatorial group theory, the theory of Lie algebras and affine algebraic geometry. Indeed, for many years these areas were being developed fairly independently. Combinatorial group theory, the oldest of the three, was born in the beginning of the 20th century as a branch of low-dimensional topology. Very soon, it became an important area of mathematics with its own powerful techniques. In the 1950s, combinatorial group theory started to influence, rather substantially, the theory of Lie algebrasj thus combinatorial theory of Lie algebras was shaped, although the origins of the theory can be traced back to the 1930s. In the 1960s, B. Buchberger introduced what is now known as Gröbner bases. This marked the beginning of a new, "combinatorial", era in commu­ tative algebra. It is not very likely that Buchberger was directly influenced by ideas from combinatorial group theory, but his famous algorithm bears resemblance to Nielsen's method, although in a more sophisticated form.

One of the fundamental questions of Banach space theory is whether every Banach space has a basis. A space with a basis gives us a sense of familiarity and concreteness, and perhaps a chance to attempt the classification of all Banach spaces and other problems.The main goals of this book are to: -introduce the reader to some of the basic concepts, results and applications of biorthogonal systems in infinite dimensional geometry of Banach spaces, and in topology and nonlinear analysis in Banach spaces, -aim the text at graduate students and researchers who have a foundation in Banach space theory, - expose the reader to some current avenues of research in biorthogonal systems in Banach spaces, -provide notes and exercises related to the topic, suggest open problems and possible new directions of research.Numerous exercises are included, and the only prerequisites are a basic background in functional analysis.

Collecting papers never before published in book form, this volume presents an analysis of the Riemann Hypothesis as well as connected problems. It also supplies a generous helping of the body of theory developed towards the problem’s solution. In addition, the work contains recent advances and results in number theory. Almost all the material here is accessible to any senior mathematics student, and much is accessible to anyone with some university mathematics. The appendices include a selection of original papers that encompass the most important milestones in the evolution of theory connected to the Riemann Hypothesis. The appendices also include some authoritative expository papers. These are the “expert witnesses” whose insight into this field is both invaluable and irreplaceable.

Mathematical analysis offers a solid basis for many achievements in applied mathematics and discrete mathematics. This new textbook is focused on differential and integral calculus, and includes a wealth of useful and relevant examples, exercises, and results enlightening the reader to the power of mathematical tools. The intended audience consists of advanced undergraduates studying mathematics or computer science.The author provides excursions from the standard topics to modern and exciting topics, to illustrate the fact that even first or second year students can understand certain research problems.The text has been divided into ten chapters and covers topics on sets and numbers, linear spaces and metric spaces, sequences and series of numbers and of functions, limits and continuity, differential and integral calculus of functions of one or several variables, constants (mainly pi) and algorithms for finding them, the W - Z method of summation, estimates of algorithms and of certain combinatorial problems. Many challenging exercises accompany the text. Most of them have been used to prepare for different mathematical competitions during the past few years. In this respect, the author has maintained a healthy balance of theory and exercises.

Pell’s Equation is a very simple Diophantine equation that has been known to mathematicians for over 2000 years. Even today research involving this equation continues to be very active, as can be seen by the publication of at least 150 articles related to this equation over the past decade. However, very few modern books have been published on Pell’s Equation, and this will be the first to give a historical development of the equation, as well as to develop the necessary tools for solving the equation.The authors provide a friendly introduction for advanced undergraduates to the delights of algebraic number theory via Pell’s Equation. The only prerequisites are a basic knowledge of elementary number theory and abstract algebra. There are also numerous references and notes for those who wish to follow up on various topics.

This book is intended for those who love mathematics, including under­ graduate students of mathematics, more experienced students, and the vast number of amateurs, in the literal sense of those who do something for the love of it. I hope it will also be a useful source of material for those who teach mathematics. It is a collection of loosely connected topics in areas of mathematics that particularly interest me, ranging over the two millennia from the work of Archimedes, who died in the year 212 Be, to the Werke of Gauss, who was born in 1777, although there are some references outside this period. In view of its title, I must emphasize that this book is certainly not pretending to be a comprehensive history of the mathematics of this period, or even a complete account of the topics discussed. However, every chapter is written with the history of its topic in mind. It is fascinating, for example, to follow how both Napier and Briggs constructed their log­ arithms before many of the most relevant mathematical ideas had been discovered. Do I really mean "discovered"? There is an old question, "Is mathematics created or discovered?" Sometimes it seems a shame not to use the word "create" in praise of the first mathematician to write down some outstanding result. Yet the inner harmony that sings out from the best of mathematics seems to demand the word "discover.

This book evolved from notes originally developed for a graduate course, "Best Approximation in Normed Linear Spaces," that I began giving at Penn State Uni­ versity more than 25 years ago. It soon became evident. that many of the students who wanted to take the course (including engineers, computer scientists, and statis­ ticians, as well as mathematicians) did not have the necessary prerequisites such as a working knowledge of Lp-spaces and some basic functional analysis. (Today such material is typically contained in the first-year graduate course in analysis. ) To accommodate these students, I usually ended up spending nearly half the course on these prerequisites, and the last half was devoted to the "best approximation" part. I did this a few times and determined that it was not satisfactory: Too much time was being spent on the presumed prerequisites. To be able to devote most of the course to "best approximation," I decided to concentrate on the simplest of the normed linear spaces-the inner product spaces-since the theory in inner product spaces can be taught from first principles in much less time, and also since one can give a convincing argument that inner product spaces are the most important of all the normed linear spaces anyway. The success of this approach turned out to be even better than I had originally anticipated: One can develop a fairly complete theory of best approximation in inner product spaces from first principles, and such was my purpose in writing this book.

This book introduces the reader to the basic principles of functional analysis and to areas of Banach space theory that are close to nonlinear analysis and topology.In the first part, the book develops the classical theory, including weak topologies, locally convex spaces, Schauder bases, and compact operator theory. The presentation is self-contained, including many folklore results, and the proofs are accessible to students with the usual background in real analysis and topology. The second part covers topics in convexity and smoothness, finite representability, variational principles, homeomorphisms, weak compactness and more. Several results are published here for the first time in a monograph. The text can be used in graduate courses or for independent study. It includes a large number of exercises of different levels of difficulty, accompanied by hints. The book is also directed to young researchers in functional analysis and can serve as a reference book.This is an introduction to basic principles of functional analysis and to areas of Banach space theory close to nonlinear analysis and topology. The first part, which develops the classical theory, is self-contained and features a large number of exercises containing many important results. The second part covers selected topics in the theory of Banach spaces related to smoothness and topology. It is intended to be an introduction to and complement of existing books on the subject. This text may be used in graduate courses, for independent study, or as a reference book.

French mathematician Pierre de Fermat became most well known for his pioneering work in the area of number theory. His work with numbers has been attracting the attention of amateur and professional mathematicians for over 350 years. This book was written in honor of the 400th anniversary of his birth and is based on a series of lectures given by the authors. The purpose of this book is to provide readers with an overview of the many properties of Fermat numbers and to demonstrate their numerous appearances and applications in areas such as number theory, probability theory, geometry, and signal processing. This book introduces a general mathematical audience to basic mathematical ideas and algebraic methods connected with the Fermat numbers and will provide invaluable reading for the amateur and professional alike.

Combinatorics is one of the fastest growing ?elds of mathematics. In large measure this is because many practical problems can be modeled and then e?ciently solved using combinatorial theory. This real world motivation for studying algorithmic combinatorics has led not only to the development of many software packages but also to some beautiful mathematics which has nodirectapplicationtoappliedproblems. Inthisvolumewehighlightsome exciting recent developments in algorithmic combinatorics. Most practical applications of algorithmic combinatorics would be - possible without the use of the computer. As computers become ever more powerful, more and more applications become possible. Computational biology is one example of a relatively new ?eld in which algorithmic c- binatorics plays a key role. The chapter by Sagot and Wakabayashi in this volumediscusseshowcombinatorialtoolscanbeusedtosearchforpatterns in DNA and protein sequences. The information technology revolution has not only allowed for the r- olution of practical problems using combinatorial techniques, it has also been the source of many new combinatorial problems. One example is - dio channel assignment. In this problem we have a number of transmitters each of which must handle a number of calls. Each call must be assigned a frequency in such a way that interference is avoided (thus calls handled by the same transmitter are assigned di?erent frequencies as are calls handled by transmitters which are near each other). The explosive growth in the use of the frequency spectrum due to, e. g. , mobile telephone networks, has made it a very valuable resource.

This book is designed for a topics course in computational number theory. It is based around a number of difficult old problems that live at the interface of analysis and number theory. Some of these problems are the following: The Integer Chebyshev Problem. Find a nonzero polynomial of degree n with integer eoeffieients that has smallest possible supremum norm on the unit interval. Littlewood's Problem. Find a polynomial of degree n with eoeffieients in the set { + 1, -I} that has smallest possible supremum norm on the unit disko The Prouhet-Tarry-Escott Problem. Find a polynomial with integer co­ effieients that is divisible by (z - l)n and has smallest possible 1 norm. (That 1 is, the sum of the absolute values of the eoeffieients is minimal.) Lehmer's Problem. Show that any monie polynomial p, p(O) i- 0, with in­ teger coefficients that is irreducible and that is not a cyclotomic polynomial has Mahler measure at least 1.1762 .... All of the above problems are at least forty years old; all are presumably very hard, certainly none are completely solved; and alllend themselves to extensive computational explorations. The techniques for tackling these problems are various and include proba­ bilistic methods, combinatorial methods, "the circle method," and Diophantine and analytic techniques. Computationally, the main tool is the LLL algorithm for finding small vectors in a lattice. The book is intended as an introduction to a diverse collection of techniques.

This book can be seen as a continuation of Equations and Inequalities: El­ ementary Problems and Theorems in Algebra and Number Theory by the same authors, and published as the first volume in this book series. How­ ever, it can be independently read or used as a textbook in its own right. This book is intended as a text for a problem-solving course at the first­ or second-year university level, as a text for enrichment classes for talented high-school students, or for mathematics competition training. It can also be used as a source of supplementary material for any course dealing with combinatorics, graph theory, number theory, or geometry, or for any of the discrete mathematics courses that are offered at most American and Canadian universities. The underlying "philosophy" of this book is the same as that of Equations and Inequalities. The following paragraphs are therefore taken from the preface of that book.

In 1984, N. Karmarkar published a seminal paper on algorithmic linear programming. During the subsequent decade, it stimulated a huge outpouring of new algorithmic results by researchers world-wide in many areas of mathematical programming and numerical computation. This book gives an overview of the resulting, dramatic reorganization that has occurred in one of these areas: algorithmic differentiable optimization and equation-solving, or, more simply, algorithmic differentiable programming. The book is aimed at readers familiar with advanced calculus, numerical analysis, in particular numerical linear algebra, the theory and algorithms of linear and nonlinear programming, and the fundamentals of computer science, in particular, computer programming and the basic models of computation and complexity theory.

The analysis of orthogonal polynomials associated with general weights was a major theme in classical analysis in the twentieth century, and undoubtedly will continue to grow in importance in the future.In this monograph, the authors investigate orthogonal polynomials for exponential weights defined on a finite or infinite interval. The interval should contain 0, but need not be symmetric about 0; likewise the weight need not be even. The authors establish bounds and asymptotics for orthonormal and extremal polynomials, and their associated Christoffel functions. They deduce bounds on zeros of extremal and orthogonal polynomials, and also establish Markov- Bernstein and Nikolskii inequalities.The authors have collaborated actively since 1982 on various topics, and have published many joint papers, as well as a Memoir of the American Mathematical Society. The latter deals with a special case of the weights treated in this book. In many ways, this book is the culmination of 18 years of joint work on orthogonal polynomials, drawing inspiration from the works of many researchers in the very active field of orthogonal polynomials.

This book is intended as a text for a problem-solving course at the first­ or second-year university level, as a text for enrichment classes for talented high-school students, or for mathematics competition training. It can also be used as a source of supplementary material for any course dealing with algebraic equations or inequalities, or to supplement a standard elementary number theory course. There are already many excellent books on the market that can be used for a problem-solving course. However, some are merely collections of prob­ lems from a variety of fields and lack cohesion. Others present problems according to topic, but provide little or no theoretical background. Most problem books have a limited number of rather challenging problems. While these problems tend to be quite beautiful, they can appear forbidding and discouraging to a beginning student, even with well-motivated and carefully written solutions. As a consequence, students may decide that problem solving is only for the few high performers in their class, and abandon this important part of their mathematical, and indeed overall, education.

Reflection Groups and their invariant theory provide the main themes of this book and the first two parts focus on these topics. The first 13 chapters deal with reflection groups (Coxeter groups and Weyl groups) in Euclidean Space while the next thirteen chapters study the invariant theory of pseudo-reflection groups. The third part of the book studies conjugacy classes of the elements in reflection and pseudo-reflection groups. The book has evolved from various graduate courses given by the author over the past 10 years. It is intended to be a graduate text, accessible to students with a basic background in algebra. Richard Kane is a professor of mathematics at the University of Western Ontario. His research interests are algebra and algebraic topology. Professor Kane is a former President of the Canadian Mathematical Society.

A recurring theme in a traditional introductory graduate algebra course is the existence and consequences of relationships between different algebraic structures. This is also the theme of this book, an exposition of connections between representations of finite partially ordered sets and abelian groups. Emphasis is placed throughout on classification, a description of the objects up to isomorphism, and computation of representation type, a measure of when classification is feasible. David M. Arnold is the Ralph and Jean Storm Professor of Mathematics at Baylor University. He is the author of "Finite Rank Torsion Free Abelian Groups and Rings" published in the Springer-Verlag Lecture Notes in Mathematics series, a co-editor for two volumes of conference proceedings, and the author of numerous articles in mathematical research journals. His research interests are in abelian group theory and related topics, such as representations of partially ordered sets and modules over discrete valuation rings, subrings of algebraic number fields, and pullback rings. He received his Ph. D. from the University of Illinois, Urbana and was a member of the faculty at New Mexico State University for many years.

Geometry is a classical core part of mathematics which, with its birth, marked the beginning of the mathematical sciences. Thus, not surprisingly, geometry has played a key role in many important developments of mathematics in the past, as well as in present times. While focusing on modern mathematics, one has to emphasize the increasing role of discrete mathematics, or equivalently, the broad movement to establish discrete analogues of major components of mathematics. In this way, the works of a number of outstanding mathema- cians including H. S. M. Coxeter (Canada), C. A. Rogers (United Kingdom), and L. Fejes-T oth (Hungary) led to the new and fast developing eld called discrete geometry. One can brie y describe this branch of geometry as the study of discrete arrangements of geometric objects in Euclidean, as well as in non-Euclidean spaces. This, as a classical core part, also includes the theory of polytopes and tilings in addition to the theory of packing and covering. D- crete geometry is driven by problems often featuring a very clear visual and applied character. The solutions use a variety of methods of modern mat- matics, including convex and combinatorial geometry, coding theory, calculus of variations, di erential geometry, group theory, and topology, as well as geometric analysis and number theory.