Mathematics of Discrete Structures for Computer Science

Writing for graduate students dealing with stochastic processes in a range of fields (such as operations research, management science, engineering, computer science, applied mathematics, and economics

This 2003 book describes a striking connection between topology and algebra, namely that 2D topological quantum field theories are equivalent to commutative Frobenius algebras. The precise formulation of the theorem and its proof is given in terms of monoidal categories, and the main purpose of the book is to develop these concepts from an elementary level, and more generally serve as an introduction to categorical viewpoints in mathematics. Rather than just proving the theorem, it is shown how the result fits into a more general pattern concerning universal monoidal categories for algebraic structures. Throughout, the emphasis is on the interplay between algebra and topology, with graphical interpretation of algebraic operations, and topological structures described algebraically in terms of generators and relations. The book will prove valuable to students or researchers entering this field who will learn a host of modern techniques that will prove useful for future work.

This book discusses recent research in the theoretical foundations of several subjects of importance for the design of hardware, and for computer science in general. The physical technologies of very large scale integration (VLSI) are having major effects on the electronic industry. The potential diversity and complexity of digital systems have begun a revolution in the technologies of digital design, involving the application of concepts and methods to do with algorithms and programming. In return, the problems of VLSI design have led to new subjects becoming of importance in computer science. Topics covered in this volume include: models of VLSI complexity; complexity theory; systolic algorithm design; specification theory; verification theory; design by stepwise refinement and transformations. A thorough literature survey with an exhaustive bibliography is also included. The book has grown from a workshop held at the Centre for Theoretical Computer Science at Leeds University and or

Symmetry considerations dominate modern fundamental physics, both in quantum theory and in relativity. This book presents a collection of philosophy-on-physics papers, highlighting the main issues and controversies, and providing an entry into the subject for both physicists and philosophers. It covers topical issues such as the significance of gauge symmetry, particle identity in quantum theory, how to make sense of parity violation, the role of symmetry-breaking, the empirical status of symmetry principles, and so forth, along with more traditional problems in the philosophy of science. These include the status of the laws of nature, the relationships between mathematics, physical theory, and the world, and the extent to which mathematics dictates physics. A valuable reference for students and researchers, it will also be of interest to those studying the foundations of physics, philosophy of physics and philosophy of science.

This 2003 book describes a striking connection between topology and algebra, namely that 2D topological quantum field theories are equivalent to commutative Frobenius algebras. The precise formulation of the theorem and its proof is given in terms of monoidal categories, and the main purpose of the book is to develop these concepts from an elementary level, and more generally serve as an introduction to categorical viewpoints in mathematics. Rather than just proving the theorem, it is shown how the result fits into a more general pattern concerning universal monoidal categories for algebraic structures. Throughout, the emphasis is on the interplay between algebra and topology, with graphical interpretation of algebraic operations, and topological structures described algebraically in terms of generators and relations. The book will prove valuable to students or researchers entering this field who will learn a host of modern techniques that will prove useful for future work.

The paradigm of deterministic chaos has influenced thinking in many fields of science. Chaotic systems show rich and surprising mathematical structures. In the applied sciences, deterministic chaos provides a striking explanation for irregular behaviour and anomalies in systems which do not seem to be inherently stochastic. The most direct link between chaos theory and the real world is the analysis of time series from real systems in terms of nonlinear dynamics. Experimental technique and data analysis have seen such dramatic progress that, by now, most fundamental properties of nonlinear dynamical systems have been observed in the laboratory. Great efforts are being made to exploit ideas from chaos theory wherever the data displays more structure than can be captured by traditional methods. Problems of this kind are typical in biology and physiology but also in geophysics, economics, and many other sciences.

Quantum mechanics is one of the most fundamental yet difficult subjects in physics. Nonrelativistic quantum theory is presented here in a clear and systematic fashion, integrating Born's probabilistic interpretation with Schrödinger dynamics. Basic quantum principles are illustrated with simple examples requiring no mathematics beyond linear algebra and elementary probability theory. The quantum measurement process is consistently analyzed using fundamental quantum principles without referring to measurement. These same principles are used to resolve several of the paradoxes that have long perplexed physicists, including the double slit and Schrödinger's cat. The consistent histories formalism used here was first introduced by the author, and extended by M. Gell-Mann, J. Hartle and R. Omnès. Essential for researchers yet accessible to advanced undergraduate students in physics, chemistry, mathematics, and computer science, this book is supplementary to standard textbooks. It will also

Debugging by Thinking: A Multi-Disciplinary Approach is the first book to apply the wisdom of six disciplines—logic, mathematics, psychology, safety analysis, computer science, and engineering—to the

Isaac Newton's Principia is considered one of the masterpieces in the history of science. The mathematical methods employed by Newton in the Principia stimulated much debate among his contemporaries, especially Leibniz, Huygens, Bernoulli and Euler, who debated their merits and drawbacks. Among the questions they asked were: How should natural philosophy be mathematized?; Is it legitimate to use uninterpreted symbols?; Is it possible to depart from the established Archimedean or Galilean/Huygenian tradition of geometrizing nature?; What is the value of elegance and conciseness?; What is the relation between Newton's geometrical methods and the calculus? This book explains how Newton addressed these issues, taking into consideration the values that directed the research of Newton and his contemporaries. This book will be of interest to researchers and advanced students in departments of history of science, philosophy of science, physics, mathematics and astronomy.

Mobile systems, whose components communicate and change their structure, now pervade the informational world and the wider world of which it is a part. The science of mobile systems is as yet immature, however. This book presents the pi-calculus, a theory of mobile systems. The pi-calculus provides a conceptual framework for understanding mobility, and mathematical tools for expressing systems and reasoning about their behaviours. The book serves both as a reference for the theory and as an extended demonstration of how to use pi-calculus to describe systems and analyse their properties. It covers the basic theory of pi-calculus, typed pi-calculi, higher-order processes, the relationship between pi-calculus and lambda-calculus, and applications of pi-calculus to object-oriented design and programming. The book is written at the graduate level, assuming no prior acquaintance with the subject, and is intended for computer scientists interested in mobile systems.

Technological artefacts and biological organisms 'evolve' by very similar processes of blind variation and selective retention. This analogy is explored systematically, for the first time, by a team of international experts from evolutionary biology, history and sociology of science and technology, cognitive and computer science, economics, psychology, education, cultural anthropology and research management. Do technological 'memes' play the role of genes? In what sense are novel inventions 'blind'? Does the element of design make them 'Lamarckian' rather than 'Darwinian'? Is the recombination of ideas the essence of technological creativity? Can invention be simulated computationally? What are the entities that actually evolve - artefacts, ideas or organisations? These are only some of the many questions stimulated and partially answered by this powerful metaphor. With its practical demonstration of the explanatory potential of 'evolutionary reasoning' in a well-defined context, this

Legal and ethical issues have become a standard part of engineering and business schools' curricula. This has not been the case for computer science or management information systems programs, althoug

This is a textbook for graduate and upper level undergraduate students in mathematics, computer science, communication engineering and other fields. The explicit construction of finite fields and the

The aim of this book is to explain the shape of Greek mathematical thinking. It can be read on three levels: as a description of the practices of Greek mathematics; as a theory of the emergence of the deductive method; and as a case-study for a general view on the history of science. The starting point for the enquiry is geometry and the lettered diagram. Reviel Netz exploits the mathematicians' practices in the construction and lettering of their diagrams, and the continuing interaction between text and diagram in their proofs, to illuminate the underlying cognitive processes. A close examination of the mathematical use of language follows, especially mathematicians' use of repeated formulae. Two crucial chapters set out to show how mathematical proofs are structured and explain why Greek mathematical practice manages to be so satisfactory. A final chapter looks into the broader historical setting of Greek mathematical practice.

The main theme of this book is micromagnetism and microstructure as well as the analysis of the relations between characteristic properties of the hysteresis loop and microstructure. Also presented is an analysis of the role of microstructure in the fundamental magnetic properties (for example, magnetorestriction or critical behaviour) of crystalline and amorphous alloys. The authors apply the theory of micromagnetism to all aspects of advanced magnetic materials including domain patterns and magnetization processes under the influence of defect structures. Coverage includes modern developments in computational micromagnetism and its application to spin structures of small particles and platelets. It will be of interest to researchers and graduate students in condensed matter, physics, electrical engineering and materials science, as well as to industrial researchers working in the electrotechnical and recording industry.

This textbook presents in a unified manner the fundamentals of both continuous and discrete versions of the Fourier and Laplace transforms. These transforms play an important role in the analysis of all kinds of physical phenomena. As a link between the various applications of these transforms the authors use the theory of signals and systems, as well as the theory of ordinary and partial differential equations. The book is divided into four major parts: periodic functions and Fourier series, non-periodic functions and the Fourier integral, switched-on signals and the Laplace transform, and finally the discrete versions of these transforms, in particular the Discrete Fourier Transform together with its fast implementation, and the z-transform. This textbook is designed for self-study. It includes many worked examples, together with more than 120 exercises, and will be of great value to undergraduates and graduate students in applied mathematics, electrical engineering, physics and comp

This textbook presents in a unified manner the fundamentals of both continuous and discrete versions of the Fourier and Laplace transforms. These transforms play an important role in the analysis of all kinds of physical phenomena. As a link between the various applications of these transforms the authors use the theory of signals and systems, as well as the theory of ordinary and partial differential equations. The book is divided into four major parts: periodic functions and Fourier series, non-periodic functions and the Fourier integral, switched-on signals and the Laplace transform, and finally the discrete versions of these transforms, in particular the Discrete Fourier Transform together with its fast implementation, and the z-transform. This textbook is designed for self-study. It includes many worked examples, together with more than 120 exercises, and will be of great value to undergraduates and graduate students in applied mathematics, electrical engineering, physics and comp

This is a textbook for graduate and upper level undergraduate students in mathematics, computer science, communication engineering and other fields. The explicit construction of finite fields and the

Uniting dozens of seemingly disparate results from different fields, this book combines concepts from mathematics and computer science to present the first integrated treatment of sequences generated by 'finite automata'. The authors apply the theory to the study of automatic sequences and their generalizations, such as Sturmian words and k-regular sequences. And further, they provide applications to number theory (particularly to formal power series and transcendence in finite characteristic), physics, computer graphics, and music. Starting from first principles wherever feasible, basic results from combinatorics on words, numeration systems, and models of computation are discussed. Thus this book is suitable for graduate students or advanced undergraduates, as well as for mature researchers wishing to know more about this fascinating subject. Results are presented from first principles wherever feasible, and the book is supplemented by a collection of 460 exercises, 85 open problems,

In many areas of mathematics, science and engineering, from computer graphics to inverse methods to signal processing, it is necessary to estimate parameters, usually multidimensional, by approximation and interpolation. Radial basis functions are a powerful tool which work well in very general circumstances and so are becoming of widespread use as the limitations of other methods, such as least squares, polynomial interpolation or wavelet-based, become apparent. The author's aim is to give a thorough treatment from both the theoretical and practical implementation viewpoints. For example, he emphasises the many positive features of radial basis functions such as the unique solvability of the interpolation problem, the computation of interpolants, their smoothness and convergence and provides a careful classification of the radial basis functions into types that have different convergence. A comprehensive bibliography rounds off what will prove a very valuable work.

The theory of dynamical systems is a major mathematical discipline closely intertwined with all main areas of mathematics. It has greatly stimulated research in many sciences and given rise to the vast new area variously called applied dynamics, nonlinear science, or chaos theory. This introduction for senior undergraduate and beginning graduate students of mathematics, physics, and engineering combines mathematical rigor with copious examples of important applications. It covers the central topological and probabilistic notions in dynamics ranging from Newtonian mechanics to coding theory. Readers need not be familiar with manifolds or measure theory; the only prerequisite is a basic undergraduate analysis course. The authors begin by describing the wide array of scientific and mathematical questions that dynamics can address. They then use a progression of examples to present the concepts and tools for describing asymptotic behavior in dynamical systems, gradually increasing the leve

Numerical algorithms, modern programming techniques, and parallel computing are often taught serially across different courses and different textbooks. The need to integrate concepts and tools usually comes only in employment or in research - after the courses are concluded - forcing the student to synthesise what is perceived to be three independent subfields into one. This book provides a seamless approach to stimulate the student simultaneously through the eyes of multiple disciplines, leading to enhanced understanding of scientific computing as a whole. The book includes both basic as well as advanced topics and places equal emphasis on the discretization of partial differential equations and on solvers. Some of the advanced topics include wavelets, high-order methods, non-symmetric systems, and parallelization of sparse systems. The material covered is suited to students from engineering, computer science, physics and mathematics.

This concise text, first published in 2003, is for a one-semester course for upper-level undergraduates and beginning graduate students in engineering, science, and mathematics, and can also serve as a quick reference for professionals. The major topics in ordinary differential equations, initial value problems, boundary value problems, and delay differential equations, are usually taught in three separate semester-long courses. This single book provides a sound treatment of all three in fewer than 300 pages. Each chapter begins with a discussion of the 'facts of life' for the problem, mainly by means of examples. Numerical methods for the problem are then developed, but only those methods most widely used. The treatment of each method is brief and technical issues are minimized, but all the issues important in practice and for understanding the codes are discussed. The last part of each chapter is a tutorial that shows how to solve problems by means of small, but realistic, examples.

This concise text, first published in 2003, is for a one-semester course for upper-level undergraduates and beginning graduate students in engineering, science, and mathematics, and can also serve as a quick reference for professionals. The major topics in ordinary differential equations, initial value problems, boundary value problems, and delay differential equations, are usually taught in three separate semester-long courses. This single book provides a sound treatment of all three in fewer than 300 pages. Each chapter begins with a discussion of the 'facts of life' for the problem, mainly by means of examples. Numerical methods for the problem are then developed, but only those methods most widely used. The treatment of each method is brief and technical issues are minimized, but all the issues important in practice and for understanding the codes are discussed. The last part of each chapter is a tutorial that shows how to solve problems by means of small, but realistic, examples.

This report of the National Research Council examines the possibilities and promises of increased interaction between the geospatial and computer science research communities for capitalizing on the i

This book discusses how citizens can participate more effectively in sustainability science and environmental policy debates. It discusses designs for participatory procedures, and experiences of their application to issues of global change. While the focus is on citizen participation, the involvement of specific stakeholders - including water managers and venture capitalists - is also addressed. The book describes how focus group methods were combined with the interactive use of computer models into new forms of participation, tested with six hundred citizens. The results are discussed in relation to other important topics, including greenhouse gas and water management. By combining this with an examination of issues of interactive governance and developing country participation, the book provides state-of-the-art, practical insights for students, researchers and policy makers alike.

This book discusses how citizens can participate more effectively in sustainability science and environmental policy debates. It discusses designs for participatory procedures, and experiences of their application to issues of global change. While the focus is on citizen participation, the involvement of specific stakeholders - including water managers and venture capitalists - is also addressed. The book describes how focus group methods were combined with the interactive use of computer models into new forms of participation, tested with six hundred citizens. The results are discussed in relation to other important topics, including greenhouse gas and water management. By combining this with an examination of issues of interactive governance and developing country participation, the book provides state-of-the-art, practical insights for students, researchers and policy makers alike.

The finite-state paradigm of computer science has provided a basis for natural-language applications that are efficient, elegant, and robust. This volume is a practical guide to finite-state theory a

Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appeared here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations.

Information content and programming semantics are just two of the applications of the mathematical concepts of order, continuity and domains. The authors develop the mathematical foundations of partially ordered sets with completeness properties of various degrees, in particular directed complete ordered sets and complete lattices. Uniquely, they focus on partially ordered sets that have an extra order relation, modelling the notion that one element 'finitely approximates' another, something closely related to intrinsic topologies linking order and topology. Extensive use is made of topological ideas, both by defining useful topologies on the structures themselves and by developing close connections with numerous aspects of topology. The theory so developed not only has applications to computer science but also within mathematics to such areas as analysis, the spectral theory of algebras and the theory of computability. This authoritative, comprehensive account of the subject will be e

This two-volume work bridges the gap between introductory expositions of logic or set theory on one hand, and the research literature on the other. It can be used as a text in an advanced undergraduate or beginning graduate course in mathematics, computer science, or philosophy. The volumes are written in a user-friendly conversational lecture style that makes them equally effective for self-study or class use. Volume II, on formal (ZFC) set theory, incorporates a self-contained 'chapter 0' on proof techniques so that it is based on formal logic, in the style of Bourbaki. The emphasis on basic techniques will provide the reader with a solid foundation in set theory and provides a context for the presentation of advanced topics such as absoluteness, relative consistency results, two expositions of Godel's constructible universe, numerous ways of viewing recursion, and a chapter on Cohen forcing.

This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics.

This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics.

Abstract regular polytopes stand at the end of more than two millennia of geometrical research, which began with regular polygons and polyhedra. They are highly symmetric combinatorial structures with distinctive geometric, algebraic or topological properties; in many ways more fascinating than traditional regular polytopes and tessellations. The rapid development of the subject in the past 20 years has resulted in a rich new theory, featuring an attractive interplay of mathematical areas, including geometry, combinatorics, group theory and topology. Abstract regular polytopes and their groups provide an appealing new approach to understanding geometric and combinatorial symmetry. This is the first comprehensive up-to-date account of the subject and its ramifications, and meets a critical need for such a text, because no book has been published in this area of classical and modern discrete geometry since Coxeter's Regular Polytopes (1948) and Regular Complex Polytopes (1974). The book

This two-volume work bridges the gap between introductory expositions of logic or set theory on one hand, and the research literature on the other. It can be used as a text in an advanced undergraduate or beginning graduate course in mathematics, computer science, or philosophy. The volumes are written in a user-friendly conversational lecture style that makes them equally effective for self-study or class use. Volume 1 includes formal proof techniques, a section on applications of compactness (including nonstandard analysis), a generous dose of computability and its relation to the incompleteness phenomenon, and the first presentation of a complete proof of Godel's 2nd incompleteness since Hilbert and Bernay's Grundlagen theorem.

Implement proven design techniques for control systems without having to master any advanced mathematics. Using an effective step-by-step approach, this book presents a number of control system design

This 2003 book provides an analysis of combinatorial games - games not involving chance or hidden information. It contains a fascinating collection of articles by some well-known names in the field, such as Elwyn Berlekamp and John Conway, plus other researchers in mathematics and computer science, together with some top game players. The articles run the gamut from theoretical approaches (infinite games, generalizations of game values, 2-player cellular automata, Alpha-Beta pruning under partial orders) to other games (Amazons, Chomp, Dot-and-Boxes, Go, Chess, Hex). Many of these advances reflect the interplay of the computer science and the mathematics. The book ends with a bibliography by A. Fraenkel and a list of combinatorial game theory problems by R. K. Guy. Like its predecessor, Games of No Chance, this should be on the shelf of all serious combinatorial games enthusiasts.

How the cerebellum accomplishes its highly complex feats of coordination has been the subject of much inquiry; one of the pre-eminent theories places adaptive control at the forefront. This book reinforces the view that the cerebellum functions as an adaptive control system; that is, it automatically adjusts its output as needed for such eventualities as temporary or lasting weakness of muscle. It is the first text to synthesize the substantial body of literature on the subject, combining the neuroscience of the cerebellum with the science of control theory common to electrical and computer engineers. Organized in four parts, the book examines cerebellar anatomy and physiology; cerebellar function; models and theories; and ends with a summary and conclusions. The author's clinical perspective offers a broader view of cerebellar function beyond the basic neuroscience. An appendix demonstrates evidence supporting the adaptive control model from a detailed comparison of the cerebellum wit

This is an advanced 2001 textbook on modal logic, a field which caught the attention of computer scientists in the late 1970s. Researchers in areas ranging from economics to computational linguistics have since realised its worth. The book is for novices and for more experienced readers, with two distinct tracks clearly signposted at the start of each chapter. The development is mathematical; prior acquaintance with first-order logic and its semantics is assumed, and familiarity with the basic mathematical notions of set theory is required. The authors focus on the use of modal languages as tools to analyze the properties of relational structures, including their algorithmic and algebraic aspects, and applications to issues in logic and computer science such as completeness, computability and complexity are considered. Three appendices supply basic background information and numerous exercises are provided. Ideal for anyone wanting to learn modern modal logic.