Mathematics of Discrete Structures for Computer Science

Although graph theory, design theory, and coding theory had their origins in various areas of applied mathematics, today they are to be found under the umbrella of discrete mathematics. Here the authors have considerably reworked and expanded their earlier successful books on graphs, codes and designs, into an invaluable textbook. They do not seek to consider each of these three topics individually, but rather to stress the many and varied connections between them. The discrete mathematics needed is developed in the text, making this book accessible to any student with a background of undergraduate algebra. Many exercises and useful hints are included througout, and a large number of references are given.

Although graph theory, design theory, and coding theory had their origins in various areas of applied mathematics, today they are to be found under the umbrella of discrete mathematics. Here the authors have considerably reworked and expanded their earlier successful books on graphs, codes and designs, into an invaluable textbook. They do not seek to consider each of these three topics individually, but rather to stress the many and varied connections between them. The discrete mathematics needed is developed in the text, making this book accessible to any student with a background of undergraduate algebra. Many exercises and useful hints are included througout, and a large number of references are given.

This new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a glimpse of a methodology for data analysis that is of commercial value in social science. Classroom experience has led to numerous pedagogical improvements and many new exercises have been added. As before, exposure to elementary abstract algebra and the notation of set theory are the only prerequisites, making the book suitable for advanced undergraduates and beginning graduate students. It will also be a valuable resource for anyone who meets ordered structures.

For second-year mathematics students and for scientists and computer scientists who not only will apply stochastics but also want to understand its mathematical dimension, Georgii (mathematics, Ludwig

The theme of this book is the study of the distribution of integer powers modulo a prime number. It provides numerous new, sometimes quite unexpected, links between number theory and computer science as well as to other areas of mathematics. Possible applications include (but are not limited to) complexity theory, random number generation, cryptography, and coding theory. The main method discussed is based on bounds of exponential sums. Accordingly, the book contains many estimates of such sums, including new estimates of classical Gaussian sums. It also contains many open questions and proposals for further research.

Proofs play a central role in advanced mathematics and theoretical computer science, yet many students struggle the first time they take a course in which proofs play a significant role. This bestselling text's third edition helps students transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs. Featuring over 150 new exercises and a new chapter on number theory, this new edition introduces students to the world of advanced mathematics through the mastery of proofs. The book begins with the basic concepts of logic and set theory to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for an analysis of techniques that can be used to build up complex proofs step by step, using detailed 'scratch work' sections to expose the machinery of proofs about numbers, sets, relations, and functions. Assuming no background beyond standard high school mathematics, this book w

Proofs play a central role in advanced mathematics and theoretical computer science, yet many students struggle the first time they take a course in which proofs play a significant role. This bestselling text's third edition helps students transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs. Featuring over 150 new exercises and a new chapter on number theory, this new edition introduces students to the world of advanced mathematics through the mastery of proofs. The book begins with the basic concepts of logic and set theory to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for an analysis of techniques that can be used to build up complex proofs step by step, using detailed 'scratch work' sections to expose the machinery of proofs about numbers, sets, relations, and functions. Assuming no background beyond standard high school mathematics, this book w

Bagui (computer science, U. of West Florida) and Earp (emeritus, computer science, U. of West Florida) offer a learning manual for SQL using SQL Server 2008. The book is set up in a manner that would

Mathematics is the fundamental knowledge for every scientist. As an academic at the University of Science and Technology of China, Professor Sheng Gong takes his passion for mathematics teaching even

Mathematics is the fundamental knowledge for every scientist. As an academic at the University of Science and Technology of China, Professor Sheng Gong takes his passion for mathematics teaching even

Reasoning under uncertainty, that is, making judgements with only partial knowledge, is a major theme in artificial intelligence. Professor Paris provides here an introduction to the mathematical foundations of the subject. It is suited for readers with some knowledge of undergraduate mathematics but is otherwise self-contained, collecting together the key results on the subject and formalizing within a unified framework the main contemporary approaches and assumptions. The author has concentrated on giving clear mathematical formulations, analyses, justifications and consequences of the main theories about uncertain reasoning, so the book can serve as a textbook for beginners or as a starting point for further basic research into the subject. It will be welcomed by graduate students and research workers in logic, philosophy and computer science as an account of how mathematics and artificial intelligence can complement and enrich each other.

Designed for a three-hour semester course on signals and systems, this textbook presents continuous-time and discrete-time signals and systems to electrical and computer engineering students in a mann

Written in an easy-to-understand manner, this comprehensive textbook brings together both basic and advanced concepts of numerical methods in a single volume. Important topics including error analysis, nonlinear equations, systems of linear equations, interpolation and interpolation for Equal intervals and bivariate interpolation are discussed comprehensively. The textbook is written to cater to the needs of undergraduate students of mathematics, computer science, mechanical engineering, civil engineering and information technology for a course on numerical methods/numerical analysis. The text simplifies the understanding of the concepts through exercises and practical examples. Pedagogical features including solved examples and unsolved exercises are interspersed throughout the book for better understanding.

The problem of evaluating integrals is well known to every student who has had a year of calculus. It was an especially important subject in 19th century analysis and it has now been revived with the appearance of symbolic languages. In this book, the authors use the problem of exact evaluation of definite integrals as a starting point for exploring many areas of mathematics. The questions discussed in this book, first published in 2004, are as old as calculus itself. In presenting the combination of methods required for the evaluation of most integrals, the authors take the most interesting, rather than the shortest, path to the results. Along the way, they illuminate connections with many subjects, including analysis, number theory, algebra and combinatorics. This will be a guided tour of exciting discovery for undergraduates and their teachers in mathematics, computer science, physics, and engineering.

By virtue of their special algebraic structures, Pythagorean-hodograph (PH) curves offer unique advantages for computer-aided design and manufacturing, robotics, motion control, path planning, compute

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.

In the mathematical practice, the Baire category method is a tool for establishing the existence of a rich array of generic structures. However, in mathematics, the Baire category method is also behin

Simplex geometry is a topic generalizing geometry of the triangle and tetrahedron. The appropriate tool for its study is matrix theory, but applications usually involve solving huge systems of linear equations or eigenvalue problems, and geometry can help in visualizing the behaviour of the problem. In many cases, solving such systems may depend more on the distribution of non-zero coefficients than on their values, so graph theory is also useful. The author has discovered a method that in many (symmetric) cases helps to split huge systems into smaller parts. Many readers will welcome this book, from undergraduates to specialists in mathematics, as well as non-specialists who only use mathematics occasionally, and anyone who enjoys geometric theorems. It acquaints the reader with basic matrix theory, graph theory and elementary Euclidean geometry so that they too can appreciate the underlying connections between these various areas of mathematics and computer science.

Systems and their mathematical description play an important role in all branches of science. This book offers an introduction to mathematical modeling techniques. It is intended for undergrad student

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,

Structural proof theory is a branch of logic that studies the general structure and properties of logical and mathematical proofs. This book is both a concise introduction to the central results and methods of structural proof theory, and a work of research that will be of interest to specialists. The book is designed to be used by students of philosophy, mathematics and computer science. The book contains a wealth of results on proof-theoretical systems, including extensions of such systems from logic to mathematics, and on the connection between the two main forms of structural proof theory - natural deduction and sequent calculus. The authors emphasize the computational content of logical results. A special feature of the volume is a computerized system for developing proofs interactively, downloadable from the web and regularly updated.

Structural proof theory is a branch of logic that studies the general structure and properties of logical and mathematical proofs. This book is both a concise introduction to the central results and methods of structural proof theory, and a work of research that will be of interest to specialists. The book is designed to be used by students of philosophy, mathematics and computer science. The book contains a wealth of results on proof-theoretical systems, including extensions of such systems from logic to mathematics, and on the connection between the two main forms of structural proof theory - natural deduction and sequent calculus. The authors emphasize the computational content of logical results. A special feature of the volume is a computerized system for developing proofs interactively, downloadable from the web and regularly updated.

This volume offers a historical and critical analysis of the emerging field of the learning sciences, which takes an interdisciplinary approach to understanding and improving how children and adults learn. It features a wide range of authors, including established scholars who founded and guided the learning sciences through the initial turbulence of forming a new line of academic inquiry, as well as newcomers who are continuing to shape the field. This diversity allows for a broad yet selective perspective on what the learning sciences are, why they came to be, and how contributors conduct their work. Reflections on the Learning Sciences serves both as a starting point for discussion among scholars familiar with the discipline and as an introduction for those interested in learning more. It will benefit graduate students and researchers in computer science, educational psychology, instructional technology, science, engineering, and mathematics.

This volume offers a historical and critical analysis of the emerging field of the learning sciences, which takes an interdisciplinary approach to understanding and improving how children and adults learn. It features a wide range of authors, including established scholars who founded and guided the learning sciences through the initial turbulence of forming a new line of academic inquiry, as well as newcomers who are continuing to shape the field. This diversity allows for a broad yet selective perspective on what the learning sciences are, why they came to be, and how contributors conduct their work. Reflections on the Learning Sciences serves both as a starting point for discussion among scholars familiar with the discipline and as an introduction for those interested in learning more. It will benefit graduate students and researchers in computer science, educational psychology, instructional technology, science, engineering, and mathematics.

Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory.

This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully writ

This textbook provides an accessible introduction to the rich and beautiful area of hyperplane arrangement theory, where discrete mathematics, in the form of combinatorics and arithmetic, meets contin

A series of important applications of combinatorics on words has emerged with the development of computerized text and string processing. The aim of this volume, the third in a trilogy, is to present a unified treatment of some of the major fields of applications. After an introduction that sets the scene and gathers together the basic facts, there follow chapters in which applications are considered in detail. The areas covered include core algorithms for text processing, natural language processing, speech processing, bioinformatics, and areas of applied mathematics such as combinatorial enumeration and fractal analysis. No special prerequisites are needed, and no familiarity with the application areas or with the material covered by the previous volumes is required. The breadth of application, combined with the inclusion of problems and algorithms and a complete bibliography will make this book ideal for graduate students and professionals in mathematics, computer science, biology a

For courses in introductory Computer Science courses using Java, and other introductory programming courses in Computer Science, Computer Engineering, CIS, MIS, IT, and Business. A Concise, Accessi

An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the strong connections of the theory with other branches of mathematics, including geometric and combinatorial group theory, potential analysis, and theoretical computer science. This volume brings together original surveys and research-expository papers from renowned and leading experts, many of whom spoke at the workshop 'Groups, Graphs and Random Walks' celebrating the sixtieth birthday of Wolfgang Woess in Cortona, Italy. Topics include: growth and amenability of groups; Schrödinger operators and symbolic dynamics; ergodic theorems; Thompson's group F; Poisson boundaries; probability theory on buildings and groups of Lie type; structure trees for edge cuts in networks; and mathematical crystallography. In what is currently a fast-growing area of mathematics, this book provides an up-to-date and valuable reference for both researchers and graduate students, from which future research ac

Computational learning theory is a subject which has been advancing rapidly in the last few years. The authors concentrate on the probably approximately correct model of learning, and gradually develop the ideas of efficiency considerations. Finally, applications of the theory to artificial neural networks are considered. Many exercises are included throughout, and the list of references is extensive. This volume is relatively self contained as the necessary background material from logic, probability and complexity theory is included. It will therefore form an introduction to the theory of computational learning, suitable for a broad spectrum of graduate students from theoretical computer science and mathematics.

Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. These maximal, nonlinear Boolean functions and t

This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research - such as the Hamiltonian Cycle and the Travelling Salesman P

Combinatorial algebraic topology is a fascinating and dynamic field at the crossroads of algebraic topology and discrete mathematics. This volume is the first comprehensive treatment of the subject in

This is the first comprehensive introduction to the theory of word-representable graphs, a generalization of several classical classes of graphs, and a new topic in discrete mathematics. After ex

Although computation and the science of physical systems would appear to be unrelated, there are a number of ways in which computational and physical concepts can be brought together in ways that illuminate both. This volume examines fundamental questions which connect scholars from both disciplines: is the universe a computer? Can a universal computing machine simulate every physical process? What is the source of the computational power of quantum computers? Are computational approaches to solving physical problems and paradoxes always fruitful? Contributors from multiple perspectives reflecting the diversity of thought regarding these interconnections address many of the most important developments and debates within this exciting area of research. Both a reference to the state of the art and a valuable and accessible entry to interdisciplinary work, the volume will interest researchers and students working in physics, computer science, and philosophy of science and mathematics.

Although computation and the science of physical systems would appear to be unrelated, there are a number of ways in which computational and physical concepts can be brought together in ways that illuminate both. This volume examines fundamental questions which connect scholars from both disciplines: is the universe a computer? Can a universal computing machine simulate every physical process? What is the source of the computational power of quantum computers? Are computational approaches to solving physical problems and paradoxes always fruitful? Contributors from multiple perspectives reflecting the diversity of thought regarding these interconnections address many of the most important developments and debates within this exciting area of research. Both a reference to the state of the art and a valuable and accessible entry to interdisciplinary work, the volume will interest researchers and students working in physics, computer science, and philosophy of science and mathematics.

More scientists now use C than any other programming language. This book contains practical, computer-ready algorithms for many standard methods of numerical mathematics. It describes the principles o

Once upon a time students of mathematics and students of science or engineering took the same courses in mathematical analysis beyond calculus. Now it is common to separate" advanced mathematics for s

Assuming only an elementary background in discrete mathematics, this textbook is an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algori