CMS/CAIMS Books in Mathematics – serie

This monograph considers the mathematical modeling of cellular adhesion, a key interaction force in cell biology. While deeply grounded in the biological application of cell adhesion and tissue formation, this monograph focuses on the mathematical analysis of non-local adhesion models. The novel aspect is the non-local term (an integral operator), which accounts for forces generated by long ranged cell interactions. The analysis of non-local models has started only recently, and it has become a vibrant area of applied mathematics. This monograph contributes a systematic analysis of steady states and their bifurcation structure, combining global bifurcation results pioneered by Rabinowitz, equivariant bifurcation theory, and the symmetries of the non-local term. These methods allow readers to analyze and understand cell adhesion on a deep level.

This monograph considers the mathematical modeling of cellular adhesion, a key interaction force in cell biology. While deeply grounded in the biological application of cell adhesion and tissue formation, this monograph focuses on the mathematical analysis of non-local adhesion models. The novel aspect is the non-local term (an integral operator), which accounts for forces generated by long ranged cell interactions. The analysis of non-local models has started only recently, and it has become a vibrant area of applied mathematics. This monograph contributes a systematic analysis of steady states and their bifurcation structure, combining global bifurcation results pioneered by Rabinowitz, equivariant bifurcation theory, and the symmetries of the non-local term. These methods allow readers to analyze and understand cell adhesion on a deep level.

This graduate textbook presents an approach through toric geometry to the problem of estimating the isolated solutions (counted with appropriate multiplicity) of n polynomial equations in n variables over an algebraically closed field. The text collects and synthesizes a number of works on Bernstein’s theorem of counting solutions of generic systems, ultimately presenting the theorem, commentary, and extensions in a comprehensive and coherent manner. It begins with Bernstein’s original theorem expressing solutions of generic systems in terms of the mixed volume of their Newton polytopes, including complete proofs of its recent extension to affine space and some applications to open problems. The text also applies the developed techniques to derive and generalize Kushnirenko's results on Milnor numbers of hypersurface singularities, which has served as a precursor to the development of toric geometry. Ultimately, the book aims to present material in an elementary format, developing all necessary algebraic geometry to provide a truly accessible overview suitable to second-year graduate students.

This graduate textbook presents an approach through toric geometry to the problem of estimating the isolated solutions (counted with appropriate multiplicity) of n polynomial equations in n variables over an algebraically closed field. The text collects and synthesizes a number of works on Bernstein’s theorem of counting solutions of generic systems, ultimately presenting the theorem, commentary, and extensions in a comprehensive and coherent manner. It begins with Bernstein’s original theorem expressing solutions of generic systems in terms of the mixed volume of their Newton polytopes, including complete proofs of its recent extension to affine space and some applications to open problems. The text also applies the developed techniques to derive and generalize Kushnirenko's results on Milnor numbers of hypersurface singularities, which has served as a precursor to the development of toric geometry. Ultimately, the book aims to present material in an elementary format, developing all necessary algebraic geometry to provide a truly accessible overview suitable to second-year graduate students.

This book addresses Birkhoff and Mal'cev's problem of describing subquasivariety lattices. The text begins by developing the basics of atomic theories and implicational theories in languages that may, or may not, contain equality. Subquasivariety lattices are represented as lattices of closed algebraic subsets of a lattice with operators, which yields new restrictions on the equaclosure operator. As an application of this new approach, it is shown that completely distributive lattices with a dually compact least element are subquasivariety lattices. The book contains many examples to illustrate these principles, as well as open problems. Ultimately this new approach gives readers a set of tools to investigate classes of lattices that can be represented as subquasivariety lattices.

This book addresses Birkhoff and Mal'cev's problem of describing subquasivariety lattices. The text begins by developing the basics of atomic theories and implicational theories in languages that may, or may not, contain equality. Subquasivariety lattices are represented as lattices of closed algebraic subsets of a lattice with operators, which yields new restrictions on the equaclosure operator. As an application of this new approach, it is shown that completely distributive lattices with a dually compact least element are subquasivariety lattices. The book contains many examples to illustrate these principles, as well as open problems. Ultimately this new approach gives readers a set of tools to investigate classes of lattices that can be represented as subquasivariety lattices.

This book aims to introduce graduate students to the many applications of numerical computation, explaining in detail both how and why the included methods work in practice. The text addresses numerical analysis as a middle ground between practice and theory, addressing both the abstract mathematical analysis and applied computation and programming models instrumental to the field. While the text uses pseudocode, Matlab and Julia codes are available online for students to use, and to demonstrate implementation techniques. The textbook also emphasizes multivariate problems alongside single-variable problems and deals with topics in randomness, including stochastic differential equations and randomized algorithms, and topics in optimization and approximation relevant to machine learning. Ultimately, it seeks to clarify issues in numerical analysis in the context of applications, and presenting accessible methods to students in mathematics and data science.

This book aims to introduce graduate students to the many applications of numerical computation, explaining in detail both how and why the included methods work in practice. The text addresses numerical analysis as a middle ground between practice and theory, addressing both the abstract mathematical analysis and applied computation and programming models instrumental to the field. While the text uses pseudocode, Matlab and Julia codes are available online for students to use, and to demonstrate implementation techniques. The textbook also emphasizes multivariate problems alongside single-variable problems and deals with topics in randomness, including stochastic differential equations and randomized algorithms, and topics in optimization and approximation relevant to machine learning. Ultimately, it seeks to clarify issues in numerical analysis in the context of applications, and presenting accessible methods to students in mathematics and data science.

This graduate textbook provides an alternative to discrete event simulation.  It describes how to formulate discrete event systems, how to convert them into Markov chains, and how to calculate their transient and equilibrium probabilities. The most appropriate methods for finding these probabilities are described in some detail, and templates for efficient algorithms are provided. These algorithms can be executed on any laptop, even in cases where the Markov chain has hundreds of thousands of states. This book features the probabilistic interpretation of Gaussian elimination, a concept that unifies many of the topics covered, such as embedded Markov chains and matrix analytic methods.The material provided should aid practitioners significantly to solve their problems. This book also provides an interesting approach to teaching courses of stochastic processes.

This graduate textbook provides an alternative to discrete event simulation.  It describes how to formulate discrete event systems, how to convert them into Markov chains, and how to calculate their transient and equilibrium probabilities. The most appropriate methods for finding these probabilities are described in some detail, and templates for efficient algorithms are provided. These algorithms can be executed on any laptop, even in cases where the Markov chain has hundreds of thousands of states. This book features the probabilistic interpretation of Gaussian elimination, a concept that unifies many of the topics covered, such as embedded Markov chains and matrix analytic methods.The material provided should aid practitioners significantly to solve their problems. This book also provides an interesting approach to teaching courses of stochastic processes.

The main subject of the book is stochastic analysis and its various applications to mathematical finance and statistics of random processes.

The main subject of the book is stochastic analysis and its various applications to mathematical finance and statistics of random processes. The main purpose of the book is to present, in a short and sufficiently self-contained form, the methods and results of the contemporary theory of stochastic analysis and to show how these methods and results work in mathematical finance and statistics of random processes. The book can be considered as a textbook for both senior undergraduate and graduate courses on this subject. The book can be helpful for undergraduate and graduate students, instructors and specialists on stochastic analysis and its applications.

This book is the culmination of the authors’ industry-academic collaboration in the past several years. The investigation is largely motivated by bank balance sheet management problems. The main difference between a bank balance sheet management problem and a typical portfolio optimization problem is that the former involves multiple risks. The related theoretical investigation leads to a significant extension of the scope of portfolio theories. The book combines practitioners’ perspectives and mathematical rigor. For example, to guide the bank managers to trade off different Pareto efficient points, the topological structure of the Pareto efficient set is carefully analyzed. Moreover, on top of computing solutions, the authors focus the investigation on the qualitative properties of those solutions and their financial meanings. These relations, such as the role of duality, are most useful in helping bank managers to communicate their decisions to the different stakeholders. Finally, bank balance sheet management problems of varying levels of complexity are discussed to illustrate how to apply the central mathematical results. Although the primary motivation and application examples in this book are focused in the area of bank balance sheet management problems, the range of applications of the general portfolio theory is much wider. As a matter of fact, most financial problems involve multiple types of risks. Thus, the book is a good reference for financial practitioners in general and students who are interested in financial applications. This book can also serve as a nice example of a case study for applied mathematicians who are interested in engaging in industry-academic collaboration.

This book is the culmination of the authors’ industry-academic collaboration in the past several years. The investigation is largely motivated by bank balance sheet management problems. The main difference between a bank balance sheet management problem and a typical portfolio optimization problem is that the former involves multiple risks. The related theoretical investigation leads to a significant extension of the scope of portfolio theories. The book combines practitioners’ perspectives and mathematical rigor. For example, to guide the bank managers to trade off different Pareto efficient points, the topological structure of the Pareto efficient set is carefully analyzed. Moreover, on top of computing solutions, the authors focus the investigation on the qualitative properties of those solutions and their financial meanings. These relations, such as the role of duality, are most useful in helping bank managers to communicate their decisions to the different stakeholders. Finally, bank balance sheet management problems of varying levels of complexity are discussed to illustrate how to apply the central mathematical results. Although the primary motivation and application examples in this book are focused in the area of bank balance sheet management problems, the range of applications of the general portfolio theory is much wider. As a matter of fact, most financial problems involve multiple types of risks. Thus, the book is a good reference for financial practitioners in general and students who are interested in financial applications. This book can also serve as a nice example of a case study for applied mathematicians who are interested in engaging in industry-academic collaboration.

In mathematical modeling of processes occurring in logistics, management science, operations research, networks, mathematical finance, medicine, and control theory, one often encounters optimization problems involving more than one objective function so that Multiobjective Optimization (or Vector Optimization, initiated by W. Pareto) has received new impetus. The growing interest in vector optimization problems, both from the theoretical point of view and as it concerns applications to real world optimization problems, asks for a general scheme which embraces several existing developments and stimulates new ones. This book aims to provide the newest results and applications of this quickly growing field. Basic tools of partially ordered spaces are discussed and applied to variational methods in nonlinear analysis and to optimization problems. The book begins by providing simple examples that illustrate what kind of problems can be handled with the methods presented. The book then deals with connections between order structures and topological structures of sets, discusses properties of nonlinear scalarization functions, and derives corresponding separation theorems for not necessarily convex sets. Furthermore, characterizations of set relations via scalarization are presented. Important topological properties of multifunctions and new results concerning the theory of vector optimization and equilibrium problems are presented in the book. These results are applied to construct numerical algorithms, especially, proximal-point algorithms and geometric algorithms based on duality assertions. In the second edition, new sections about set less relations, optimality conditions in set optimization and the asymptotic behavior of multiobjective Pareto-equilibrium problems have been incorporated. Furthermore, a new chapter regarding scalar optimization problems under uncertainty and robust counterpart problems employing approaches based on vector optimization, set optimization, and nonlinear scalarization was added. Throughout the entire book, there are examples used to illustrate the results and check the stated conditions. This book will be of interest to graduate students and researchers in pure and applied mathematics, economics, and engineering. A sound knowledge of linear algebra and introductory real analysis should provide readers with sufficient background for this book.

In mathematical modeling of processes occurring in logistics, management science, operations research, networks, mathematical finance, medicine, and control theory, one often encounters optimization problems involving more than one objective function so that Multiobjective Optimization (or Vector Optimization, initiated by W. Pareto) has received new impetus. The growing interest in vector optimization problems, both from the theoretical point of view and as it concerns applications to real world optimization problems, asks for a general scheme which embraces several existing developments and stimulates new ones. This book aims to provide the newest results and applications of this quickly growing field. Basic tools of partially ordered spaces are discussed and applied to variational methods in nonlinear analysis and to optimization problems. The book begins by providing simple examples that illustrate what kind of problems can be handled with the methods presented. The book then deals with connections between order structures and topological structures of sets, discusses properties of nonlinear scalarization functions, and derives corresponding separation theorems for not necessarily convex sets. Furthermore, characterizations of set relations via scalarization are presented. Important topological properties of multifunctions and new results concerning the theory of vector optimization and equilibrium problems are presented in the book. These results are applied to construct numerical algorithms, especially, proximal-point algorithms and geometric algorithms based on duality assertions. In the second edition, new sections about set less relations, optimality conditions in set optimization and the asymptotic behavior of multiobjective Pareto-equilibrium problems have been incorporated. Furthermore, a new chapter regarding scalar optimization problems under uncertainty and robust counterpart problems employing approaches based on vector optimization, set optimization, and nonlinear scalarization was added. Throughout the entire book, there are examples used to illustrate the results and check the stated conditions. This book will be of interest to graduate students and researchers in pure and applied mathematics, economics, and engineering. A sound knowledge of linear algebra and introductory real analysis should provide readers with sufficient background for this book.

Although the Lucas sequences were known to earlier investigators such as Lagrange, Legendre and Genocchi, it is because of the enormous number and variety of results involving them, revealed by Édouard Lucas between 1876 and 1880, that they are now named after him.  Since Lucas’ early work, much more has been discovered concerning these remarkable mathematical objects, and the objective of this book is to provide a much more thorough discussion of them than is available in existing monographs.  In order to do this a large variety of results, currently scattered throughout the literature, are brought together. Various sections are devoted to the intrinsic arithmetic properties of these sequences, primality testing, the Lucasnomials, some associated density problems and Lucas’ problem of finding a suitable generalization of them. Furthermore, their application, not only to primality testing, but also to integer factoring, efficient solution of quadratic and cubic congruences, cryptography and Diophantine equations are briefly discussed.  Also, many historical remarks are sprinkled throughout the book, and a biography of Lucas is included as an appendix.Much of the book is not intended to be overly detailed. Rather, the objective is to provide a good, elementary and clear explanation of the subject matter without too much ancillary material. Most chapters, with the exception of the second and the fourth, will address a particular theme, provide enough information for the reader to get a feel for the subject and supply references to more comprehensive results.  Most of this work should be accessible to anyone with a basic knowledge of elementary number theory and abstract algebra.  The book’s intended audience is number theorists, both professional and amateur, students and enthusiasts.

Although the Lucas sequences were known to earlier investigators such as Lagrange, Legendre and Genocchi, it is because of the enormous number and variety of results involving them, revealed by Édouard Lucas between 1876 and 1880, that they are now named after him.  Since Lucas’ early work, much more has been discovered concerning these remarkable mathematical objects, and the objective of this book is to provide a much more thorough discussion of them than is available in existing monographs.  In order to do this a large variety of results, currently scattered throughout the literature, are brought together. Various sections are devoted to the intrinsic arithmetic properties of these sequences, primality testing, the Lucasnomials, some associated density problems and Lucas’ problem of finding a suitable generalization of them. Furthermore, their application, not only to primality testing, but also to integer factoring, efficient solution of quadratic and cubic congruences, cryptography and Diophantine equations are briefly discussed.  Also, many historical remarks are sprinkled throughout the book, and a biography of Lucas is included as an appendix.Much of the book is not intended to be overly detailed. Rather, the objective is to provide a good, elementary and clear explanation of the subject matter without too much ancillary material. Most chapters, with the exception of the second and the fourth, will address a particular theme, provide enough information for the reader to get a feel for the subject and supply references to more comprehensive results.  Most of this work should be accessible to anyone with a basic knowledge of elementary number theory and abstract algebra.  The book’s intended audience is number theorists, both professional and amateur, students and enthusiasts.

This book provides a short introduction to partial differential equations (PDEs). It is primarily addressed to graduate students and researchers, who are new to PDEs. The book offers a user-friendly approach to the analysis of PDEs, by combining elementary techniques and fundamental modern methods. The author focuses the analysis on four prototypes of PDEs, and presents two approaches for each of them. The first approach consists of the method of analytical and classical solutions, and the second approach consists of the method of weak (variational) solutions. In connection with the approach of weak solutions, the book also provides an introduction to distributions, Fourier transform and Sobolev spaces. The book ends with an appendix chapter, which complements the previous chapters with proofs, examples and remarks. This book can be used for an intense one-semester, or normal two-semester, PDE course. The reader isexpected to have knowledge of linear algebra and of differential equations, a good background in real and complex calculus and a modest background in analysis and topology. The book has many examples, which help to better understand the concepts, highlight the key ideas and emphasize the sharpness of results, as well as a section of problems at the end of each chapter.

This book provides a short introduction to partial differential equations (PDEs). It is primarily addressed to graduate students and researchers, who are new to PDEs. The book offers a user-friendly approach to the analysis of PDEs, by combining elementary techniques and fundamental modern methods. The author focuses the analysis on four prototypes of PDEs, and presents two approaches for each of them. The first approach consists of the method of analytical and classical solutions, and the second approach consists of the method of weak (variational) solutions. In connection with the approach of weak solutions, the book also provides an introduction to distributions, Fourier transform and Sobolev spaces. The book ends with an appendix chapter, which complements the previous chapters with proofs, examples and remarks. This book can be used for an intense one-semester, or normal two-semester, PDE course. The reader isexpected to have knowledge of linear algebra and of differential equations, a good background in real and complex calculus and a modest background in analysis and topology. The book has many examples, which help to better understand the concepts, highlight the key ideas and emphasize the sharpness of results, as well as a section of problems at the end of each chapter.

This book is about semisimple Banach algebras with a focus on those that are commutative. After laying out the necessary background material from functional analysis, geometry of Banach spaces and measure theory, we introduce many specific Banach algebras from operator theory, harmonic analysis, and function theory and study their basic properties. Some of the questions dealt with in the book are: Whether the introduced Banach algebras are BSE-algebras, whether they have BSE norms, whether they have the separating ball property or some variant of it, and whether they are Arens regular. The book contains quite a few new results, as well as new proofs of a good many known results.The book is intended for those who are preparing to work in Banach algebras or who have been doing research in related areas.

This book is about semisimple Banach algebras with a focus on those that are commutative. After laying out the necessary background material from functional analysis, geometry of Banach spaces and measure theory, we introduce many specific Banach algebras from operator theory, harmonic analysis, and function theory and study their basic properties. Some of the questions dealt with in the book are: Whether the introduced Banach algebras are BSE-algebras, whether they have BSE norms, whether they have the separating ball property or some variant of it, and whether they are Arens regular. The book contains quite a few new results, as well as new proofs of a good many known results.The book is intended for those who are preparing to work in Banach algebras or who have been doing research in related areas.

Nonlinear partial differential equations (PDE) are at the core of mathematical modeling. In the past decades and recent years, multiple analytical methods to study various aspects of the mathematical structure of nonlinear PDEs have been developed. Those aspects include C- and S-integrability, Lagrangian and Hamiltonian formulations, equivalence transformations, local and nonlocal symmetries, conservation laws, and more. Modern computational approaches and symbolic software can be employed to systematically derive and use such properties, and where possible, construct exact and approximate solutions of nonlinear equations. This book contains a consistent overview of multiple properties of nonlinear PDEs, their relations, computation algorithms, and a uniformly presented set of examples of application of these methods to specific PDEs. Examples include both well known nonlinear PDEs and less famous systems that arise in the context of shallow water waves and far beyond. The book will beof interest to researchers and graduate students in applied mathematics, physics, and engineering, and can be used as a basis for research, study, reference, and applications.

Nonlinear partial differential equations (PDE) are at the core of mathematical modeling. In the past decades and recent years, multiple analytical methods to study various aspects of the mathematical structure of nonlinear PDEs have been developed. Those aspects include C- and S-integrability, Lagrangian and Hamiltonian formulations, equivalence transformations, local and nonlocal symmetries, conservation laws, and more. Modern computational approaches and symbolic software can be employed to systematically derive and use such properties, and where possible, construct exact and approximate solutions of nonlinear equations. This book contains a consistent overview of multiple properties of nonlinear PDEs, their relations, computation algorithms, and a uniformly presented set of examples of application of these methods to specific PDEs. Examples include both well known nonlinear PDEs and less famous systems that arise in the context of shallow water waves and far beyond. The book will beof interest to researchers and graduate students in applied mathematics, physics, and engineering, and can be used as a basis for research, study, reference, and applications.

This book offers a comprehensive introduction to various aspects of functional analysis and operator algebras.In Part I, readers will find the foundational material suitable for a one-semester course on functional analysis and linear operators. Additionally, Part I includes enrichment topics that provide flexibility for instructors.Part II covers the fundamentals of Banach algebras and C*-algebras, followed by more advanced material on C* and von Neumann algebras. This section is suitable for use in graduate courses, with instructors having the option to select specific topics.Part III explores a range of important topics in operator theory and operator algebras. These include $H^p$ spaces, isometries and Toeplitz operators, nest algebras, dilation theory, applications to various classes of nonself-adjoint operator algebras, and noncommutative convexity and Choquet theory. This material is suitable for graduate courses and learning seminars, offering instructors flexibility in selecting topics.

This book offers a comprehensive introduction to various aspects of functional analysis and operator algebras.In Part I, readers will find the foundational material suitable for a one-semester course on functional analysis and linear operators. Additionally, Part I includes enrichment topics that provide flexibility for instructors.Part II covers the fundamentals of Banach algebras and C*-algebras, followed by more advanced material on C* and von Neumann algebras. This section is suitable for use in graduate courses, with instructors having the option to select specific topics.Part III explores a range of important topics in operator theory and operator algebras. These include $H^p$ spaces, isometries and Toeplitz operators, nest algebras, dilation theory, applications to various classes of nonself-adjoint operator algebras, and noncommutative convexity and Choquet theory. This material is suitable for graduate courses and learning seminars, offering instructors flexibility in selecting topics.

This third edition presents an expanded and updated treatment of convex analysis methods, incorporating many new results that have emerged in recent years. These additions are essential for grasping the practical applications of convex function theory in solving contemporary real-world problems.To reflect these advancements, the material has been meticulously reorganized, with a greater emphasis on topics relevant to current research. Additionally, great care has been taken to ensure that the text remains accessible to a broad audience, including both students and researchers focused on the application of mathematics.Ideal for undergraduate courses, graduate seminars, or as a comprehensive reference, this book is an indispensable resource for those seeking to understand the extensive potential of convex function theory.

This third edition presents an expanded and updated treatment of convex analysis methods, incorporating many new results that have emerged in recent years. These additions are essential for grasping the practical applications of convex function theory in solving contemporary real-world problems.To reflect these advancements, the material has been meticulously reorganized, with a greater emphasis on topics relevant to current research. Additionally, great care has been taken to ensure that the text remains accessible to a broad audience, including both students and researchers focused on the application of mathematics.Ideal for undergraduate courses, graduate seminars, or as a comprehensive reference, this book is an indispensable resource for those seeking to understand the extensive potential of convex function theory.

Inspired by the classic Recreations in the Theory of Numbers—The Queen of Mathematics Entertains by Albert H. Beiler, this book brings the excitement of recreational number theory into the 21st century through the lens of computational techniques. While Beiler’s work, originally published in 1964, captivated readers with its breadth and charm, some sections have become dated. Here, we re-examine most of the key topics Beiler covered, while introducing fresh updates and insights rooted in computational number theory.The authors aim to present efficient computer algorithms to tackle various problems that arise in the theory of numbers, providing a deeper and more modern perspective on these timeless puzzles. Though we cannot rival Beiler’s exuberant prose, we hope our enduring fascination with these topics — cultivated over decades of study and teaching — will shine through and resonate with readers.The book is structured into 21 chapters, each focusing on different facets of number theory with which the authors have extensive expertise. From ancient problems to contemporary computational challenges, this volume will reignite the joy and wonder found in numbers while incorporating the power of modern computation. Whether you're a seasoned mathematician or a curious learner, this book promises a journey through the rich and playful landscape of number theory, making both historical and new discoveries accessible to all.