This book follows a conversational approach in five dozen stories that provide an insight into the colorful world of financial mathematics and financial markets in a relaxed, accessible and entertaining form. The authors present various topics such as returns, real interest rates, present values, arbitrage, replication, options, swaps, the Black-Scholes formula and many more. The readers will learn how to discover, analyze, and deal with the many financial mathematical decisions the daily routine constantly demands. The book covers a wide field in terms of scope and thematic diversity. Numerous stories are inspired by the fields of deterministic financial mathematics, option valuation, portfolio optimization and actuarial mathematics. The book also contains a collection of basic concepts and formulas of financial mathematics and of probability theory. Thus, also readers new to the subject will be provided with all the necessary information to verify the calculations.

Together with "Theory of Operator Algebras I, II" (EMS 124 and 125), this book, written by one of the most prominent researchers in the field of operator algebras, presents the theory of von Neumann algebras and non-commutative integration focusing on the group of automorphisms and the structure analysis.  It is is part of the recently developed part of the "Encyclopaedia of Mathematical Sciences" on operator algebras and non-commutative geometry (see http://www.springer.de/math/ems/index.html). The book provides essential and comprehensive information for graduate students and researchers in mathematics and mathematical physics.

This book contains select chapters on support vector algorithms from different perspectives, including mathematical background, properties of various kernel functions, and several applications. The main focus of this book is on orthogonal kernel functions, and the properties of the classical kernel functions-Chebyshev, Legendre, Gegenbauer, and Jacobi-are reviewed in some chapters. Moreover, the fractional form of these kernel functions is introduced in the same chapters, and for ease of use for these kernel functions, a tutorial on a Python package named ORSVM is presented. The book also exhibits a variety of applications for support vector algorithms, and in addition to the classification, these algorithms along with the introduced kernel functions are utilized for solving ordinary, partial, integro, and fractional differential equations. On the other hand, nowadays, the real-time and big data applications of support vector algorithms are growing. Consequently, the Compute Unified Device Architecture (CUDA) parallelizing the procedure of support vector algorithms based on orthogonal kernel functions is presented. The book sheds light on how to use support vector algorithms based on orthogonal kernel functions in different situations and gives a significant perspective to all machine learning and scientific machine learning researchers all around the world to utilize fractional orthogonal kernel functions in their pattern recognition or scientific computing problems.

The mathematical theory of Krylov subspace methods with a focus on solving systems of linear algebraic equations is given a detailed treatment in this principles-based book. Starting from the idea of projections, Krylov subspace methods are characterised by their orthogonality and minimisation properties. Projections onto highly nonlinear Krylov subspaces can be linked with the underlying problem of moments, and therefore Krylov subspace methods can be viewed as matching moments model reduction. This allows enlightening reformulations of questions from matrix computations into the language of orthogonal polynomials, Gauss-Christoffel quadrature, continued fractions, and, more generally, of Vorobyev's method of moments. Using the concept of cyclic invariant subspaces, conditions are studied that allow the generation of orthogonal Krylov subspace bases via short recurrences. The results motivate the important practical distinction between Hermitian and non-Hermitian problems. Finally, the book thoroughly addresses the computational cost while using Krylov subspace methods. The investigation includes effects of finite precision arithmetic and focuses on the method of conjugate gradients (CG) and generalised minimal residuals (GMRES) as major examples. There is an emphasis on the way algebraic computations must always be considered in the context of solving real-world problems, where the mathematical modelling, discretisation and computation cannot be separated from each other. The book also underlines the importance of the historical context and demonstrates that knowledge of early developments can play an important role in understanding and resolving very recent computational problems. Many extensive historical notes are included as an inherent part of the text as well as the formulation of some omitted issues and challenges which need to be addressed in future work. This book is applicable to a wide variety of graduate courses on Krylov subspace methods and related subjects, as well as benefiting those interested in the history of mathematics.

Galois theory has such close analogies with the theory of coverings that algebraists use a geometric language to speak of field extensions, while topologists speak of "Galois coverings". This book endeavors to develop these theories in a parallel way, starting with that of coverings, which better allows the reader to make images. The authors chose a plan that emphasizes this parallelism. The intention is to allow to transfer to the algebraic framework of Galois theory the geometric intuition that one can have in the context of coverings. This book is aimed at graduate students and mathematicians curious about a non-exclusively algebraic view of Galois theory.

This book offers a self-contained exposition of local class field theory, serving as a second course on Galois theory. It opens with a discussion of several fundamental topics in algebra, such as profinite groups, p-adic fields, semisimple algebras and their modules, and homological algebra with the example of group cohomology. The book culminates with the description of the abelian extensions of local number fields, as well as the celebrated Kronecker-Weber theory, in both the local and global cases. The material will find use across disciplines, including number theory, representation theory, algebraic geometry, and algebraic topology. Written for beginning graduate students and advanced undergraduates, this book can be used in the classroom or for independent study.

This unique and comprehensive volume provides an up-to-date account of the literature on the subject of determining the structure of rings over which cyclic modules or proper cyclic modules have a finiteness condition or a homological property. The finiteness conditions and homological properties are closely interrelated in the sense that either hypothesis induces the other in some form. This is the first book to bring all of this important material on the subject together. Over the last 25 years or more numerous mathematicians have investigated rings whose factor rings or factor modules have a finiteness condition or a homological property. They made important contributions leading to new directions and questions, which are listed at the end of each chapter for the benefit of future researchers. There is a wealth of material on the topic which is combined in this book, it contains more than 200 references and is not claimed to be exhaustive. This book will appeal to graduate students, researchers, and professionals in algebra with a knowledge of basic noncommutative ring theory, as well as module theory and homological algebra, equivalent to a one-year graduate course in the theory of rings and modules.

The objective of this book is to provide tools for solving problems which involve cubic number fields. Many such problems can be considered geometrically; both in terms of the geometry of numbers and geometry of the associated cubic Diophantine equations that are similar in many ways to the Pell equation. With over 50 geometric diagrams, this book includes illustrations of many of these topics. The book may be thought of as a companion reference for those students of algebraic number theory who wish to find more examples, a collection of recent research results on cubic fields, an easy-to-understand source for learning about Voronoi's unit algorithm and several classical results which are still relevant to the field, and a book which helps bridge a gap in understanding connections between algebraic geometry and number theory. The exposition includes numerous discussions on calculating with cubic fields including simple continued fractions of cubic irrational numbers, arithmetic using integer matrices, ideal class group computations, lattices over cubic fields, construction of cubic fields with a given discriminant, the search for elements of norm 1 of a cubic field with rational parametrization, and Voronoi's algorithm for finding a system of fundamental units. Throughout, the discussions are framed in terms of a binary cubic form that may be used to describe a given cubic field. This unifies the chapters of this book despite the diversity of their number theoretic topics.

The main purpose of these lectures is first to briefly survey the fundamental con nection between the representation theory of the symmetric group Sn and the theory of symmetric functions and second to show how combinatorial methods that arise naturally in the theory of symmetric functions lead to efficient algorithms to express various prod ucts of representations of Sn in terms of sums of irreducible representations. That is, there is a basic isometry which maps the center of the group algebra of Sn, Z(Sn), to the space of homogeneous symmetric functions of degree n, An. This basic isometry is known as the Frobenius map, F. The Frobenius map allows us to reduce calculations involving characters of the symmetric group to calculations involving Schur functions. Now there is a very rich and beautiful theory of the combinatorics of symmetric functions that has been developed in recent years. The combinatorics of symmetric functions, then leads to a number of very efficient algorithms for expanding various products of Schur functions into a sum of Schur functions. Such expansions of products of Schur functions correspond via the Frobenius map to decomposing various products of irreducible representations of Sn into their irreducible components. In addition, the Schur functions are also the characters of the irreducible polynomial representations of the general linear group over the complex numbers GLn(C)."

To put the world of linear algebra to advanced use, it is not enough to merely understand the theory; there is a significant gap between the theory of linear algebra and its myriad expressions in nearly every computational domain. To bridge this gap, it is essential to process the theory by solving many exercises, thus obtaining a firmer grasp of its diverse applications. Similarly, from a theoretical perspective, diving into the literature on advanced linear algebra often reveals more and more topics that are deferred to exercises instead of being treated in the main text. As exercises grow more complex and numerous, it becomes increasingly important to provide supporting material and guidelines on how to solve them, supporting students' learning process. This book provides precisely this type of supporting material for the textbook "Numerical Linear Algebra and Matrix Factorizations," published as Vol. 22 of Springer's Texts in Computational Science and Engineering series. Instead of omitting details or merely providing rough outlines, this book offers detailed proofs, and connects the solutions to the corresponding results in the textbook. For the algorithmic exercises the utmost level of detail is provided in the form of MATLAB implementations. Both the textbook and solutions are self-contained. This book and the textbook are of similar length, demonstrating that solutions should not be considered a minor aspect when learning at advanced levels.

This series presents some tools of applied mathematics in the areas of proba bility theory, operator calculus, representation theory, and special functions used currently, and we expect more and more in the future, for solving problems in math ematics, physics, and, now, computer science. Much of the material is scattered throughout available literature, however, we have nowhere found in accessible form all of this material collected. The presentation of the material is original with the authors. The presentation of probability theory in connection with group represen tations is new, this appears in Volume I. Then the applications to computer science in Volume II are original as well. The approach found in Volume III, which deals in large part with infinite-dimensional representations of Lie algebras/Lie groups, is new as well, being inspired by the desire to find a recursive method for calcu lating group representations. One idea behind this is the possibility of symbolic computation of the matrix elements. In this volume, Representations and Probability Theory, we present an intro duction to Lie algebras and Lie groups emphasizing the connections with operator calculus, which we interpret through representations, principally, the action of the Lie algebras on spaces of polynomials. The main features are the connection with probability theory via moment systems and the connection with the classical ele mentary distributions via representation theory. The various systems of polynomi als that arise are one of the most interesting aspects of this study."

Contents and treatment are fresh and very different from the standard treatments Presents a fully constructive version of what it means to do algebra The exposition is not only clear, it is friendly, philosophical, and considerate even to the most naive or inexperienced reader

This is a comprehensive introduction to the modular representation theory of finite groups, with an emphasis on block theory. The two volumes take into account classical results and concepts as well as some of the modern developments in the area. Volume 1 introduces the broader context, starting with general properties of finite group algebras over commutative rings, moving on to some basics in character theory and the structure theory of algebras over complete discrete valuation rings. In Volume 2, blocks of finite group algebras over complete p-local rings take centre stage, and many key results which have not appeared in a book before are treated in detail. In order to illustrate the wide range of techniques in block theory, the book concludes with chapters classifying the source algebras of blocks with cyclic and Klein four defect groups, and relating these classifications to the open conjectures that drive block theory.

The problems of constructing covering codes and of estimating their parameters are the main concern of this book. It provides a unified account of the most recent theory of covering codes and shows how a number of mathematical and engineering issues are related to covering problems.

Scientists involved in discrete mathematics, combinatorics, computer science, information theory, geometry, algebra or number theory will find the book of particular significance. It is designed both as an introductory textbook for the beginner and as a reference book for the expert mathematician and engineer.

A number of unsolved problems suitable for research projects are also discussed.

This book provides the reader with the tools to understand the ongoing classification and construction project of Lie superalgebras. It presents the material in as simple terms as possible. Coverage specifically details Borcherds-Kac-Moody superalgebras. The book examines the link between the above class of Lie superalgebras and automorphic form and explains their construction from lattice vertex algebras. It also includes all necessary background information.

In this well-illustrated book the authors, Sinan Kanbir, Ken Clements, and Nerida Ellerton, tackle a persistent, and universal, problem in school mathematics-why do so many middle-school and secondary-school students find it difficult to learn algebra well? What makes the book important are the unique features which comprise the design-research approach that the authors adopted in seeking a solution to the problem. The first unique feature is that the authors offer an overview of the history of school algebra. Despite the fact that algebra has been an important component of secondary-school mathematics for more than three centuries, there has never been a comprehensive historical analysis of factors influencing the teaching and learning of that component. The authors identify, through historical analysis, six purposes of school algebra: (a) algebra as a body of knowledge essential to higher mathematical and scientific studies, (b) algebra as generalized arithmetic, (c) algebra as a prerequisite for entry to higher studies, (d) algebra as offering a language and set of procedures for modeling real-life problems, (e) algebra as an aid to describing structural properties in elementary mathematics, and (f) algebra as a study of variables. They also raise the question whether school algebra represents a unidimensional trait. Kanbir, Clements and Ellerton offer an unusual hybrid theoretical framework for their intervention study (by which seventh-grade students significantly improved their elementary algebra knowledge and skills). Their theoretical frame combined Charles Sanders Peirce's triadic signifier-interpretant-signified theory, which is in the realm of semiotics, with Johann Friedrich Herbart's theory of apperception, and Ken Clements' and Gina Del Campo's theory relating to the need to expand modes of communications in mathematics classrooms so that students engage in receptive and expressive modes. Practicing classroom teachers formed part of the research team. This book appears in Springer's series on the "History of Mathematics Education." Not only does it include an important analysis of the history of school algebra, but it also adopts a theoretical frame which relies more on "theories from the past," than on contemporary theories in the field of mathematics education. The results of the well-designed classroom intervention are sufficiently impressive that the study might havecreated and illuminated a pathway for future researchers to take.

This book describes the efficient implementation of public-key cryptography (PKC) to address the security challenges of massive amounts of information generated by the vast network of connected devices, ranging from tiny Radio Frequency Identification (RFID) tags to powerful desktop computers. It investigates implementation aspects of post quantum PKC and homomorphic encryption schemes whose security is based on the hardness of the ring-learning with error (LWE) problem. The work includes designing an FPGA-based accelerator to speed up computation on encrypted data in the cloud computer. It also proposes a more practical scheme that uses a special module called recryption box to assist homomorphic function evaluation, roughly 20 times faster than the implementation without this module.

Considering that the motion of strings with finitely many masses on them is described by difference equations, this book presents the spectral theory of such problems on finite graphs of strings. The direct problem of finding the eigenvalues as well as the inverse problem of finding strings with a prescribed spectrum are considered. This monograph gives a comprehensive and self-contained account on the subject, thereby also generalizing known results. The interplay between the representation of rational functions and their zeros and poles is at the center of the methods used. The book also unravels connections between finite dimensional and infinite dimensional spectral problems on graphs, and between self-adjoint and non-self-adjoint finite-dimensional problems. This book is addressed to researchers in spectral theory of differential and difference equations as well as physicists and engineers who may apply the presented results and methods to their research.

This is the second volume of the new subseries "Invariant Theory and Algebraic Transformation Groups". The aim of the survey by A. Bialynicki-Birula is to present the main trends and achievements of research in the theory of quotients by actions of algebraic groups. This theory contains geometric invariant theory with various applications to problems of moduli theory. The contribution by J. Carrell treats the subject of torus actions on algebraic varieties, giving a detailed exposition of many of the cohomological results one obtains from having a torus action with fixed points. Many examples, such as toric varieties and flag varieties, are discussed in detail. W.M. McGovern studies the actions of a semisimple Lie or algebraic group on its Lie algebra via the adjoint action and on itself via conjugation. His contribution focuses primarily on nilpotent orbits that have found the widest application to representation theory in the last thirty-five years.

Fuzzy logics are many-valued logics that are well suited to reasoning in the context of vagueness. They provide the basis for the wider field of Fuzzy Logic, encompassing diverse areas such as fuzzy control, fuzzy databases, and fuzzy mathematics. This book provides an accessible and up-to-date introduction to this fast-growing and increasingly popular area. It focuses in particular on the development and applications of "proof-theoretic" presentations of fuzzy logics; the result of more than ten years of intensive work by researchers in the area, including the authors. In addition to providing alternative elegant presentations of fuzzy logics, proof-theoretic methods are useful for addressing theoretical problems (including key standard completeness results) and developing efficient deduction and decision algorithms. Proof-theoretic presentations also place fuzzy logics in the broader landscape of non-classical logics, revealing deep relations with other logics studied in Computer Science, Mathematics, and Philosophy. The book builds methodically from the semantic origins of fuzzy logics to proof-theoretic presentations such as Hilbert and Gentzen systems, introducing both theoretical and practical applications of these presentations.

This book is an extensively revised version of my textbook "Yesodot 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."

Elementary Methods in Number Theory begins with "a first course in number theory" for students with no previous knowledge of the subject. The main topics are divisibility, prime numbers, and congruences. There is also an introduction to Fourier analysis on finite abelian groups, and a discussion on the abc conjecture and its consequences in elementary number theory. In the second and third parts of the book, deep results in number theory are proved using only elementary methods. Part II is about multiplicative number theory, and includes two of the most famous results in mathematics: the Erdös-Selberg elementary proof of the prime number theorem, and Dirichlets theorem on primes in arithmetic progressions. Part III is an introduction to three classical topics in additive number theory: Warings problems for polynomials, Liouvilles method to determine the number of representations of an integer as the sum of an even number of squares, and the asymptotics of partition functions. Melvyn B. Nathanson is Professor of Mathematics at the City University of New York (Lehman College and the Graduate Center). He is the author of the two other graduate texts: Additive Number Theory: The Classical Bases and Additive Number Theory: Inverse Problems and the Geometry of Sumsets.

This volume highlights the mathematical research presented at the 2019 Association for Women in Mathematics (AWM) Research Symposium held at Rice University, April 6-7, 2019. The symposium showcased research from women across the mathematical sciences working in academia, government, and industry, as well as featured women across the career spectrum: undergraduates, graduate students, postdocs, and professionals. The book is divided into eight parts, opening with a plenary talk and followed by a combination of research paper contributions and survey papers in the different areas of mathematics represented at the symposium: algebraic combinatorics and graph theory algebraic biology commutative algebra analysis, probability, and PDEs topology applied mathematics mathematics education

Considered a classic by many, A First Course in Abstract Algebra is an in-depth introduction to abstract algebra. Focused on groups, rings and fields, this text gives students a firm foundation for more specialized work by emphasizing an understanding of the nature of algebraic structures.

This book is the first systematic treatment of this area so far scattered in a vast number of articles. As in classical topology, concrete problems require restricting the (generalized point-free) spaces by various conditions playing the roles of classical separation axioms. These are typically formulated in the language of points; but in the point-free context one has either suitable translations, parallels, or satisfactory replacements. The interrelations of separation type conditions, their merits, advantages and disadvantages, and consequences are discussed. Highlights of the book include a treatment of the merits and consequences of subfitness, various approaches to the Hausdorff's axiom, and normality type axioms. Global treatment of the separation conditions put them in a new perspective, and, a.o., gave some of them unexpected importance. The text contains a lot of quite recent results; the reader will see the directions the area is taking, and may find inspiration for her/his further work. The book will be of use for researchers already active in the area, but also for those interested in this growing field (sometimes even penetrating into some parts of theoretical computer science), for graduate and PhD students, and others. For the reader's convenience, the text is supplemented with an Appendix containing necessary background on posets, frames and locales.