Wavelets are mathematical functions that divide data into different frequency components, and then study each component with a resolution matched to its scale. First generation wavelets have proved useful in many applications in engineering and computer science. However they cannot be used with non-linear, data-adaptive decompositions and non-equispaced data.

"Second Generation Wavelets and their Applications" introduces "second generation wavelets" and the lifting transform that can be used to apply the traditional benefits of wavelets into a wide range of new areas in signal processing, data processing and computer graphics. This book details the mathematical fundamentals of the lifting transform and illustrates the latest applications of the transform in signal and image processing, numerical analysis, scattering data smoothing and rendering of computer images.

This book explores the limits of our knowledge. The author shows how uncertainty and indefiniteness not only define the borders confining our understanding, but how they feed into the process of discovery and help to push back these borders. Starting with physics the author collects examples from economics, neurophysiology, history, ecology and philosophy. The first part shows how information helps to reduce indefiniteness. Understanding rests on our ability to find the right context, in which we localize a problem as a point in a network of connections. New elements must be combined with the old parts of the existing complex knowledge system, in order to profit maximally from the information. An attempt is made to quantify the value of information by its ability to reduce indefiniteness. The second part explains how to handle indefiniteness with methods from fuzzy logic, decision theory, hermeneutics and semiotics. It is not sufficient that the new element appears in an experiment, one also has to find a theoretical reason for its existence. Indefiniteness becomes an engine of science, which gives rise to new ideas.

This volume contains the accounts of papers delivered at the Nato Advanced Study Institute on Finite and Infinite Combinatorics in Sets and Logic held at the Banff Centre, Alberta, Canada from April 21 to May 4, 1991. As the title suggests the meeting brought together workers interested in the interplay between finite and infinite combinatorics, set theory, graph theory and logic. It used to be that infinite set theory, finite combinatorics and logic could be viewed as quite separate and independent subjects. But more and more those disciplines grow together and become interdependent of each other with ever more problems and results appearing which concern all of those disciplines. I appreciate the financial support which was provided by the N. A. T. O. Advanced Study Institute programme, the Natural Sciences and Engineering Research Council of Canada and the Department of Mathematics and Statistics of the University of Calgary. 11l'te meeting on Finite and Infinite Combinatorics in Sets and Logic followed two other meetings on discrete mathematics held in Banff, the Symposium on Ordered Sets in 1981 and the Symposium on Graphs and Order in 1984. The growing inter-relation between the different areas in discrete mathematics is maybe best illustrated by the fact that many of the participants who were present at the previous meetings also attended this meeting on Finite and Infinite Combinatorics in Sets and Logic.

This monograph is a comprehensive account of formal matrices, examining homological properties of modules over formal matrix rings and summarising the interplay between Morita contexts and K theory. While various special types of formal matrix rings have been studied for a long time from several points of view and appear in various textbooks, for instance to examine equivalences of module categories and to illustrate rings with one-sided non-symmetric properties, this particular class of rings has, so far, not been treated systematically. Exploring formal matrix rings of order 2 and introducing the notion of the determinant of a formal matrix over a commutative ring, this monograph further covers the Grothendieck and Whitehead groups of rings. Graduate students and researchers interested in ring theory, module theory and operator algebras will find this book particularly valuable. Containing numerous examples, Formal Matrices is a largely self-contained and accessible introduction to the topic, assuming a solid understanding of basic algebra.

"Knot theory is a fascinating mathematical subject, with multiple links to theoretical physics. This enyclopedia is filled with valuable information on a rich and fascinating subject." - Ed Witten, Recipient of the Fields Medal "I spent a pleasant afternoon perusing the Encyclopedia of Knot Theory. It's a comprehensive compilation of clear introductions to both classical and very modern developments in the field. It will be a terrific resource for the accomplished researcher, and will also be an excellent way to lure students, both graduate and undergraduate, into the field." - Abigail Thompson, Distinguished Professor of Mathematics at University of California, Davis Knot theory has proven to be a fascinating area of mathematical research, dating back about 150 years. Encyclopedia of Knot Theory provides short, interconnected articles on a variety of active areas in knot theory, and includes beautiful pictures, deep mathematical connections, and critical applications. Many of the articles in this book are accessible to undergraduates who are working on research or taking an advanced undergraduate course in knot theory. More advanced articles will be useful to graduate students working on a related thesis topic, to researchers in another area of topology who are interested in current results in knot theory, and to scientists who study the topology and geometry of biopolymers. Features Provides material that is useful and accessible to undergraduates, postgraduates, and full-time researchers Topics discussed provide an excellent catalyst for students to explore meaningful research and gain confidence and commitment to pursuing advanced degrees Edited and contributed by top researchers in the field of knot theory

Introduction to Mathematical Modeling helps students master the processes used by scientists and engineers to model real-world problems, including the challenges posed by space exploration, climate change, energy sustainability, chaotic dynamical systems and random processes. Primarily intended for students with a working knowledge of calculus but minimal training in computer programming in a first course on modeling, the more advanced topics in the book are also useful for advanced undergraduate and graduate students seeking to get to grips with the analytical, numerical, and visual aspects of mathematical modeling, as well as the approximations and abstractions needed for the creation of a viable model.

While in classical (abelian) homological algebra additive functors from abelian (or additive) categories to abelian categories are investigated , non- abelian homological algebra deals with non-additive functors and their homological properties , in particular with functors having values in non-abelian categories. Such functors haveimportant applications in algebra, algebraic topology, functional analysis, algebraic geometry and other principal areas of mathematics. To study homological properties of non-additive functors it is necessary to define and investigate their derived functors and satellites. It will be the aim of this book based on the results of researchers of A. Razmadze Mathematical Institute of the Georgian Academy of Sciences devoted to non-abelian homological algebra. The most important considered cases will be functors from arbitrary categories to the category of modules, group valued functors and commutative semigroup valued functors. In Chapter I universal sequences of functors are defined and in- vestigated with respect to (co)presheaves of categories, extending in a natural way the satellites of additive functors to the non-additive case and generalizing the classical relative homological algebra in additive categories to arbitrary categories. Applications are given in the furth- coming chapters. Chapter II is devoted to the non-abelian derived functors of group valued functors with respect to projective classes using projective pseu- dosimplicial resolutions. Their functorial properties (exactness, Milnor exact sequence, relationship with cotriple derived functors, satellites and Grothendieck cohomology, spectral sequence of an epimorphism, degree of an arbitrary functor) are established and applications to ho- mology and cohomology of groups are given.

We dedicate this volume to Professor Parimala on the occasion of her 60th birthday. It contains a variety of papers related to the themes of her research. Parimala's rst striking result was a counterexample to a quadratic analogue of Serre's conjecture (Bulletin of the American Mathematical Society, 1976). Her in uence has cont- ued through her tenure at the Tata Institute of Fundamental Research in Mumbai (1976-2006),and now her time at Emory University in Atlanta (2005-present). A conference was held from 30 December 2008 to 4 January 2009, at the U- versity of Hyderabad, India, to celebrate Parimala's 60th birthday (see the conf- ence's Web site at http://mathstat.uohyd.ernet.in/conf/quadforms2008). The or- nizing committee consisted of J.-L. Colliot-Thel ' en ' e, Skip Garibaldi, R. Sujatha, and V. Suresh. The present volume is an outcome of this event. We would like to thank all the participants of the conference, the authors who have contributed to this volume, and the referees who carefully examined the s- mitted papers. We would also like to thank Springer-Verlag for readily accepting to publish the volume. In addition, the other three editors of the volume would like to place on record their deep appreciation of Skip Garibaldi's untiring efforts toward the nal publication.

Steiner's Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which is called a Steiner Minimal Tree (SMT), and may contain vertices different from the points which are to be connected. Steiner's Problem is one of the most famous combinatorial-geometrical problems, but unfortunately it is very difficult in terms of combinatorial structure as well as computational complexity. However, if only a Minimum Spanning Tree (MST) without additional vertices in the interconnecting network is sought, then it is simple to solve. So it is of interest to know what the error is if an MST is constructed instead of an SMT. The worst case for this ratio running over all finite sets is called the Steiner ratio of the space. The book concentrates on investigating the Steiner ratio. The goal is to determine, or at least estimate, the Steiner ratio for many different metric spaces. The author shows that the description of the Steiner ratio contains many questions from geometry, optimization, and graph theory. Audience: Researchers in network design, applied optimization, and design of algorithms.

British-Israeli recreational mathematician, communicator and educator, Yossi Elran explores in-depth six of the most ingenious math puzzles, exposing their long 'tails': the stories, trivia, quirks and oddities of their history and, of course, the math and mathematicians behind them. In his unique 'talmudic', associative way, Elran shows the hidden connections between Lewis Carroll's 'Cats and Rats' puzzle and the math of taxi driving, a number pyramid magic trick and Hollywood movie fractals, and even how packing puzzles are related to COVID-19!Elran has a great talent for explaining difficult topics - including quantum mechanics, a topic he relates to some original 'operator' puzzles - making the book very accessible for all audiences.With over 40 additional, original puzzles, and touching on dozens of hot math topics, this is a perfect book for math lovers, educators, kids and adults, and anyone who loves a great read.Yossi Elran is co-author of our bestselling The Paper Puzzle Book, and heads the Innovation Center at the Davidson Institute of Science Education, the educational arm of the world-renowned Weizmann Institute of Science in Israel.

Many experiments have shown the human brain generally has very serious problems dealing with probability and chance. A greater understanding of probability can help develop the intuition necessary to approach risk with the ability to make more informed (and better) decisions. The first four chapters offer the standard content for an introductory probability course, albeit presented in a much different way and order. The chapters afterward include some discussion of different games, different "ideas" that relate to the law of large numbers, and many more mathematical topics not typically seen in such a book. The use of games is meant to make the book (and course) feel like fun! Since many of the early games discussed are casino games, the study of those games, along with an understanding of the material in later chapters, should remind you that gambling is a bad idea; you should think of placing bets in a casino as paying for entertainment. Winning can, obviously, be a fun reward, but should not ever be expected. Changes for the Second Edition: New chapter on Game Theory New chapter on Sports Mathematics The chapter on Blackjack, which was Chapter 4 in the first edition, appears later in the book. Reorganization has been done to improve the flow of topics and learning. New sections on Arkham Horror, Uno, and Scrabble have been added. Even more exercises were added! The goal for this textbook is to complement the inquiry-based learning movement. In my mind, concepts and ideas will stick with the reader more when they are motivated in an interesting way. Here, we use questions about various games (not just casino games) to motivate the mathematics, and I would say that the writing emphasizes a "just-in-time" mathematics approach. Topics are presented mathematically as questions about the games themselves are posed. Table of Contents Preface 1. Mathematics and Probability 2. Roulette and Craps: Expected Value 3. Counting: Poker Hands 4. More Dice: Counting and Combinations, and Statistics 5. Game Theory: Poker Bluffing and Other Games 6. Probability/Stochastic Matrices: Board Game Movement 7. Sports Mathematics: Probability Meets Athletics 8. Blackjack: Previous Methods Revisited 9. A Mix of Other Games 10. Betting Systems: Can You Beat the System? 11. Potpourri: Assorted Adventures in Probability Appendices Tables Answers and Selected Solutions Bibliography Biography Dr. David G. Taylor is a professor of mathematics and an associate dean for academic affairs at Roanoke College in southwest Virginia. He attended Lebanon Valley College for his B.S. in computer science and mathematics and went to the University of Virginia for his Ph.D. While his graduate school focus was on studying infinite dimensional Lie algebras, he started studying the mathematics of various games in order to have a more undergraduate-friendly research agenda. Work done with two Roanoke College students, Heather Cook and Jonathan Marino, appears in this book! Currently he owns over 100 different board games and enjoys using probability in his decision-making while playing most of those games. In his spare time, he enjoys reading, cooking, coding, playing his board games, and spending time with his six-year-old dog Lilly.

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.

This volume deals with problems of modern effective algorithms for the numerical solution of the most frequently occurring elliptic partial differential equations. From the point of view of implementation, attention is paid to algorithms for both classical sequential and parallel computer systems. The first two chapters are devoted to fast algorithms for solving the Poisson and biharmonic equation. In the third chapter, parallel algorithms for model parallel computer systems of the SIMD and MIMD types are described. The implementation aspects of parallel algorithms for solving model elliptic boundary value problems are outlined for systems with matrix, pipeline and multiprocessor parallel computer architectures. A modern and popular multigrid computational principle which offers a good opportunity for a parallel realization is described in the next chapter. More parallel variants based in this idea are presented, whereby methods and assignments strategies for hypercube systems are treated in more detail. The last chapter presents VLSI designs for solving special tridiagonal linear systems of equations arising from finite-difference approximations of elliptic problems. For researchers interested in the development and application of fast algorithms for solving elliptic partial differential equations using advanced computer systems.

We see numbers on automobile license plates, addresses, weather reports, and, of course, on our smartphones. Yet we look at these numbers for their role as descriptors, not as an entity in and unto themselves. Each number has its own history of meaning, usage, and connotation in the larger world. The Secret Lives of Numbers takes readers on a journey through integers, considering their numerological assignments as well as their significance beyond mathematics and in the realm of popular culture. Of course we all know that the number 13 carries a certain value of unluckiness with it. The phobia of the number is called Triskaidekaphobia; Franklin Delano Roosevelt was known to invite and disinvite guests to parties to avoid having 13 people in attendance; high-rise buildings often skip the 13th floor out of superstition. There are many explanations as to how the number 13 received this negative honor, but from a mathematical point of view, the number 13 is also the smallest prime number that when its digits are reversed is also a prime number. It is honored with a place among the Fibonacci numbers and integral Pythagorean triples, as well as many other interesting and lesser-known occurrences. In The Secret Lives of Numbers, popular mathematician Alfred S. Posamentier provides short and engaging mini-biographies of more than 100 numbers, starting with 1 and featuring some especially interesting numbers -like 6,174, a number with most unusual properties -to provide readers with a more comprehensive picture of the lives of numbers both mathematically and socially.

The contributions gathered here demonstrate how categorical ontology can provide a basis for linking three important basic sciences: mathematics, physics, and philosophy. Category theory is a new formal ontology that shifts the main focus from objects to processes. The book approaches formal ontology in the original sense put forward by the philosopher Edmund Husserl, namely as a science that deals with entities that can be exemplified in all spheres and domains of reality. It is a dynamic, processual, and non-substantial ontology in which all entities can be treated as transformations, and in which objects are merely the sources and aims of these transformations. Thus, in a rather surprising way, when employed as a formal ontology, category theory can unite seemingly disparate disciplines in contemporary science and the humanities, such as physics, mathematics and philosophy, but also computer and complex systems science.

The Italian mathematician Mario Pieri (1860-1913) played an integral part in the research groups of Corrado Segre and Giuseppe Peano, and thus had a significant, yet somewhat underappreciated impact on several branches of mathematics, particularly on the development of algebraic geometry and the foundations of mathematics in the years around the turn of the 20th century. This book is the first in a series of three volumes that are dedicated to countering that neglect and comprehensively examining Pieria (TM)s life, mathematical work and influence in such diverse fields as mathematical logic, algebraic geometry, number theory, inversive geometry, vector analysis, and differential geometry.

The Legacy of Mario Pieri in Geometry and Arithmetic introduces readers to Pieria (TM)s career and his studies in foundations, from both historical and modern viewpoints, placing his life and research in context and tracing his influence on his contemporaries as well as more recent mathematicians. The text also provides a glimpse of the Italian academic world of Pieri's time, and its relationship with the developing international mathematics community. Included in this volume are the first English translations, along with analyses, of two of his most important axiomatizationsa "his postulates for arithmetic, which Peano judged superior to his own; and his foundation of elementary geometry on the basis of point and sphere, which Alfred Tarski used as a basis for his own system.

Combining an engaging exposition, little-known historical information, exhaustive references and an excellent index, this text will be of interest to graduate students, researchers and historians with a general knowledgeof logic and advanced mathematics, and it requires no specialized experience in mathematical logic or the foundations of geometry.

This book demonstrates how to formally model various mathematical domains (including algorithms operating in these domains) in a way that makes them amenable to a fully automatic analysis by computer software.The presented domains are typically investigated in discrete mathematics, logic, algebra, and computer science; they are modeled in a formal language based on first-order logic which is sufficiently rich to express the core entities in whose correctness we are interested: mathematical theorems and algorithmic specifications. This formal language is the language of RISCAL, a “mathematical model checker” by which the validity of all formulas and the correctness of all algorithms can be automatically decided. The RISCAL software is freely available; all formal contents presented in the book are given in the form of specification files by which the reader may interact with the software while studying the corresponding book material.

This book is dedicated to V.A. Yankov's seminal contributions to the theory of propositional logics. His papers, published in the 1960s, are highly cited even today. The Yankov characteristic formulas have become a very useful tool in propositional, modal and algebraic logic. The papers contributed to this book provide the new results on different generalizations and applications of characteristic formulas in propositional, modal and algebraic logics. In particular, an exposition of Yankov's results and their applications in algebraic logic, the theory of admissible rules and refutation systems is included in the book. In addition, the reader can find the studies on splitting and join-splitting in intermediate propositional logics that are based on Yankov-type formulas which are closely related to canonical formulas, and the study of properties of predicate extensions of non-classical propositional logics. The book also contains an exposition of Yankov's revolutionary approach to constructive proof theory. The editors also include Yankov's contributions to history and philosophy of mathematics and foundations of mathematics, as well as an examination of his original interpretation of history of Greek philosophy and mathematics.

This undergraduate textbook promotes an active transition to higher mathematics. Problem solving is the heart and soul of this book: each problem is carefully chosen to demonstrate, elucidate, or extend a concept. More than 300 exercises engage the reader in extensive arguments and creative approaches, while exploring connections between fundamental mathematical topics. Divided into four parts, this book begins with a playful exploration of the building blocks of mathematics, such as definitions, axioms, and proofs. A study of the fundamental concepts of logic, sets, and functions follows, before focus turns to methods of proof. Having covered the core of a transition course, the author goes on to present a selection of advanced topics that offer opportunities for extension or further study. Throughout, appendices touch on historical perspectives, current trends, and open questions, showing mathematics as a vibrant and dynamic human enterprise. This second edition has been reorganized to better reflect the layout and curriculum of standard transition courses. It also features recent developments and improved appendices. An Invitation to Abstract Mathematics is ideal for those seeking a challenging and engaging transition to advanced mathematics, and will appeal to both undergraduates majoring in mathematics, as well as non-math majors interested in exploring higher-level concepts. From reviews of the first edition: Bajnok's new book truly invites students to enjoy the beauty, power, and challenge of abstract mathematics. ... The book can be used as a text for traditional transition or structure courses ... but since Bajnok invites all students, not just mathematics majors, to enjoy the subject, he assumes very little background knowledge. Jill Dietz, MAA ReviewsThe style of writing is careful, but joyously enthusiastic.... The author's clear attitude is that mathematics consists of problem solving, and that writing a proof falls into this category. Students of mathematics are, therefore, engaged in problem solving, and should be given problems to solve, rather than problems to imitate. The author attributes this approach to his Hungarian background ... and encourages students to embrace the challenge in the same way an athlete engages in vigorous practice. John Perry, zbMATH

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.

The aim of this book volume is to explain the importance of Markov state models to molecular simulation, how they work, and how they can be applied to a range of problems.

The Markov state model (MSM) approach aims to address two key challenges of molecular simulation:

1) How to reach long timescales using short simulations of detailed molecular models.

2) How to systematically gain insight from the resulting sea of data.

MSMs do this by providing a compact representation of the vast conformational space available to biomolecules by decomposing it into states sets of rapidly interconverting conformations and the rates of transitioning between states.This kinetic definition allows one to easily vary the temporal and spatial resolution of an MSM from high-resolution models capable of quantitative agreement with (or prediction of) experiment to low-resolution models that facilitate understanding. Additionally, MSMs facilitate the calculation of quantities that are difficult to obtain from more direct MD analyses, such as the ensemble of transition pathways.

This book introduces the mathematical foundations of Markov models, how they can be used to analyze simulations and drive efficient simulations, and some of the insights these models have yielded in a variety of applications of molecular simulation."

This book features a series of lectures that explores three different fields in which functor homology (short for homological algebra in functor categories) has recently played a significant role. For each of these applications, the functor viewpoint provides both essential insights and new methods for tackling difficult mathematical problems. In the lectures by Aurelien Djament, polynomial functors appear as coefficients in the homology of infinite families of classical groups, e.g. general linear groups or symplectic groups, and their stabilization. Djament's theorem states that this stable homology can be computed using only the homology with trivial coefficients and the manageable functor homology. The series includes an intriguing development of Scorichenko's unpublished results. The lectures by Wilberd van der Kallen lead to the solution of the general cohomological finite generation problem, extending Hilbert's fourteenth problem and its solution to the context of cohomology. The focus here is on the cohomology of algebraic groups, or rational cohomology, and the coefficients are Friedlander and Suslin's strict polynomial functors, a conceptual form of modules over the Schur algebra. Roman Mikhailov's lectures highlight topological invariants: homoto py and homology of topological spaces, through derived functors of polynomial functors. In this regard the functor framework makes better use of naturality, allowing it to reach calculations that remain beyond the grasp of classical algebraic topology. Lastly, Antoine Touze's introductory course on homological algebra makes the book accessible to graduate students new to the field. The links between functor homology and the three fields mentioned above offer compelling arguments for pushing the development of the functor viewpoint. The lectures in this book will provide readers with a feel for functors, and a valuable new perspective to apply to their favourite problems.

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of (basic) truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice (a lattice of truth values with two ordering relations) constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, a trilattice of truth values - a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi.

This monograph is a defence of the Fregean take on logic. The author argues that Freges projects, in logic and philosophy of language, are essentially connected and that the formalist shift produced by the work of Peano, Boole and Schroeder and continued by Hilbert and Tarski is completely alien to Frege's approach in the Begriffsschrift. A central thesis of the book is that judgeable contents, i.e. propositions, are the primary bearers of logical properties, which makes logic embedded in our conceptual system. This approach allows coherent and correct definitions of logical constants, logical consequence, and truth and connects their use to the practices of rational agents in science and everyday life.