Kategoria BISAC: Mathematics >> Discrete Mathematics

No other book covers such a wide scope of this aspect of graph theory.

Surveys of recent important developments in combinatorics covering a wide range of areas in the field.

This text gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in mathematics. Many examples of formal and informal proofs are given.

This volume is based on the workshop"Modelling in Molecular Biology" that tookplacein2002inSingapore. Themaingoaloftheworkshopwastopresent models/methods used in solving some fundamental problems in biosciences. The volume consists of a selection of papers presented at the workshop as well as of some other papers that are included so that the presentation of the theme of the workshop is broader and more balanced. As a matter of fact we feel that the collection of papers comprising this volume represents a wide spectrum of quite diverse ideas and trends. The paper by D. A. Beard et al....

This work attempts to bridge the gap between theory and practice, concentrating on modern algorithmic implementation on parallel architecture machines. Although a suitable text for final year or postgraduate mathematicians it is principally aimed at the applied scientists.

High technology industries are in desperate need for adequate tools to assess the validity of simulations produced by ever faster computers for perennial unstable problems. This book proposes original solutions such as using hypercomputation in quadratic algebras, as opposed to the traditional use of linear vector spaces in the 20th century.

Presents the fundamental topics of discrete mathematics that are introduced from the perspectives of a pure mathematician and an applied computer scientist. This book helps readers learn how to formally define abstract concepts, reason about objects, investigate properties of algorithms, and prove their correctness.

Free Mathematica 10 Update Included Now available from www.wiley.com/go/magrab

Updated material includes:
- Creating regions and volumes of arbitrary shape and determining their properties: arc length, area, centroid, and area moment of inertia
- Performing integrations, solving equations, and determining the maximum and minimum values over regions of arbitrary shape
- Solving numerically a class of linear second order partial differential equations in regions of arbitrary shape using finite elements

An Engineer's Guide to...

Designs and Finite Geometries brings together in one place important contributions and up-to-date research results in this important area of mathematics.
Designs and Finite Geometries serves as an excellent reference, providing insight into some of the most important research issues in the field.

A gentle introduction to the highly sophisticated world of discrete mathematics, Mathematical Problems and Proofs presents topics ranging from elementary definitions and theorems to advanced topics -- such as cardinal numbers, generating functions, properties of Fibonacci numbers, and Euclidean algorithm. This excellent primer illustrates more than 150 solutions and proofs, thoroughly explained in clear language. The generous historical references and anecdotes interspersed throughout the text create interesting intermissions that will fuel readers' eagerness to inquire further about...

Embeddings of discrete metric spaces into Banach spaces recently became an important tool in computer science and topology. The purpose of the book is to present some of the most important techniques and results, mostly on bilipschitz and coarse embeddings.

The topics include: (1) Embeddability of locally finite metric spaces into Banach spaces is finitely determined; (2) Constructions of embeddings; (3) Distortion in terms of Poincare inequalities; (4) Constructions of families of expanders and of families of graphs with unbounded girth and lower bounds on average degrees; (5)...

Mit der zunehmenden Verbreitung von Computeralgebra-Systemen (im folgen den auch CA-System oder CAS gennant) kommt bei den Anwendern immer h?ufiger der Wunsch auf, eigene Algorithmen nicht nur in der durch das CA System definierten Programmiersprache sondern auch in Standardsprachen wie PASCAL, C oder C]+ zu implementieren und in das CA-System zu integrieren. Auf diese Weise k?nnten zugleich viele bereits bestehende Softwarepakete als zus?tzliche Algorithmen innerhalb des CA-Systems angeboten werden. Der Quellcode der genannten Standardsprachen wird dabei durch einen Compiler in direkt...

Counting is one of the basic elementary mathematical activities. It comes with two complementary aspects: to determine the number of elements of a set - and to create an ordering between the objects of counting just by counting them over. For finite sets of objects these two aspects are realized by the same type of num- bers: the natural numbers. That these complementary aspects of the counting pro- cess may need different kinds of numbers becomes apparent if one extends the process of counting to infinite sets. As general tools to determine numbers of elements the cardinals have been created...

This volume represents the refereed proceedings of the Fifth International Conference on Finite Fields and Applications (F q5) held at the University of Augsburg (Germany) from August 2-6, 1999, and hosted by the Department of Mathematics. The conference continued a series of biennial international conferences on finite fields, following earlier conferences at the University of Nevada at Las Vegas (USA) in August 1991 and August 1993, the University ofGlasgow (Scotland) in July 1995, and the University ofWaterloo (Canada) in August 1997. The Organizing Committee of F q5 comprised Thomas Beth...

The main aim of this book is to present a broader view of scientific software than has been common in the past. The provision of scientific software is no longer a matter of just writing 'good computer programs', but rather it is concerned with the development of an integrated software system wI-, ich offers the user facilities which approach all that he needs in terms of speed, accuracy and convenience. This means that due account must, for example, be taken of the high-speed computing capabilities of parallel processors, the exact computing features of symbolic mathematical systems, the...

Combinatorial research has proceeded vigorously in Russia over the last few decades, based on both translated Western sources and original Russian material. The present volume extends the extremal approach to the solution of a large class of problems, including some that were hitherto regarded as exclusively algorithmic, and broadens the choice of theoretical bases for modelling real phenomena in order to solve practical problems.
Audience: Graduate students of mathematics and engineering interested in the thematics of extremal problems and in the field of combinatorics in...

Praise for the First Edition

-...complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity.- -Zentralblatt MATH

A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the...

O presente texto tem por objetivo introduzir conceitos e tecnicas basicas de Matematica que sao essenciais em diversas areas da Engenharia Informatica e da Ciencia da Computacao. Em particular, introduzem-se os conhecimentos matematicos elementares que sao a base dos fundamentos matematicos da computacao e da analise de algoritmos. Por essa razao, este texto destina-se sobretudo a alunos do primeiro ano de cursos universitarios nessas areas. Procura-se familiarizar o leitor com a linguagem e raciocinio matematicos e introduzir alguns dos conceitos e estruturas que sao fundamentais em Ciencia...

The book deals with the many connections between matrices, graphs, diagraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorical properties and to obtain various matrix decomposition theorems. Other chapters cover the permanent of a matrix and Latin squares. The book ends by considering algebraic characterizations of combinatorical properties and the use of combinatorial arguments in proving classical algebraic theorems, including the Cayley-Hamilton Theorem and the Jorda Canonical Form.

Probabilistic Design for Optimization and Robustness

• Presents the theory of modeling with variation using physical models and methods for practical applications on designs more insensitive to variation.
• Provides a comprehensive guide to optimization and robustness for probabilistic design.
• Features examples, case studies and exercises throughout.

The methods presented can be applied to a wide range of disciplines such as mechanics, electrics, chemistry, aerospace, industry and engineering. This text is supported by an accompanying...