This book (along with volume 2 covers most of the traditional methods for polynomial root-finding such as Newton s, as well as numerous variations on them invented in the last few decades. Perhaps more importantly it covers recent developments such as Vincent s method, simultaneous iterations, and matrix methods. There is an extensive chapter on evaluation of polynomials, including parallel methods and errors. There are pointers to robust and efficient programs. In short, it could be entitled A Handbook of Methods for Polynomial Root-finding . This book will be invaluable to anyone doing research in polynomial roots, or teaching a graduate course on that topic.

- First comprehensive treatment of Root-Finding in several decades.
- Gives description of high-grade software and where it can be down-loaded.
- Very up-to-date in mid-2006; long chapter on matrix methods.
- Includes Parallel methods, errors where appropriate.
- Invaluable for research or graduate course.

"

Anyone involved in the philosophy of science is naturally drawn into the study of the foundations of probability. Different interpretations of probability, based on competing philosophical ideas, lead to different statistical techniques, and frequently to mutually contradictory consequences.

This unique book presents a new interpretation of probability, rooted in the traditional interpretation that was current in the 17th and 18th centuries. Mathematical models are constructed based on this interpretation, and statistical inference and decision theory are applied, including some examples in artificial intelligence, solving the main foundational problems. Nonstandard analysis is extensively developed for the construction of the models and in some of the proofs. Many nonstandard theorems are proved, some of them new, in particular, a representation theorem that asserts that any stochastic process can be approximated by a process defined over a space with equiprobable outcomes.

Relation algebras are algebras arising from the study of binary relations.
They form a part of the field of algebraic logic, and have applications in proof theory, modal logic, and computer science. This research text uses combinatorial games to study the fundamental notion of representations of relation algebras. Games allow an intuitive and appealing approach to the subject, and permit substantial advances to be made. The book contains many new results and proofs not published elsewhere. It should be invaluable to graduate students and researchers interested in relation algebras and games.

After an introduction describing the authors' perspective on the material, the text proper has six parts. The lengthy first part is devoted to background material, including the formal definitions of relation algebras, cylindric algebras, their basic properties, and some connections between them. Examples are given. Part 1 ends with a short survey of other work beyond the scope of the book. In part 2, games are introduced, and used to axiomatise various classes of algebras. Part 3 discusses approximations to representability, using bases, relation algebra reducts, and relativised representations. Part 4 presents some constructions of relation algebras, including Monk algebras and the 'rainbow construction', and uses them to show that various classes of representable algebras are non-finitely axiomatisable or even non-elementary. Part 5 shows that the representability problem for finite relation algebras is undecidable, and then in contrast proves some finite base property results. Part 6 contains a condensed summary of the book, and a list of problems. There are more than 400 exercises.

The book is generally self-contained on relation algebras and on games, and introductory text is scattered throughout. Some familiarity with elementary aspects of first-order logic and set theory is assumed, though many of the definitions are given. Chapter 2 introduces the necessary universal algebra and model theory, and more specific model-theoretic ideas are explained as they arise.

The year 2007 marks the 300th anniversary of the birth of one of the Enlightenment's most important mathematicians and scientists, Leonhard Euler. This volume is a collection of 24 essays by some of the world's best Eulerian scholars from seven different countries about Euler, his life and his work.
Some of the essays are historical, including much previously unknown information about Euler's life, his activities in the St. Petersburg Academy, the influence of the Russian Princess Dashkova, and Euler's philosophy. Others describe his influence on the subsequent growth of European mathematics and physics in the 19th century. Still others give technical details of Euler's innovations in probability, number theory, geometry, analysis, astronomy, mechanics and other fields of mathematics and science.
- Over 20 essays by some of the best historians of mathematics and science, including Ronald Calinger, Peter Hoffmann, Curtis Wilson, Kim Plofker, Victor Katz, Ruediger Thiele, David Richeson, Robin Wilson, Ivor Grattan-Guinness and Karin Reich
- New details of Euler's life in two essays, one by Ronald Calinger and one he co-authored with Elena Polyakhova
- New information on Euler's work in differential geometry, series, mechanics, and other important topics including his influence in the early 19th century

This handbook is the second volume in a series devoted to self contained and up-to-date surveys in the theory of ordinary differential equations, written
by leading researchers in the area. All contributors have made an additional effort to achieve readability for mathematicians and scientists from other related fields, in order to make the chapters of the volume accessible to a wide audience.
. Six chapters covering a variety of problems in ordinary differential equations.
. Both, pure mathematical research and real word applications are reflected
. Written by leading researchers in the area.

Numerical analysis has witnessed many significant developments in the 20th century. This book brings together 16 papers dealing with historical developments, survey papers and papers on recent trends in selected areas of numerical analysis, such as: approximation and interpolation, solution of linear systems and eigenvalue problems, iterative methods, quadrature rules, solution of ordinary-, partial- and integral equations. The papers are reprinted from the 7-volume project of the "Journal of Computational and Applied Mathematics" on '/homepage/sac/cam/na2000/index.htmlNumerical Analysis 2000'. An introductory survey paper deals with the history of the first courses on numerical analysis in several countries and with the landmarks in the development of important algorithms and concepts in the field.

Codes on Euclidean spheres are often referred to as spherical codes. They are of interest from mathematical, physical and engineering points of view. Mathematically the topic belongs to the realm of algebraic combinatorics, with close connections to number theory, geometry, combinatorial theory, and - of course - to algebraic coding theory. The connections to physics occur within areas like crystallography and nuclear physics. In engineering spherical codes are of central importance in connection with error-control in communication systems. In that context the use of spherical codes is often referred to as "coded modulation."

The book offers a first complete treatment of the mathematical theory of codes on Euclidean spheres. Many new results are published here for the first time. Engineering applications are emphasized throughout the text. The theory is illustrated by many examples. The book also contains an extensive table of best known spherical codes in dimensions 3-24, including exact constructions.

The book is devoted to various constructions of sets which are nonmeasurable with respect to invariant (more generally, quasi-invariant) measures. Our starting point is the classical Vitali theorem stating the existence of subsets of the real line which are not measurable in the Lebesgue sense. This theorem stimulated the development of the following interesting topics in mathematics:
1. Paradoxical decompositions of sets in finite-dimensional Euclidean spaces;
2. The theory of non-real-valued-measurable cardinals;
3. The theory of invariant (quasi-invariant)
extensions of invariant (quasi-invariant) measures.
These topics are under consideration in the book. The role of nonmeasurable sets (functions) in point set theory and real analysis is underlined and various classes of such sets (functions) are investigated . Among them there are: Vitali sets, Bernstein sets, Sierpinski sets, nontrivial solutions of the Cauchy functional equation, absolutely nonmeasurable sets in uncountable groups, absolutely nonmeasurable additive functions, thick uniform subsets of the plane, small nonmeasurable sets, absolutely negligible sets, etc. The importance of properties of nonmeasurable sets for various aspects of the measure extension problem is shown. It is also demonstrated that there are close relationships between the existence of nonmeasurable sets and some deep questions of axiomatic set theory, infinite combinatorics, set-theoretical topology, general theory of commutative groups. Many open attractive problems are formulated concerning nonmeasurable sets and functions.
. highlights the importance of nonmeasurable sets (functions) for general measure extension problem.
. Deep connections of the topic with set theory, real analysis, infinite combinatorics, group theory and geometry of Euclidean spaces shown and underlined.
. self-contained and accessible for a wide audience of potential readers.
. Each chapter ends with exercises which provide valuable additional information about nonmeasurable sets and functions.
. Numerous open problems and questions."

This book familiarizes both popular and fundamental notions and techniques from the theory of non-normed topological algebras with involution, demonstrating with examples and basic results the necessity of this perspective. The main body of the book is focussed on the Hilbert-space (bounded) representation theory of topological *-algebras and their topological tensor products, since in our physical world, apart from the majority of the existing unbounded operators, we often meet operators that are forced to be bounded, like in the case of symmetric *-algebras. So, one gets an account of how things behave, when the mathematical structures are far from being algebras endowed with a complete or non-complete algebra norm. In problems related with mathematical physics, such instances are, indeed, quite common.

Key features:

- Lucid presentation
- Smooth in reading
- Informative
- Illustrated by examples
- Familiarizes the reader with the non-normed *-world
- Encourages the hesitant
- Welcomes new comers.
- Well written and lucid presentation.
- Informative and illustrated by examples.
- Familiarizes the reader with the non-normed *-world.

Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects.

To study the computational behaviour of many-dimensional modal logics is the main aim of this book. On the one hand, it is concerned with providing a solid mathematical foundation for this discipline, while on the other hand, it shows that many seemingly different applied many-dimensional systems (e.g., multi-agent systems, description logics with epistemic, temporal and dynamic operators, spatio-temporal logics, etc.) fit in perfectly with this theoretical framework, and so their computational behaviour can be analyzed using the developed machinery.

We start with concrete examples of applied one- and many-dimensional modal logics such as temporal, epistemic, dynamic, description, spatial logics, and various combinations of these. Then we develop a mathematical theory for handling a spectrum of 'abstract' combinations of modal logics - fusions and products of modal logics, fragments of first-order modal and temporal logics - focusing on three major problems: decidability, axiomatizability, and computational complexity. Besides the standard methods of modal logic, the technical toolkit includes the method of quasimodels, mosaics, tilings, reductions to monadic second-order logic, algebraic logic techniques. Finally, we apply the developed machinery and obtained results to three case studies from the field of knowledge representation and reasoning: temporal epistemic logics for reasoning about multi-agent systems, modalized description logics for dynamic ontologies, and spatio-temporal logics.

The genre of the book can be defined as a research monograph. It brings the reader to the front line of current research in the field by showing both recent achievements and directions of future investigations (in particular, multiple open problems). On the other hand, well-known results from modal and first-order logic are formulated without proofs and supplied with references to accessible sources.

The intended audience of this book is logicians as well as those researchers who use logic in computer science and artificial intelligence. More specific application areas are, e.g., knowledge representation and reasoning, in particular, terminological, temporal and spatial reasoning, or reasoning about agents. And we also believe that researchers from certain other disciplines, say, temporal and spatial databases or geographical information systems, will benefit from this book as well.

Key Features:

Integrated approach to modern modal and temporal logics and their applications in artificial intelligence and computer science

Written by internationally leading researchers in the field of pure and applied logic

Combines mathematical theory of modal logic and applications in artificial intelligence and computer science

Numerous open problems for further research

Well illustrated with pictures and tables
"

The first part of this book is a text for graduate courses in topology. In chapters 1 - 5, part of the basic material of plane topology, combinatorial topology, dimension theory and ANR theory is presented. For a student who will go on in geometric or algebraic topology this material is a prerequisite for later work. Chapter 6 is an introduction to infinite-dimensional topology; it uses for the most part geometric methods, and gets to spectacular results fairly quickly. The second part of this book, chapters 7 & 8, is part of geometric topology and is meant for the more advanced mathematician interested in manifolds.
The text is self-contained for readers with a modest knowledge of general topology and linear algebra; the necessary background material is collected in chapter 1, or developed as needed.
One can look upon this book as a complete and self-contained proof of Toruńczyk's Hilbert cube manifold characterization theorem: "a compact ANR X is a manifold modeled on the Hilbert cube if and only if X satisfies the disjoint-cells property." In the process of proving this result several interesting and useful detours are made.

Since their introduction in the 1980's, wavelets have become a powerful tool in mathematical analysis, with applications such as image compression, statistical estimation and numerical simulation of partial differential equations. One of their main attractive features is the ability to accurately represent fairly general functions with a small number of adaptively chosen wavelet coefficients, as well as to characterize the smoothness of such functions from the numerical behaviour of these coefficients. The theoretical pillar that underlies such properties involves approximation theory and function spaces, and plays a pivotal role in the analysis of wavelet-based numerical methods.
This book offers a self-contained treatment of wavelets, which includes this theoretical pillar and it applications to the numerical treatment of partial differential equations. Its key features are:

1. Self-contained introduction to wavelet bases and related numerical algorithms, from the simplest examples to the most numerically useful general constructions.

2. Full treatment of the theoretical foundations that are crucial for the analysis
of wavelets and other related multiscale methods: function spaces, linear and nonlinear approximation, interpolation theory.

3. Applications of these concepts to the numerical treatment of partial differential equations: multilevel preconditioning, sparse approximations of differential and integral operators, adaptive discretization strategies.

The theory of tree languages, founded in the late Sixties and still active in the Seventies, was much less active during the Eighties. Now there is a simultaneous revival in several countries, with a number of significant results proved in the past five years. A large proportion of them appear in the present volume.

The editors of this volume suggested that the authors should write comprehensive half-survey papers. This collection is therefore useful for everyone interested in the theory of tree languages as it covers most of the recent questions which are not treated in the very few rather old standard books on the subject. Trees appear naturally in many chapters of computer science and each new property is likely to result in improvement of some computational solution of a real problem in handling logical formulae, data structures, programming languages on systems, algorithms etc. The point of view adopted here is to put emphasis on the properties themselves and their rigorous mathematical exposition rather than on the many possible applications.

This volume is a useful source of concepts and methods which may be applied successfully in many situations: its philosophy is very close to the whole philosophy of the ESPRIT Basic Research Actions and to that of the European Association for Theoretical Computer Science.

This book presents what in our opinion constitutes the basis of the theory of the mu-calculus, considered as an algebraic system rather than a logic. We have wished to present the subject in a unified way, and in a form as general as possible. Therefore, our emphasis is on the generality of the fixed-point notation, and on the connections between mu-calculus, games, and automata, which we also explain in an algebraic way.
This book should be accessible for graduate or advanced undergraduate students both in mathematics and computer science. We have designed this book especially for researchers and students interested in logic in computer science, comuter aided verification, and general aspects of automata theory. We have aimed at gathering in a single place the fundamental results of the theory, that are currently very scattered in the literature, and often hardly accessible for interested readers.
The presentation is self-contained, except for the proof of the Mc-Naughton's Determinization Theorem (see, e.g., 97]. However, we suppose that the reader is already familiar with some basic automata theory and universal algebra. The references, credits, and suggestions for further reading are given at the end of each chapter.

This Proceedings Volume contains 32 articles on various interesting areas of
present-day functional analysis and its applications: Banach spaces and
their geometry, operator ideals, Banach and operator algebras, operator and
spectral theory, Frechet spaces and algebras, function and sequence spaces.
The authors have taken much care with their articles and many papers present
important results and methods in active fields of research. Several survey
type articles (at the beginning and the end of the book) will be very useful
for mathematicians who want to learn "what is going on" in some particular
field of research.

The book is devoted to the perturbation analysis of matrix equations. The importance of perturbation analysis is that it gives a way to estimate the influence of measurement and/or parametric errors in mathematical models together with the rounding errors done in the computational process. The perturbation bounds may further be incorporated in accuracy estimates for the solution computed in finite arithmetic. This is necessary for the development of reliable computational methods, algorithms and software from the viewpoint of modern numerical analysis.

In this book a general perturbation theory for matrix algebraic equations is presented. Local and non-local perturbation bounds are derived for general types of matrix equations as well as for the most important equations arising in linear algebra and control theory. A large number of examples, tables and figures is included in order to illustrate the perturbation techniques and bounds.

Key features:

The first book in this field
Can be used by a variety of specialists
Material is self-contained
Results can be used in the development of reliable computational algorithms
A large number of examples and graphical illustrations are given
Written by prominent specialists in the field
"

The aim of the present work is two-fold. Firstly it aims at a giving an account of many existing algorithms for calculating with finite-dimensional Lie algebras. Secondly, the book provides an introduction into the theory of finite-dimensional Lie algebras. These two subject areas are intimately related. First of all, the algorithmic perspective often invites a different approach to the theoretical material than the one taken in various other monographs (e.g., 42], 48], 77], 86]). Indeed, on various occasions the knowledge of certain algorithms allows us to obtain a straightforward proof of theoretical results (we mention the proof of the Poincare-Birkhoff-Witt theorem and the proof of Iwasawa's theorem as examples). Also proofs that contain algorithmic constructions are explicitly formulated as algorithms (an example is the isomorphism theorem for semisimple Lie algebras that constructs an isomorphism in case it exists). Secondly, the algorithms can be used to arrive at a better understanding of the theory. Performing the algorithms in concrete examples, calculating with the concepts involved, really brings the theory of life.

The modern theory of algebras of binary relations, reformulated by Tarski as an abstract, algebraic, equational theory of relation algebras, has considerable mathematical significance, with applications in various fields: e.g., in computer science---databases, specification theory, AI---and in anthropology, economics, physics, and philosophical logic.
This comprehensive treatment of the theory of relation algebras and the calculus of relations is the first devoted to a systematic development of the subject.
Key Features:
- Presents historical milestones from a modern perspective
- Careful, thorough, detailed guide to understanding relation algebras
- Provides a framework and unified perspective of the subject

This volume gives a state of the art of triangular norms which can be used for the generalization of several mathematical concepts, such as conjunction, metric, measure, etc. 16 chapters written by leading experts provide a state of the art overview of theory and applications of triangular norms and related operators in fuzzy logic, measure theory, probability theory, and probabilistic metric spaces.
Key Features:
- Complete state of the art of the importance of triangular norms in various mathematical fields
- 16 self-contained chapters with extensive bibliographies cover both the theoretical background and many applications
- Chapter authors are leading authorities in their fields
- Triangular norms on different domains (including discrete, partially ordered) are described
- Not only triangular norms but also related operators (aggregation operators, copulas) are covered
- Book contains many enlightening illustrations
- Complete state of the art of the importance of triangular norms in various mathematical fields
- 16 self-contained chapters with extensive bibliographies cover both the theoretical background and many applications
- Chapter authors are leading authorities in their fields
- Triangular norms on different domains (including discrete, partially ordered) are described
- Not only triangular norms but also related operators (aggregation operators, copulas) are covered
- Book contains many enlightening illustrations

Many problems for partial difference and integro-difference equations can be written as difference equations in a normed space. This book is devoted to linear and nonlinear difference equations in a normed space. Our aim in this monograph is to initiate systematic investigations of the global behavior of solutions of difference equations in a normed space. Our primary concern is to study the asymptotic stability of the equilibrium solution. We are also interested in the existence of periodic and positive solutions. There are many books dealing with the theory of ordinary difference equations. However there are no books dealing systematically with difference equations in a normed space. It is our hope that this book will stimulate interest among mathematicians to develop the stability theory of abstract difference equations.
Note that even for ordinary difference equations, the problem of stability analysis continues to attract the attention of many specialists despite its long history. It is still one of the most burning problems, because of the absence of its complete solution,
but many general results available for ordinary difference equations
(for example, stability by linear approximation) may be easily proved for abstract difference equations.
The main methodology presented in this publication is based on a combined use of recent norm estimates for operator-valued functions with the following
methods and results:
a) the freezing method;
b) the Liapunov type equation;
c) the method of majorants;
d) the multiplicative representation of solutions.
In addition, we present stability results for abstract Volterra discrete equations.
The bookconsists of 22 chapters and an appendix. In Chapter 1, some definitions and preliminary results are collected. They are systematically used in the next chapters.
In, particular, we recall very briefly some basic notions and results of the theory of operators in Banach and ordered spaces. In addition, stability concepts are presented and Liapunov's functions are introduced. In Chapter 2 we review various classes of linear operators and their spectral properties. As examples, infinite matrices are considered. In Chapters 3 and 4, estimates for the norms of operator-valued and matrix-valued functions are suggested. In particular, we consider Hilbert-Schmidt, Neumann-Schatten, quasi-Hermitian and quasiunitary operators. These classes contain numerous infinite matrices arising in applications. In Chapter 5, some perturbation results for linear operators in a Hilbert space are presented. These results are then used in the next chapters to derive bounds for the spectral radiuses. Chapters 6-14 are devoted to asymptotic and exponential stabilities, as well as boundedness of solutions of linear and nonlinear difference equations. In Chapter 6 we investigate the linear equation with a bounded constant operator acting in a Banach space. Chapter 7 is concerned with the Liapunov type operator equation. Chapter 8 deals with estimates for the spectral radiuses of concrete operators, in particular, for infinite matrices. These bounds enable the formulation of explicit stability conditions. In Chapters 9 and 10 we consider nonautonomous (time-variant) linear equations. An essential role in this chapter is played by the evolution operator. In addition, we use the "freezing" method and multiplicativerepresentations of solutions to construct the majorants for linear equations. Chapters 11 and 12 are devoted to semilinear autonomous and nonautonomous equations. Chapters 13 and 14 are concerned with linear and nonlinear higher order difference equations. Chapter 15 is devoted to the input-to-state stability. In Chapter 16 we study periodic solutions of linear and nonlinear difference equations in a Banach space, as well as the global orbital stability of solutions of vector difference equations. Chapters 17 and 18 deal with linear and nonlinear Volterra discrete equations in a Banach space. An important role in these chapter is played by operator pencils. Chapter 19 deals with a class of the Stieltjes differential equations.
These equations generalize difference and differential equations. We apply estimates for norms of operator valued functions and properties of the multiplicative integral to certain classes of linear and nonlinear Stieltjes differential equations to obtain solution estimates that allow us to study the stability and boundedness of solutions. We also show the existence and uniqueness of solutions as well as the continuous dependence of the solutions on the time integrator. Chapter 20 provides some results regarding the Volterra--Stieltjes equations. The Volterra--Stieltjes equations include Volterra difference and Volterra integral equations. We obtain estimates for the norms of solutions of the Volterra--Stieltjes equation. Chapter 21 is devoted to difference equations with continuous time. In Chapter 22, we suggest some conditions for the existence of nontrivial and positive steady states of difference equations, as well as bounds for the stationary solutions.
- Deals systematically with difference equations in normed spaces
- Considers new classes of equations that could not be studied in the frameworks of ordinary and partial difference equations
- Develops the freezing method and presents recent results on Volterra discrete equations
- Contains an approach based on the estimates for norms of operator functions

This is an introductory undergraduate textbook in set theory. In mathematics these days, essentially everything is a set. Some knowledge of set theory is necessary part of the background everyone needs for further study of mathematics. It is also possible to study set theory for its own interest--it is a subject with intruiging results anout simple objects. This book starts with material that nobody can do without. There is no end to what can be learned of set theory, but here is a beginning.

The book contains a systematic treatment of the qualitative theory of elliptic boundary value problems for linear and quasilinear second order equations in non-smooth domains. The authors concentrate on the following fundamental results: sharp estimates for strong and weak solutions, solvability of the boundary value problems, regularity assertions for solutions near singular points.

Key features:

* New the Hardy - Friedrichs - Wirtinger type inequalities as well as new integral inequalities related to the Cauchy problem for a differential equation.
* Precise exponents of the solution decreasing rate near boundary singular points and best possible conditions for this.
* The question about the influence of the coefficients smoothness on the regularity of solutions.
* New existence theorems for the Dirichlet problem for linear and quasilinear equations in domains with conical points.
* The precise power modulus of continuity at singular boundary point for solutions of the Dirichlet, mixed and the Robin problems.
* The behaviour of weak solutions near conical point for the Dirichlet problem for m - Laplacian.
* The behaviour of weak solutions near a boundary edge for the Dirichlet and mixed problem for elliptic quasilinear equations with triple degeneration.
* Precise exponents of the solution decreasing rate near boundary singular points and best possible conditions for this.
* The question about the influence of the coefficients smoothness on the regularity of solutions.
* New existence theorems for the Dirichlet problem for linear and quasilinear equations in domains with conical points.
* The precise power modulus of continuity atsingular boundary point for solutions of the Dirichlet, mixed and the Robin problems.
* The behaviour of weak solutions near conical point for the Dirichlet problem for m - Laplacian.
* The behaviour of weak solutions near a boundary edge for the Dirichlet and mixed problem for elliptic quasilinear equations with triple degeneration.

The problems of constructing covering codes and of estimating their parameters are the main concern of this book. It provides a unified account of the most recent theory of covering codes and shows how a number of mathematical and engineering issues are related to covering problems.

Scientists involved in discrete mathematics, combinatorics, computer science, information theory, geometry, algebra or number theory will find the book of particular significance. It is designed both as an introductory textbook for the beginner and as a reference book for the expert mathematician and engineer.

A number of unsolved problems suitable for research projects are also discussed.

This volume is a collection of surveys of research problems in topology and its applications. The topics covered include general topology, set-theoretic topology, continuum theory, topological algebra, dynamical systems, computational topology and functional analysis.
* New surveys of research problems in topology
* New perspectives on classic problems
* Representative surveys of research groups from all around the world