This book presents results about certain summability methods, such as the Abel method, the Norlund method, the Weighted mean method, the Euler method and the Natarajan method, which have not appeared in many standard books. It proves a few results on the Cauchy multiplication of certain summable series and some product theorems. It also proves a number of Steinhaus type theorems. In addition, it introduces a new definition of convergence of a double sequence and double series and proves the Silverman-Toeplitz theorem for four-dimensional infinite matrices, as well as Schur's and Steinhaus theorems for four-dimensional infinite matrices. The Norlund method, the Weighted mean method and the Natarajan method for double sequences are also discussed in the context of the new definition. Divided into six chapters, the book supplements the material already discussed in G.H.Hardy's Divergent Series. It appeals to young researchers and experienced mathematicians who wish to explore new areas in Summability Theory..

Noncommutative geometry studies an interplay between spatial forms and algebras with non-commutative multiplication. This book covers the key concepts of noncommutative geometry and its applications in topology, algebraic geometry, and number theory. Our presentation is accessible to the graduate students as well as nonexperts in the field. The second edition includes two new chapters on arithmetic topology and quantum arithmetic.

This innovative monograph explores a new mathematical formalism in higher-order temporal logic for proving properties about the behavior of systems. Developed by the authors, the goal of this novel approach is to explain what occurs when multiple, distinct system components interact by using a category-theoretic description of behavior types based on sheaves. The authors demonstrate how to analyze the behaviors of elements in continuous and discrete dynamical systems so that each can be translated and compared to one another. Their temporal logic is also flexible enough that it can serve as a framework for other logics that work with similar models. The book begins with a discussion of behavior types, interval domains, and translation invariance, which serves as the groundwork for temporal type theory. From there, the authors lay out the logical preliminaries they need for their temporal modalities and explain the soundness of those logical semantics. These results are then applied to hybrid dynamical systems, differential equations, and labeled transition systems. A case study involving aircraft separation within the National Airspace System is provided to illustrate temporal type theory in action. Researchers in computer science, logic, and mathematics interested in topos-theoretic and category-theory-friendly approaches to system behavior will find this monograph to be an important resource. It can also serve as a supplemental text for a specialized graduate topics course.

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.

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.

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.

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.

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.

This book, the fourth book in the four-volume series in algebra, discusses Lie algebra and representation theory in detail. It covers topics such as semisimple Lie algebras, root systems, representation theory of Lie algebra, Chevalley groups and representation theory of Chevalley groups. Numerous motivating illustrations have been presented along with exercises, enabling readers to acquire a good understanding of topics which they can then use to find the exact or most realistic solutions to their problems.

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)."

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

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 monograph is devoted to a new class of non-commutative rings, skew Poincare-Birkhoff-Witt (PBW) extensions. Beginning with the basic definitions and ring-module theoretic/homological properties, it goes on to investigate finitely generated projective modules over skew PBW extensions from a matrix point of view. To make this theory constructive, the theory of Groebner bases of left (right) ideals and modules for bijective skew PBW extensions is developed. For example, syzygies and the Ext and Tor modules over these rings are computed. Finally, applications to some key topics in the noncommutative algebraic geometry of quantum algebras are given, including an investigation of semi-graded Koszul algebras and semi-graded Artin-Schelter regular algebras, and the noncommutative Zariski cancellation problem. The book is addressed to researchers in noncommutative algebra and algebraic geometry as well as to graduate students and advanced undergraduate students.

This volume provides an introduction to modern space-time discretization methods such as finite and boundary elements and isogeometric analysis for time-dependent initial-boundary value problems of parabolic and hyperbolic type. Particular focus is given on stable formulations, error estimates, adaptivity in space and time, efficient solution algorithms, parallelization of the solution pipeline, and applications in science and engineering.

Invitation to Linear Algebra is an informative, clearly written, flexible textbook for instructors and students. Based on over 30 years of experience as a mathematics professor, the author invites students to develop a more informed understanding of complex algebraic concepts using innovative, easy-to-follow methods. The book is organized into lessons rather than chapters. This limits the size of the mathematical morsels that students must digest, making it easier for instructors to budget class time. Each definition is carefully explained with detailed proofs of key theorems, including motivation for each step. This makes the book more flexible, allowing instructors to choose material that reflects their and their students' interests. A larger than normal amount of exercises illustrate how linear and nonlinear algebra apply in the students' areas of study. Features The book's unique lesson format enables students to better understand algebraic concepts Students will learn key elements of linear algebra in an enjoyable fashion Large number of exercises illustrate the applications of the course material Allows instructors to create a course around individual lessons Detailed solutions and hints are provided to selected exercises

* A new approach that breaks new ground using psychophysics and mathematics in order to investigate human interaction * Identifies the critical direction of change, and the means to achieve it, in order to maintain a stable social environment that is going to require testable and provable theories that apply to our social space and the various cultures and groups that exist within it * An important text for graduate and advanced undergraduate students or classes, along with private and government analysts all operating within the areas of political theory, detection theory, social psychology, organizational behavior, psychophysics, and applied mathematics in the social and information sciences

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."

This book explores and highlights the fertile interaction between logic and operator algebras, which in recent years has led to the resolution of several long-standing open problems on C*-algebras. The interplay between logic and operator algebras (C*-algebras, in particular) is relatively young and the author is at the forefront of this interaction. The deep level of scholarship contained in these pages is evident and opens doors to operator algebraists interested in learning about the set-theoretic methods relevant to their field, as well as to set-theorists interested in expanding their view to the non-commutative realm of operator algebras. Enough background is included from both subjects to make the book a convenient, self-contained source for students. A fair number of the exercises form an integral part of the text. They are chosen to widen and deepen the material from the corresponding chapters. Some other exercises serve as a warmup for the latter chapters.

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 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.

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 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.

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 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.