"This collection of essays spans pure and applied mathematics. Readers interested in mathematical research and historical aspects of mathematics will appreciate the enlightening content of these essays. Highlighting the pervasive nature of mathematics today in different areas, the book also covers the spread of mathematical ideas and techniques in areas ranging from computer science to physics to biology"--

This book offers an introduction to the theory of groupoids and their representations encompassing the standard theory of groups. Using a categorical language, developed from simple examples, the theory of finite groupoids is shown to knit neatly with that of groups and their structure as well as that of their representations is described. The book comprises numerous examples and applications, including well-known games and puzzles, databases and physics applications. Key concepts have been presented using only basic notions so that it can be used both by students and researchers interested in the subject. Category theory is the natural language that is being used to develop the theory of groupoids. However, categorical presentations of mathematical subjects tend to become highly abstract very fast and out of reach of many potential users. To avoid this, foundations of the theory, starting with simple examples, have been developed and used to study the structure of finite groups and groupoids. The appropriate language and notions from category theory have been developed for students of mathematics and theoretical physics. The book presents the theory on the same level as the ordinary and elementary theories of finite groups and their representations, and provides a unified picture of the same. The structure of the algebra of finite groupoids is analysed, along with the classical theory of characters of their representations. Unnecessary complications in the formal presentation of the subject are avoided. The book offers an introduction to the language of category theory in the concrete setting of finite sets. It also shows how this perspective provides a common ground for various problems and applications, ranging from combinatorics, the topology of graphs, structure of databases and quantum physics.

The book is devoted to varieties of linear singular integral equations, with special emphasis on their methods of solution. It introduces the singular integral equations and their applications to researchers as well as graduate students of this fascinating and growing branch of applied mathematics.

Under intense scrutiny for the last few decades, Multiple Objective Decision Making (MODM) has been useful for dealing with the multiple-criteria decisions and planning problems associated with many important applications in fields including management science, engineering design, and transportation. Rough set theory has also proved to be an effective mathematical tool to counter the vague description of objects in fields such as artificial intelligence, expert systems, civil engineering, medical data analysis, data mining, pattern recognition, and decision theory.

Rough Multiple Objective Decision Making is perhaps the first book to combine state-of-the-art application of rough set theory, rough approximation techniques, and MODM. It illustrates traditional techniques-and some that employ simulation-based intelligent algorithms-to solve a wide range of realistic problems. Application of rough theory can remedy two types of uncertainty (randomness and fuzziness) which present significant drawbacks to existing decision-making methods, so the authors illustrate the use of rough sets to approximate the feasible set, and they explore use of rough intervals to demonstrate relative coefficients and parameters involved in bi-level MODM. The book reviews relevant literature and introduces models for both random and fuzzy rough MODM, applying proposed models and algorithms to problem solutions.

Given the broad range of uses for decision making, the authors offer background and guidance for rough approximation to real-world problems, with case studies that focus on engineering applications, including construction site layout planning, water resource allocation, and resource-constrained project scheduling. The text presents a general framework of rough MODM, including basic theory, models, and algorithms, as well as a proposed methodological system and discussion of future research.

Drawing on rich classroom observations of educators teaching in China and the U.S., this book details an innovative and effective approach to teaching algebra at the elementary level, namely, "teaching through example-based problem solving" (TEPS). Recognizing young children's particular cognitive and developmental capabilities, this book powerfully argues for the importance of infusing algebraic thinking into early grade mathematics teaching and illustrates how this has been achieved by teachers in U.S. and Chinese contexts. Documenting best practice and students' responses to example-based instruction, the text demonstrates that this TEPS approach - which involves the use of worked examples, representations, and deep questions - helps students learn and master fundamental mathematical ideas, making it highly effective in developing algebraic readiness and mathematical understanding. This text will benefit post-graduate students, researchers, and academics in the fields of mathematics, STEM, and elementary education, as well as algebra research more broadly. Those interested in teacher education, classroom practice, and developmental and cognitive psychology will also find this volume of interest.

Metaharmonic Lattice Point Theory covers interrelated methods and tools of spherically oriented geomathematics and periodically reflected analytic number theory. The book establishes multi-dimensional Euler and Poisson summation formulas corresponding to elliptic operators for the adaptive determination and calculation of formulas and identities of weighted lattice point numbers, in particular the non-uniform distribution of lattice points.

The author explains how to obtain multi-dimensional generalizations of the Euler summation formula by interpreting classical Bernoulli polynomials as Green's functions and linking them to Zeta and Theta functions. To generate multi-dimensional Euler summation formulas on arbitrary lattices, the Helmholtz wave equation must be converted into an associated integral equation using Green's functions as bridging tools. After doing this, the weighted sums of functional values for a prescribed system of lattice points can be compared with the corresponding integral over the function.

Exploring special function systems of Laplace and Helmholtz equations, this book focuses on the analytic theory of numbers in Euclidean spaces based on methods and procedures of mathematical physics. It shows how these fundamental techniques are used in geomathematical research areas, including gravitation, magnetics, and geothermal.

This is an introductory textbook designed for undergraduate mathematics majors with an emphasis on abstraction and in particular, the concept of proofs in the setting of linear algebra. Typically such a student would have taken calculus, though the only prerequisite is suitable mathematical grounding. The purpose of this book is to bridge the gap between the more conceptual and computational oriented undergraduate classes to the more abstract oriented classes. The book begins with systems of linear equations and complex numbers, then relates these to the abstract notion of linear maps on finite-dimensional vector spaces, and covers diagonalization, eigenspaces, determinants, and the Spectral Theorem. Each chapter concludes with both proof-writing and computational exercises.

A comprehensive overview of nonlinear H control theory for both continuous-time and discrete-time systems, Nonlinear H -Control, Hamiltonian Systems and Hamilton-Jacobi Equations covers topics as diverse as singular nonlinear H -control, nonlinear H -filtering, mixed H2/ H -nonlinear control and filtering, nonlinear H -almost-disturbance-decoupling, and algorithms for solving the ubiquitous Hamilton-Jacobi-Isaacs equations. The link between the subject and analytical mechanics as well as the theory of partial differential equations is also elegantly summarized in a single chapter. Recent progress in developing computational schemes for solving the Hamilton-Jacobi equation (HJE) has facilitated the application of Hamilton-Jacobi theory in both mechanics and control. As there is currently no efficient systematic analytical or numerical approach for solving them, the biggest bottle-neck to the practical application of the nonlinear equivalent of the H -control theory has been the difficulty in solving the Hamilton-Jacobi-Isaacs partial differential-equations (or inequalities). In light of this challenge, the author hopes to inspire continuing research and discussion on this topic via examples and simulations, as well as helpful notes and a rich bibliography. Nonlinear H -Control, Hamiltonian Systems and Hamilton-Jacobi Equations was written for practicing professionals, educators, researchers and graduate students in electrical, computer, mechanical, aeronautical, chemical, instrumentation, industrial and systems engineering, as well as applied mathematics, economics and management.

This book Algebraic Modeling Systems - Modeling and Solving Real World Optimization Problems - deals with the aspects of modeling and solving real-world optimization problems in a unique combination. It treats systematically the major algebraic modeling languages (AMLs) and modeling systems (AMLs) used to solve mathematical optimization problems. AMLs helped significantly to increase the usage of mathematical optimization in industry. Therefore it is logical consequence that the GOR (Gesellschaft fur Operations Research) Working Group Mathematical Optimization in Real Life had a second meeting devoted to AMLs, which, after 7 years, followed the original 71st Meeting of the GOR (Gesellschaft fur Operations Research) Working Group Mathematical Optimization in Real Life which was held under the title Modeling Languages in Mathematical Optimization during April 23-25, 2003 in the German Physics Society Conference Building in Bad Honnef, Germany. While the first meeting resulted in the book Modeling Languages in Mathematical Optimization, this book is an offspring of the 86th Meeting of the GOR working group which was again held in Bad Honnef under the title Modeling Languages in Mathematical Optimization.

The book provides an insight into the advantages and limitations of the use of fractals in biomedical data. It begins with a brief introduction to the concept of fractals and other associated measures and describes applications for biomedical signals and images. Properties of biological data in relations to fractals and entropy, and the association with health and ageing are also covered. The book provides a detailed description of new techniques on physiological signals and images based on the fractal and chaos theory. The aim of this book is to serve as a comprehensive guide for researchers and readers interested in biomedical signal and image processing and feature extraction for disease risk analyses and rehabilitation applications. While it provides the mathematical rigor for those readers interested in such details, it also describes the topic intuitively such that it is suitable for audience who are interested in applying the methods to healthcare and clinical applications. The book is the outcome of years of research by the authors and is comprehensive and includes other reported outcomes.

Computational Intelligence Assisted Design framework mobilises computational resources, makes use of multiple Computational Intelligence (CI) algorithms and reduces computational costs. This book provides examples of real-world applications of technology. Case studies have been used to show the integration of services, cloud, big data technology and space missions. It focuses on computational modelling of biological and natural intelligent systems, encompassing swarm intelligence, fuzzy systems, artificial neutral networks, artificial immune systems and evolutionary computation. This book provides readers with wide-scale information on CI paradigms and algorithms, inviting readers to implement and problem solve real-world, complex problems within the CI development framework. This implementation framework will enable readers to tackle new problems without difficulty through a few tested MATLAB source codes

Constant false alarm rate detection processes are important in radar signal processing. Such detection strategies are used as an alternative to optimal Neyman-Pearson based decision rules, since they can be implemented as a sliding window process running on a radar range-Doppler map. This book examines the development of such detectors in a modern framework. With a particular focus on high resolution X-band maritime surveillance radar, recent approaches are outlined and examined. Performance is assessed when the detectors are run in real X-band radar clutter. The book introduces relevant mathematical tools to allow the reader to understand the development, and follow its implementation.

There is good reason to be excited about Linear Algebra. With the world becoming increasingly digital, Linear Algebra is gaining more and more importance. When we send texts, share video, do internet searches, there are Linear Algebra algorithms in the background that make it work. This concise introduction to Linear Algebra is authored by a leading researcher presents a book that covers all the requisite material for a first course on the topic in a more practical way. The book focuses on the development of the mathematical theory and presents many applications to assist instructors and students to master the material and apply it to their areas of interest, whether it be to further their studies in mathematics, science, engineering, statistics, economics, or other disciplines. Linear Algebra has very appealing features: *It is a solid axiomatic based mathematical theory that is accessible to a large variety of students. *It has a multitude of applications from many different fields, ranging from traditional science and engineering applications to more 'daily life' applications. *It easily allows for numerical experimentation through the use of a variety of readily available software (both commercial and open source). Several suggestions of different software are made. While MATLAB is certainly still a favorite choice, open-source programs such as Sage (especially among algebraists) and the Python libraries are increasingly popular. This text guides the student to try out different programs by providing specific commands.

Combinatorics of Spreads and Parallelisms covers all known finite and infinite parallelisms as well as the planes comprising them. It also presents a complete analysis of general spreads and partitions of vector spaces that provide groups enabling the construction of subgeometry partitions of projective spaces. The book describes general partitions of finite and infinite vector spaces, including Sperner spaces, focal-spreads, and their associated geometries. Since retraction groups provide quasi-subgeometry and subgeometry partitions of projective spaces, the author thoroughly discusses subgeometry partitions and their construction methods. He also features focal-spreads as partitions of vector spaces by subspaces. In addition to presenting many new examples of finite and infinite parallelisms, the book shows that doubly transitive or transitive t-parallelisms cannot exist unless the parallelism is a line parallelism. Along with the author's other three books (Subplane Covered Nets, Foundations of Translation Planes, Handbook of Finite Translation Planes), this text forms a solid, comprehensive account of the complete theory of the geometries that are connected with translation planes in intricate ways. It explores how to construct interesting parallelisms and how general spreads of vector spaces are used to study and construct subgeometry partitions of projective spaces.

Drawing on the authors' use of the Hadamard-related theory in several successful engineering projects, Theory and Applications of Higher-Dimensional Hadamard Matrices, Second Edition explores the applications and dimensions of Hadamard matrices. This edition contains a new section on the applications of higher-dimensional Hadamard matrices to the areas of telecommunications and information security.

The first part of the book presents fast algorithms, updated constructions, existence results, and generalized forms for Walsh and Hadamard matrices. The second section smoothly transitions from two-dimensional cases to three-, four-, and six-dimensional Walsh and Hadamard matrices and transforms. In the third part, the authors discuss how the n-dimensional Hadamard matrices of order 2 are applied to feed-forward networking, stream ciphers, bent functions, and error correcting codes. They also cover the Boolean approach of Hadamard matrices. The final part provides examples of applications of Hadamard-related ideas to the design and analysis of one-dimensional sequences and two-dimensional arrays.

The theory and ideas of Hadamard matrices can be used in many areas of communications and information security. Through the research problems found in this book, readers can further explore the fascinating issues and applications of the theory of higher-dimensional Hadamard matrices.

The present monograph on matrix partial orders, the first on this topic, makes a unique presentation of many partial orders on matrices that have fascinated mathematicians for their beauty and applied scientists for their wide-ranging application potential. Except for the Loewner order, the partial orders considered are relatively new and came into being in the late 1970s. After a detailed introduction to generalized inverses and decompositions, the three basic partial orders - namely, the minus, the sharp and the star - and the corresponding one-sided orders are presented using various generalized inverses. The authors then give a unified theory of all these partial orders as well as study the parallel sums and shorted matrices, the latter being studied at great length. Partial orders of modified matrices are a new addition. Finally, applications are given in statistics and electrical network theory. Deceased

Large dimensional random matrices (LDRM) with specific patterns arise in econometrics, computer science, mathematics, physics, and statistics. This book provides an easy initiation to LDRM. Through a unified approach, we investigate the existence and properties of the limiting spectral distribution (LSD) of different patterned random matrices as the dimension grows. The main ingredients are the method of moments and normal approximation with rudimentary combinatorics for support. Some elementary results from matrix theory are also used. By stretching the moment arguments, we also have a brush with the intriguing but difficult concepts of joint convergence of sequences of random matrices and its ramifications. This book covers the Wigner matrix, the sample covariance matrix, the Toeplitz matrix, the Hankel matrix, the sample autocovariance matrix and the k-Circulant matrices. Quick and simple proofs of their LSDs are provided and it is shown how the semi-circle law and the Marchenko-Pastur law arise as the LSDs of the first two matrices. Extending the basic approach, we also establish interesting limits for some triangular matrices, band matrices, balanced matrices, and the sample autocovariance matrix. We also study the joint convergence of several patterned matrices, and show that independent Wigner matrices converge jointly and are asymptotically free of other patterned matrices. Arup Bose is a Professor at the Indian Statistical Institute, Kolkata, India. He is a distinguished researcher in Mathematical Statistics and has been working in high-dimensional random matrices for the last fifteen years. He has been the Editor of Sankyha for several years and has been on the editorial board of several other journals. He is a Fellow of the Institute of Mathematical Statistics, USA and all three national science academies of India, as well as the recipient of the S.S. Bhatnagar Award and the C.R. Rao Award. His forthcoming books are the monograph, Large Covariance and Autocovariance Matrices (with Monika Bhattacharjee), to be published by Chapman & Hall/CRC Press, and a graduate text, U-statistics, M-estimates and Resampling (with Snigdhansu Chatterjee), to be published by Hindustan Book Agency.

Injective Modules and Injective Quotient Rings, in two parts, is the only book of its kind to combine commutative and noncommutative ring theory. This unique and outstanding contribution to the mathematical literature will immediately advance the studies of mathematicians and graduate students in the field. Written by a leading expert in the field, Injective Modules and Injective Quotient Rings offers readers the key concepts and methods used in both noncommutative and commutative ring theory. Part I provides the first non-torsion-theory proof of the Teply-Miller theorem and the first statement and proof of the converse of the Teply-Miller-Hansen theorem. Many applications of these theorems to the structure of rings and modules are given, including generalizations of theorems of Cailleau-Beck and Matlis on the structure of -injectives and commutative rings. Part II provides an alternative approach to the solution of Kaplansky's problem on the classification of FGC rings. Of particular importance is the consistent use of noncommutative ring theoretical techniques throughout Part II to obtain theorems lying purely in the domain of commutative ring theory. Graduate students and mathematicians in both commutative and noncommutative ring theory will learn from the unique approach and new general methods in ring theory contained in Injective Modules and Injective Quotient Rings.

With the advent of computers, theoretical studies and solution methods for polynomial equations have changed dramatically. Many classical results can be more usefully recast within a different framework which in turn lends itself to further theoretical development tuned to computation. This first book in a trilogy is devoted to the new approach. It is a handbook covering the classical theory of finding roots of a univariate polynomial, emphasizing computational aspects, especially the representation and manipulation of algebraic numbers, enlarged by more recent representations like the Duval Model and the Thom Codification. Mora aims to show that solving a polynomial equation really means finding algorithms that help one manipulate roots rather than simply computing them; to that end he also surveys algorithms for factorizing univariate polynomials.

This is a matrix-oriented approach to linear algebra that covers the traditional material of the courses generally known as "Linear Algebra I" and "Linear Algebra II" throughout North America, but it also includes more advanced topics such as the pseudoinverse and the singular value decomposition that make it appropriate for a more advanced course as well. As is becoming increasingly the norm, the book begins with the geometry of Euclidean 3-space so that important concepts like linear combination, linear independence and span can be introduced early and in a "real" context. The book reflects the author's background as a pure mathematician - all the major definitions and theorems of basic linear algebra are covered rigorously - but the restriction of vector spaces to Euclidean n-space and linear transformations to matrices, for the most part, and the continual emphasis on the system Ax=b, make the book less abstract and more attractive to the students of today than some others. As the subtitle suggests, however, applications play an important role too. Coding theory and least squares are recurring themes. Other applications include electric circuits, Markov chains, quadratic forms and conic sections, facial recognition and computer graphics.

Circulant matrices have been around for a long time and have been extensively used in many scientific areas. This book studies the properties of the eigenvalues for various types of circulant matrices, such as the usual circulant, the reverse circulant, and the k-circulant when the dimension of the matrices grow and the entries are random. In particular, the behavior of the spectral distribution, of the spectral radius and of the appropriate point processes are developed systematically using the method of moments and the various powerful normal approximation results. This behavior varies according as the entries are independent, are from a linear process, and are light- or heavy-tailed. Arup Bose obtained his B.Stat., M.Stat. and Ph.D. degrees from the Indian Statistical Institute. He has been on its faculty at the Theoretical Statistics and Mathematics Unit, Kolkata, India since 1991. He is a Fellow of the Institute of Mathematical Statistics, and of all three national science academies of India. He is a recipient of the S.S. Bhatnagar Prize and the C.R. Rao Award. He is the author of three books: Patterned Random Matrices, Large Covariance and Autocovariance Matrices (with Monika Bhattacharjee) and U-Statistics, M_m-Estimators and Resampling (with Snigdhansu Chatterjee). Koushik Saha obtained a B.Sc. in Mathematics from Ramakrishna Mission Vidyamandiara, Belur and an M.Sc. in Mathematics from Indian Institute of Technology Bombay. He obtained his Ph.D. degree from the Indian Statistical Institute under the supervision of Arup Bose. His thesis on circulant matrices received high praise from the reviewers. He has been on the faculty of the Department of Mathematics, Indian Institute of Technology Bombay since 2014.

This book is purely algebraic and concentrates on cyclic homology rather than on cohomology. It attempts to single out the basic algebraic facts and techniques of the theory.The book is organized in two chapters. The first chapter deals with the intimate relation of cyclic theory to ordinary Hochschild theory. The second chapter deals with cyclic homology as a typical characteristic zero theory.

This is a matrix-oriented approach to linear algebra that covers the traditional material of the courses generally known as "Linear Algebra I" and "Linear Algebra II" throughout North America, but it also includes more advanced topics such as the pseudoinverse and the singular value decomposition that make it appropriate for a more advanced course as well. As is becoming increasingly the norm, the book begins with the geometry of Euclidean 3-space so that important concepts like linear combination, linear independence and span can be introduced early and in a "real" context. The book reflects the author's background as a pure mathematician - all the major definitions and theorems of basic linear algebra are covered rigorously - but the restriction of vector spaces to Euclidean n- space and linear transformations to matrices, for the most part, and the continual emphasis on the system Ax=b, make the book less abstract and more attractive to the students of today than some others. As the subtitle suggests, however, applications play an important role too. Coding theory and least squares are recurring themes. Other applications include electric circuits, Markov chains, quadratic forms and conic sections, facial recognition and computer graphics.

Arming readers with both theoretical and practical knowledge, Advanced Linear Algebra for Engineers with MATLAB (R) provides real-life problems that readers can use to model and solve engineering and scientific problems in fields ranging from signal processing and communications to electromagnetics and social and health sciences. Facilitating a unique understanding of rapidly evolving linear algebra and matrix methods, this book: Outlines the basic concepts and definitions behind matrices, matrix algebra, elementary matrix operations, and matrix partitions, describing their potential use in signal and image processing applications Introduces concepts of determinants, inverses, and their use in solving linear equations that result from electrical and mechanical-type systems Presents special matrices, linear vector spaces, and fundamental principles of orthogonality, using an appropriate blend of abstract and concrete examples and then discussing associated applications to enhance readers' visualization of presented concepts Discusses linear operators, eigenvalues, and eigenvectors, and explores their use in matrix diagonalization and singular value decomposition Extends presented concepts to define matrix polynomials and compute functions using several well-known methods, such as Sylvester's expansion and Cayley-Hamilton Introduces state space analysis and modeling techniques for discrete and continuous linear systems, and explores applications in control and electromechanical systems, to provide a complete solution for the state space equation Shows readers how to solve engineering problems using least square, weighted least square, and total least square techniques Offers a rich selection of exercises and MATLAB (R) assignments that build a platform to enhance readers' understanding of the material Striking the appropriate balance between theory and real-life applications, this book provides both advanced students and professionals in the field with a valuable reference that they will continually consult.

The book provides an introduction to modern abstract algebra and its applications. It covers all major topics of classical theory of numbers, groups, rings, fields and finite dimensional algebras. The book also provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. In particular, it considers algorithm RSA, secret sharing algorithms, Diffie-Hellman Scheme and ElGamal cryptosystem based on discrete logarithm problem. It also presents Buchberger's algorithm which is one of the important algorithms for constructing Groebner basis. Key Features: Covers all major topics of classical theory of modern abstract algebra such as groups, rings and fields and their applications. In addition it provides the introduction to the number theory, theory of finite fields, finite dimensional algebras and their applications. Provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. Presents numerous examples illustrating the theory and applications. It is also filled with a number of exercises of various difficulty. Describes in detail the construction of the Cayley-Dickson construction for finite dimensional algebras, in particular, algebras of quaternions and octonions and gives their applications in the number theory and computer graphics.