From the Foreword: "Dietmar Hildenbrand's new book, Introduction to Geometric Algebra Computing, in my view, fills an important gap in Clifford's geometric algebra literature...I can only congratulate the author for the daring simplicity of his novel educational approach taken in this book, consequently combined with hands on computer based exploration. Without noticing, the active reader will thus educate himself in elementary geometric algebra algorithm development, geometrically intuitive, highly comprehensible, and fully optimized." --Eckhard Hitzer, International Christian University, Tokyo, Japan Geometric Algebra is a very powerful mathematical system for an easy and intuitive treatment of geometry, but the community working with it is still very small. The main goal of this book is to close this gap with an introduction to Geometric Algebra from an engineering/computing perspective. This book is intended to give a rapid introduction to computing with Geometric Algebra and its power for geometric modeling. From the geometric objects point of view, it focuses on the most basic ones, namely points, lines and circles. This algebra is called Compass Ruler Algebra, since it is comparable to working with a compass and ruler. The book explores how to compute with these geometric objects, and their geometric operations and transformations, in a very intuitive way. The book follows a top-down approach, and while it focuses on 2D, it is also easily expandable to 3D computations. Algebra in engineering applications such as computer graphics, computer vision and robotics are also covered.

Noncommutative Geometry and Cayley-smooth Orders explains the theory of Cayley-smooth orders in central simple algebras over function fields of varieties. In particular, the book describes the etale local structure of such orders as well as their central singularities and finite dimensional representations. After an introduction to partial desingularizations of commutative singularities from noncommutative algebras, the book presents the invariant theoretic description of orders and their centers. It proceeds to introduce etale topology and its use in noncommutative algebra as well as to collect the necessary material on representations of quivers. The subsequent chapters explain the etale local structure of a Cayley-smooth order in a semisimple representation, classify the associated central singularity to smooth equivalence, describe the nullcone of these marked quiver representations, and relate them to the study of all isomorphism classes of n-dimensional representations of a Cayley-smooth order. The final chapters study Quillen-smooth algebras via their finite dimensional representations. Noncommutative Geometry and Cayley-smooth Orders provides a gentle introduction to one of mathematics' and physics' hottest topics.

From the reviews: "The 2nd (slightly enlarged) edition of the van Lint's book is a short, concise, mathematically rigorous introduction to the subject. Basic notions and ideas are clearly presented from the mathematician's point of view and illustrated on various special classes of codes...This nice book is a must for every mathematician wishing to introduce himself to the algebraic theory of coding." European Mathematical Society Newsletter, 1993 "Despite the existence of so many other books on coding theory, this present volume will continue to hold its place as one of the standard texts...." The Mathematical Gazette, 1993

From Zero to Infinity is a combination of number lore, number history, and sparkling descriptions of the simply stated, but exceedingly difficult problems posed by the most ordinary numbers that first appeared in 1955, and has been kept in print continuously ever since. With the fifth edition, this classic has been updated to report on advances in number theory over the last 50 years, including the proof of Fermat's Last Theorem. Deceptively simple in style and structure, it is a book to which the reader will return again and again, gaining greater understanding and satisfaction with each reading.

This book aims to provide an introduction to the broad and dynamic subject of discrete energy problems and point configurations. Written by leading authorities on the topic, this treatise is designed with the graduate student and further explorers in mind. The presentation includes a chapter of preliminaries and an extensive Appendix that augments a course in Real Analysis and makes the text self-contained. Along with numerous attractive full-color images, the exposition conveys the beauty of the subject and its connection to several branches of mathematics, computational methods, and physical/biological applications. This work is destined to be a valuable research resource for such topics as packing and covering problems, generalizations of the famous Thomson Problem, and classical potential theory in Rd. It features three chapters dealing with point distributions on the sphere, including an extensive treatment of Delsarte-Yudin-Levenshtein linear programming methods for lower bounding energy, a thorough treatment of Cohn-Kumar universality, and a comparison of 'popular methods' for uniformly distributing points on the two-dimensional sphere. Some unique features of the work are its treatment of Gauss-type kernels for periodic energy problems, its asymptotic analysis of minimizing point configurations for non-integrable Riesz potentials (the so-called Poppy-seed bagel theorems), its applications to the generation of non-structured grids of prescribed densities, and its closing chapter on optimal discrete measures for Chebyshev (polarization) problems.

While the valuation of standard American option contracts has now achieved a fair degree of maturity, much work remains to be done regarding the new contractual forms that are constantly emerging in response to evolving economic conditions and regulations. Focusing on recent developments in the field, American-Style Derivatives provides an extensive treatment of option pricing with an emphasis on the valuation of American options on dividend-paying assets. The book begins with a review of valuation principles for European contingent claims in a financial market in which the underlying asset price follows an Ito process and the interest rate is stochastic and then extends the analysis to American contingent claims. In this context the author lays out the basic valuation principles for American claims and describes instructive representation formulas for their prices. The results are applied to standard American options in the Black-Scholes market setting as well as to a variety of exotic contracts such as barrier, capped, and multi-asset options. He also reviews numerical methods for option pricing and compares their relative performance. The author explains all the concepts using standard financial terms and intuitions and relegates proofs to appendices that can be found at the end of each chapter. The book is written so that the material is easily accessible not only to those with a background in stochastic processes and/or derivative securities, but also to those with a more limited exposure to those areas.

This carefully prepared manuscript presents elimination theory in weighted projective spaces over arbitrary noetherian commutative base rings. Elimination theory is a classical topic in commutative algebra and algebraic geometry, and it has become of renewed importance recently in the context of applied and computational algebra. This monograph provides a valuable complement to sparse elimination theory in that it presents in careful detail the algebraic difficulties from working over general base rings. This is essential for applications in arithmetic geometry and many other places. Necessary tools concerning monoids of weights, generic polynomials and regular sequences are treated independently in the first part of the book. Many supplements added to each chapter provide extra details and insightful examples. Necessary tools concerning monoids of weights, generic polynomials and regular sequences are treated independently in the first part of the book. Many supplements added to each chapter provide extra details and insightful examples.

Describes the development and extension of fundamental idea of Edouard Lucas, a French mathematician and mathematical recreationist, that is still used today in the verification of the largest primes.

Semialgebraic Statistics and Latent Tree Models explains how to analyze statistical models with hidden (latent) variables. It takes a systematic, geometric approach to studying the semialgebraic structure of latent tree models. The first part of the book gives a general introduction to key concepts in algebraic statistics, focusing on methods that are helpful in the study of models with hidden variables. The author uses tensor geometry as a natural language to deal with multivariate probability distributions, develops new combinatorial tools to study models with hidden data, and describes the semialgebraic structure of statistical models. The second part illustrates important examples of tree models with hidden variables. The book discusses the underlying models and related combinatorial concepts of phylogenetic trees as well as the local and global geometry of latent tree models. It also extends previous results to Gaussian latent tree models. This book shows you how both combinatorics and algebraic geometry enable a better understanding of latent tree models. It contains many results on the geometry of the models, including a detailed analysis of identifiability and the defining polynomial constraints.

A selection of the most accessible survey papers from the Millennial Conference on Number Theory. Presented and compiled by a group of international experts, these papers provide a current view of the state of the art and an outlook into the future of number theory research. This book serves as an inspiration to graduate students and as a reference for research mathematicians.

Extending Structures: Fundamentals and Applications treats the extending structures (ES) problem in the context of groups, Lie/Leibniz algebras, associative algebras and Poisson/Jacobi algebras. This concisely written monograph offers the reader an incursion into the extending structures problem which provides a common ground for studying both the extension problem and the factorization problem. Features Provides a unified approach to the extension problem and the factorization problem Introduces the classifying complements problem as a sort of converse of the factorization problem; and in the case of groups it leads to a theoretical formula for computing the number of types of isomorphisms of all groups of finite order that arise from a minimal set of data Describes a way of classifying a certain class of finite Lie/Leibniz/Poisson/Jacobi/associative algebras etc. using flag structures Introduces new (non)abelian cohomological objects for all of the aforementioned categories As an application to the approach used for dealing with the classification part of the ES problem, the Galois groups associated with extensions of Lie algebras and associative algebras are described

Originally published in 1994, The Incommensurability Thesis is a critical study of the Incommensurability Thesis of Thomas Kuhn and Paul Feyerabend. The book examines the theory that different scientific theories may be incommensurable because of conceptual variance. The book presents a critique of the thesis and examines and discusses the arguments for the theory, acknowledging and debating the opposing views of other theorists. The book provides a comprehensive and detailed discussion of the incommensurability thesis.

A selection of the most accessible survey papers from the Millennial Conference on Number Theory. Presented and compiled by a group of international experts, these papers provide a current view of the state of the art and an outlook into the future of number theory research. This book serves as an inspiration to graduate students and as a reference for research mathematicians.

This book provides an introduction to some aspects of the analytic theory of automorphic forms on G=SL2(R) or the upper-half plane X, with respect to a discrete subgroup ^D*G of G of finite covolume. The point of view is inspired by the theory of infinite dimensional unitary representations of G; this is introduced in the last sections, making this connection explicit. The topics treated include the construction of fundamental domains, the notion of automorphic form on ^D*G\G and its relationship with the classical automorphic forms on X, Poincaré series, constant terms, cusp forms, finite dimensionality of the space of automorphic forms of a given type, compactness of certain convolution operators, Eisenstein series, unitary representations of G, and the spectral decomposition of L2(^D*G/G). The main prerequisites are some results in functional analysis (reviewed, with references) and some familiarity with the elementary theory of Lie groups and Lie algebras.

Understanding maths has never been easier. Combining bold, elegant graphics with easy-to-understand text, Simply Maths is the perfect introduction to the subject for those who are short of time but hungry for knowledge. Covering more than 90 key mathematical concepts from prime numbers and fractions to quadratic equations and probability experiments, each pared-back, single-page entry explains the concept more clearly than ever before. Organized by major themes - number theory and systems; calculations; geometry; algebra; graphs; ratio and proportion; measurement; probability and statistics; and calculus - entries explain the essentials of each key mathematical theory with simple clarity and for ease of understanding. Whether you are studying maths at school or college, or simply want a jargon-free overview of the subject, this indispensable guide is packed with everything you need to understand the basics quickly and easily.

This proceedings volume gathers together original articles and survey works that originate from presentations given at the conference Transient Transcendence in Transylvania, held in Brasov, Romania, from May 13th to 17th, 2019. The conference gathered international experts from various fields of mathematics and computer science, with diverse interests and viewpoints on transcendence. The covered topics are related to algebraic and transcendental aspects of special functions and special numbers arising in algebra, combinatorics, geometry and number theory. Besides contributions on key topics from invited speakers, this volume also brings selected papers from attendees.

This monograph provides a self-contained presentation of the foundations of finite fields, including a detailed treatment of their algebraic closures. It also covers important advanced topics which are not yet found in textbooks: the primitive normal basis theorem, the existence of primitive elements in affine hyperplanes, and the Niederreiter method for factoring polynomials over finite fields. We give streamlined and/or clearer proofs for many fundamental results and treat some classical material in an innovative manner. In particular, we emphasize the interplay between arithmetical and structural results, and we introduce Berlekamp algebras in a novel way which provides a deeper understanding of Berlekamp's celebrated factorization algorithm. The book provides a thorough grounding in finite field theory for graduate students and researchers in mathematics. In view of its emphasis on applicable and computational aspects, it is also useful for readers working in information and communication engineering, for instance, in signal processing, coding theory, cryptography or computer science.

To date, the theoretical development of q-calculus has rested on a non-uniform basis. Generally, the bulky Gasper-Rahman notation was used, but the published works on q-calculus looked different depending on where and by whom they were written. This confusion of tongues not only complicated the theoretical development but also contributed to q-calculus remaining a neglected mathematical field. This book overcomes these problems by introducing a new and interesting notation for q-calculus based on logarithms.For instance, q-hypergeometric functions are now visually clear and easy to trace back to their hypergeometric parents. With this new notation it is also easy to see the connection between q-hypergeometric functions and the q-gamma function, something that until now has been overlooked.

The book covers many topics on q-calculus, including special functions, combinatorics, and q-difference equations. Apart from a thorough review of the historical development of q-calculus, this book also presents the domains of modern physics for which q-calculus is applicable, such as particle physics and supersymmetry, to name just a few. "

Pencils of Cubics and Algebraic Curves in the Real Projective Plane thoroughly examines the combinatorial configurations of n generic points in RP(2). Especially how it is the data describing the mutual position of each point with respect to lines and conics passing through others. The first section in this book answers questions such as, can one count the combinatorial configurations up to the action of the symmetric group? How are they pairwise connected via almost generic configurations? These questions are addressed using rational cubics and pencils of cubics for n = 6 and 7. The book's second section deals with configurations of eight points in the convex position. Both the combinatorial configurations and combinatorial pencils are classified up to the action of the dihedral group D8. Finally, the third section contains plentiful applications and results around Hilbert's sixteenth problem. The author meticulously wrote this book based upon years of research devoted to the topic. The book is particularly useful for researchers and graduate students interested in topology, algebraic geometry and combinatorics. Features: Examines how the shape of pencils depends on the corresponding configurations of points Includes topology of real algebraic curves Contains numerous applications and results around Hilbert's sixteenth problem About the Author: Severine Fiedler-le Touze has published several papers on this topic and has been invited to present at many conferences. She holds a Ph.D. from University Rennes1 and was a post-doc at the Mathematical Sciences Research Institute in Berkeley, California.

Pencils of Cubics and Algebraic Curves in the Real Projective Plane thoroughly examines the combinatorial configurations of n generic points in RP(2). Especially how it is the data describing the mutual position of each point with respect to lines and conics passing through others. The first section in this book answers questions such as, can one count the combinatorial configurations up to the action of the symmetric group? How are they pairwise connected via almost generic configurations? These questions are addressed using rational cubics and pencils of cubics for n = 6 and 7. The book's second section deals with configurations of eight points in the convex position. Both the combinatorial configurations and combinatorial pencils are classified up to the action of the dihedral group D8. Finally, the third section contains plentiful applications and results around Hilbert's sixteenth problem. The author meticulously wrote this book based upon years of research devoted to the topic. The book is particularly useful for researchers and graduate students interested in topology, algebraic geometry and combinatorics. Features: Examines how the shape of pencils depends on the corresponding configurations of points Includes topology of real algebraic curves Contains numerous applications and results around Hilbert's sixteenth problem About the Author: Severine Fiedler-le Touze has published several papers on this topic and has been invited to present at many conferences. She holds a Ph.D. from University Rennes1 and was a post-doc at the Mathematical Sciences Research Institute in Berkeley, California.

This proceedings volume convenes selected, peer-reviewed papers presented at the 3rd International Conference on Mathematics and its Applications in Science and Engineering - ICMASE 2022, which was held on July 4-7, 2022 by the Technical University of Civil Engineering of Bucharest, Romania. Works in this volume cover new developments in applications of mathematics in science and engineering, with emphasis on mathematical and computational modeling of real-world problems. Topics range from the use of differential equations to model mechanical structures to the employ of number theory in the development of information security and cryptography. Educational issues specific to the acquisition of mathematical competencies by engineering and science students at all university levels are also touched on. Researchers and university students are the natural audiences for this book, which can be equally appealing to practitioners seeking up-to-date techniques in mathematical applications to different contexts and disciplines.

This volume aims to present a straightforward and easily accessible survey of the analytic theory of quadratic forms. Written at an elementary level, the book provides a sound basis from which the reader can study advanced works and undertake original research. Roughly half a century ago C.L. Siegel discovered a new type of automorphic forms in several variables in connection with his famous work on the analytic theory of quadratic forms. Since then Siegel modular forms have been studied extensively because of their significance in both automorphic functions in several complex variables and number theory. The comprehensive theory of automorphic forms to subgroups of algebraic groups and the recent arithmetical theory of modular forms illustrate these two aspects in an illuminating manner. The text is based on the author's lectures given over a number of years and is intended for a one semester graduate course, although it can serve equally well for self study . The only prerequisites are a knowledge of algebra, number theory and complex analysis.

Starting with the Zermelo-Fraenhel axiomatic set theory, this book gives a self-contained, step-by-step construction of real and complex numbers. The basic properties of real and complex numbers are developed, including a proof of the Fundamental Theorem of Algebra. Historical notes outline the evolution of the number systems and alert readers to the fact that polished mathematical concepts, as presented in lectures and books, are the culmination of the efforts of great minds over the years. The text also includes short life sketches of some of the contributing mathematicians. The book provides the logical foundation of Analysis and gives a basis to Abstract Algebra. It complements those books on real analysis which begin with axiomatic definitions of real numbers.The book can be used in various ways: as a textbook for a one semester course on the foundations of analysis for post-calculus students; for a seminar course; or self-study by school and college teachers.

The second volume of this work contains Parts 2 and 3 of the "Handbook of Coding Theory". Part 2, "Connections", is devoted to connections between coding theory and other branches of mathematics and computer science. Part 3, "Applications", deals with a variety of applications for coding.

Digital Signal Processing Algorithms describes computational number theory and its applications to deriving fast algorithms for digital signal processing. It demonstrates the importance of computational number theory in the design of digital signal processing algorithms and clearly describes the nature and structure of the algorithms themselves. The book has two primary focuses: first, it establishes the properties of discrete-time sequence indices and their corresponding fast algorithms; and second, it investigates the properties of the discrete-time sequences and the corresponding fast algorithms for processing these sequences.
Digital Signal Processing Algorithms examines three of the most common computational tasks that occur in digital signal processing; namely, cyclic convolution, acyclic convolution, and discrete Fourier transformation. The application of number theory to deriving fast and efficient algorithms for these three and related computationally intensive tasks is clearly discussed and illustrated with examples.
Its comprehensive coverage of digital signal processing, computer arithmetic, and coding theory makes Digital Signal Processing Algorithms an excellent reference for practicing engineers. The authors' intent to demystify the abstract nature of number theory and the related algebra is evident throughout the text, providing clear and precise coverage of the quickly evolving field of digital signal processing.