A large portion of the book can be used as a textbook for graduate and upper level undergraduate students in mathematics, communication engineering, computer science and other fields. The remaining part can be used as references for specialists. Explicit construction and computation of finite fields are emphasized. In particular, the construction of irreducible polynomials and normal basis of finite field is included. A detailed treatment of optimal normal basis and Galoi's rings is included. It is the first time that the galois rings are in book form.

A collection of lectures presented at the Fourth International Conference on Nonassociative Algebra and its Applications, held in Sao Paulo, Brazil. Topics in algebra theory include alternative, Bernstein, Jordan, lie, and Malcev algebras and superalgebras. The volume presents applications to population genetics theory, physics, and more.

This volume contains the proceedings of the Conference on Representations of Algebras - Sao Paulo (CRASP), held at the Instituto de Matematica e Estatistica of the Universidade de Sao Paulo, Brazil. It discusses Hopf, tubular, quasischurian, wild hereditary, concealed-canonical Artin, Brauer star, and Koszul algebras.

From Polynomials to Sums of Squares describes a journey through the foothills of algebra and number theory based around the central theme of factorization. The book begins by providing basic knowledge of rational polynomials, then gradually introduces other integral domains, and eventually arrives at sums of squares of integers. The text is complemented with illustrations that feature specific examples. Other than familiarity with complex numbers and some elementary number theory, very little mathematical prerequisites are needed. The accompanying disk enables readers to explore the subject further by removing the tedium of doing calculations by hand. Throughout the text there are practical activities involving the computer.

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.

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.

Concise Introduction to Linear Algebra deals with the subject of linear algebra, covering vectors and linear systems, vector spaces, orthogonality, determinants, eigenvalues and eigenvectors, singular value decomposition. It adopts an efficient approach to lead students from vectors, matrices quickly into more advanced topics including, LU decomposition, orthogonal decomposition, Least squares solutions, Gram-Schmidt process, eigenvalues and eigenvectors, diagonalizability, spectral decomposition, positive definite matrix, quadratic forms, singular value decompositions and principal component analysis. This book is designed for onesemester teaching to undergraduate students.

Algebraic graph theory is a fascinating subject concerned with the interplay between algebra and graph theory. Algebraic tools can be used to give surprising and elegant proofs of graph theoretic facts, and there are many interesting algebraic objects associated with graphs. The authors take an inclusive view of the subject, and present a wide range of topics. These range from standard classics, such as the characterization of line graphs by eigenvalues, to more unusual areas such as geometric embeddings of graphs and the study of graph homomorphisms. The authors' goal has been to present each topic in a self-contained fashion, presenting the main tools and ideas, with an emphasis on their use in understanding concrete examples. A substantial proportion of the book covers topics that have not appeared in book form before, and as such it provides an accessible introduction to the research literature and to important open questions in modern algebraic graph theory. This book is primarily aimed at graduate students and researchers in graph theory, combinatorics, or discrete mathematics in general. However, all the necessary graph theory is developed from scratch, so the only pre-requisite for reading it is a first course in linear algebra and a small amount of elementary group theory. It should be accessible to motivated upper-level undergraduates. Chris Godsil is a full professor in the Department of Combinatorics and Optimization at the University of Waterloo. His main research interests lie in the interactions between algebra and combinatorics, in particular the application of algebraic techniques to graphs, designs and codes. He has published more than 70 papers in these areas, is a founding editor of "The Journal of Algebraic Combinatorics" and is the author of the book "Algebraic Combinatorics". Gordon Royle teaches in the Department of Computer Science & Software Engineering at the University of Western Australia. His main research interests lie in the application of computers to combinatorial problems, in particular the cataloguing, enumeration and investigation of graphs, designs and finite geometries. He has published more than 30 papers in graph theory, design theory and finite geometry.

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.

This book is appropriate for second to fourth year undergraduates. In addition to the material traditionally taught at this level, the book contains several applications: Polya-Burnside Enumeration, Mutually Orthogonal Latin Squares, Error-Correcting Codes and a classification of the finite groups of isometries of the plane and the finite rotation groups in Euclidean 3-space. It is hoped that these applications will help the reader achieve a better grasp of the rather abstract ideas presented and convince him/her that pure mathematics, in addition to having an austere beauty of its own, can be applied to solving practical problems.Considerable emphasis is placed on the algebraic system consisting of congruence classes mod n under the usual operations of addition and multiplication. The reader is thus introduced - via congruence classes - to the idea of cosets and factor groups. This enables the transition to cosets and factor objects in a more abstract setting to be relatively painless. The chapters dealing with applications help to reinforce the concepts and methods developed in the context of more down-to-earth problems.Most introductory texts in abstract algebra either avoid cosets, factor objects and homomorphisms completely or introduce them towards the end of the book. In this book, these topics are dealt with early on so that the reader has at his/her disposal the tools required to give elegant proofs of the fundamental theorems. Moreover, homomorphisms play such a prominent role in algebra that they are used in this text wherever possible, even if there are alternative methods of proof.

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.

This is the first book of its kind which teaches matrix algebra, allowing the student to learn the material by actually working with matrix objects in modern computer environment of R. Instead of a calculator, R is a vastly more powerful free software and graphics system.

The book provides a comprehensive overview of matrix theory without being bogged down in proofs or tedium. The reader can check each matrix result with numerical examples of exactly what they mean and understand their implications. The book does not shy away from advanced topics, especially the ones with practical applications.

This is the first book of its kind which teaches matrix algebra, allowing the student to learn the material by actually working with matrix objects in modern computer environment of R. Instead of a calculator, R is a vastly more powerful free software and graphics system.The book provides a comprehensive overview of matrix theory without being bogged down in proofs or tedium. The reader can check each matrix result with numerical examples of exactly what they mean and understand their implications. The book does not shy away from advanced topics, especially the ones with practical applications.

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 textbook, set for a one or two semester course in commutative algebra, provides an introduction to commutative algebra at the postgraduate and research levels. The main prerequisites are familiarity with groups, rings and fields. Proofs are self-contained.

The book will be useful to beginners and experienced researchers alike. The material is so arranged that the beginner can learn through self-study or by attending a course. For the experienced researcher, the book may serve to present new perspectives on some well-known results, or as a reference.

This monograph is concerned with exchange rings in various conditions related to stable range. Diagonal reduction of regular matrices and cleanness of square matrices are also discussed. Readers will come across various topics: cancellation of modules, comparability of modules, cleanness, monoid theory, matrix theory, K-theory, topology, amongst others. This is a first-ever book that contains many of these topics considered under stable range conditions. It will be of great interest to researchers and graduate students involved in ring and module theories.

This textbook, set for a one or two semester course in commutative algebra, provides an introduction to commutative algebra at the postgraduate and research levels. The main prerequisites are familiarity with groups, rings and fields. Proofs are self-contained.

The book will be useful to beginners and experienced researchers alike. The material is so arranged that the beginner can learn through self-study or by attending a course. For the experienced researcher, the book may serve to present new perspectives on some well-known results, or as a reference.

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.

"Data Science Foundations is most welcome and, indeed, a piece of literature that the field is very much in need of...quite different from most data analytics texts which largely ignore foundational concepts and simply present a cookbook of methods...a very useful text and I would certainly use it in my teaching." - Mark Girolami, Warwick University Data Science encompasses the traditional disciplines of mathematics, statistics, data analysis, machine learning, and pattern recognition. This book is designed to provide a new framework for Data Science, based on a solid foundation in mathematics and computational science. It is written in an accessible style, for readers who are engaged with the subject but not necessarily experts in all aspects. It includes a wide range of case studies from diverse fields, and seeks to inspire and motivate the reader with respect to data, associated information, and derived knowledge.

Mixing elementary results and advanced methods, Algebraic Approach to Differential Equations aims to accustom differential equation specialists to algebraic methods in this area of interest. It presents material from a school organized by The Abdus Salam International Centre for Theoretical Physics (ICTP), the Bibliotheca Alexandrina, and the International Centre for Pure and Applied Mathematics (CIMPA).

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.

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