Discrete mathematics

In the past two decades, breakthroughs in computer technology have made a tremendous impact on optimization.

The articles collected in this volume represent the contributions presented at the IMA workshop on "e;Dynamics of Algorithms"e; which took place in November 1997.

One of the most effective ways to stimulate students to enjoy intellectual efforts is the scientific competition.

The articles in this volume present the state of the art in a variety of areas of discrete probability, including random walks on finite and infinite graphs, random trees, renewal sequences, Stein's method for normal approximation and Kohonen-type self-organizing maps.

The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole.

The present book is rare, even unique of its kind, at least among mathematics texts published in Russian.

The action of a compact Lie group, G, on a compact sympletic manifold gives rise to some remarkable combinatorial invariants.

Over the last 30 years graph theory has evolved into an important math- ematical tool in the solution of a wide variety of problems in many areas of society.

Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer.

This text originated as a lecture delivered November 20, 1984, at Queen's University, in the undergraduate colloquium senes.

Structured adaptive mesh refinement (SAMR) methods have matured over the past 20 years and are now the method of choice for certain difficult problems, such as compressible flow.

Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained.

A transfinite graph or electrical network of the first rank is obtained conceptually by connecting conventionally infinite graphs and networks together at their infinite extremities.

Magic labelings Magic squares are among the more popular mathematical recreations.

Developments in mathematical physics during the second half of the 20th century influenced a number of mathematical areas, among the more significant being representation theory, differential equations, combinatorics, and algebraic geometry.

This work is an introduction to the basic tools of the theory of (partially) ordered sets such as visualization via diagrams, subsets, homomorphisms, important order-theoretical constructions, and classes of ordered sets.

This book is the second edition of the third and last volume of a treatise on projective spaces over a finite field, also known as Galois geometries.

In cryptography, ciphers is the technical term for encryption and decryption algorithms.

Graph theory is a very popular area of discrete mathematics with not only numerous theoretical developments, but also countless applications to prac- tical problems.

Computer and Information Security Handbook, Fourth Edition offers deep coverage of an extremely wide range of issues in computer and cybersecurity theory, along with applications and best practices, offering the latest insights into established and emerging technologies and advancements.

Identity Based Encryption (IBE) is a type of public key encryption and has been intensely researched in the past decade.

The field of global optimization has been developing at a rapid pace.

Lagrange and penalty function methods provide a powerful approach, both as a theoretical tool and a computational vehicle, for the study of constrained optimization problems.

Semi-infinite optimization is a vivid field of active research.

In the spectrum of mathematics, graph theory which studies a mathe- matical structure on a set of elements with a binary relation, as a recognized discipline, is a relative newcomer.

A First Course in Information Theory is an up-to-date introduction to information theory.

How do you convey to your students, colleagues and friends some of the beauty of the kind of mathematics you are obsessed with?

This is the first book about the discrete ordered median problem (DOMP), which unifies many classical and new facility location problems.

Graph theory has experienced a tremendous growth during the 20th century.

The computation of invariants of algebraic number fields such as integral bases, discriminants, prime decompositions, ideal class groups, and unit groups is important both for its own sake and for its numerous applications, for example, to the solution of Diophantine equations.

Since the volume may be of interest to a broad variety of people, it is arranged in parts that require different levels of mathematical background.

A Course in Topological Combinatorics is the first undergraduate textbook on the field of topological combinatorics, a subject that has become an active and innovative research area in mathematics over the last thirty years with growing applications in math, computer science, and other applied areas.

A study of topology and geometry, beginning with a comprehensible account of the extraordinary and rather mysterious impact of mathematical physics, and especially gauge theory, on the study of the geometry and topology of manifolds.

"e;Proofs and Fundamentals: A First Course in Abstract Mathematics"e; 2nd edition is designed as a "e;transition"e; course to introduce undergraduates to the writing of rigorous mathematical proofs, and to such fundamental mathematical ideas as sets, functions, relations, and cardinality.

Emphasizes a Problem Solving ApproachA first course in combinatoricsCompletely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems.

Originally written to define the relation between the theories of transfinite numbers and mathematical games, the resulting work is a mathematically sophisticated but eminently enjoyable guide to game theory.

For many decades, Martin Gardner, the Grand Master of mathematical puzzles, has provided the tools and projects to furnish our all-too-sluggish minds with an athletic workout.

Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics.

Taking an approach to the subject that is suitable for a broad readership, Discrete Mathematics: Proofs, Structures, and Applications, Third Edition provides a rigorous yet accessible exposition of discrete mathematics, including the core mathematical foundation of computer science.

Skills used in business and also present in most middle & high school math competitions.

The reach of algebraic curves in cryptography goes far beyond elliptic curve or public key cryptography yet these other application areas have not been systematically covered in the literature.

Design Theory, Second Edition presents some of the most important techniques used for constructing combinatorial designs.

Maps are beguilingly simple structures with deep and ubiquitous properties.

A study of difference equations and inequalities.

Tsutomu Sasao - Kyushu Institute of Technology, Japan The material covered in this book is quite unique especially for p- ple who are reading English, since such material is quite hard to ?

The problem of counting the number of self-avoiding polygons on a square grid, - therbytheirperimeterortheirenclosedarea,is aproblemthatis soeasytostate that, at ?

Stochastic geometry, based on current developments in geometry, probability and measure theory, makes possible modeling of two- and three-dimensional random objects with interactions as they appear in the microstructure of materials, biological tissues, macroscopically in soil, geological sediments etc.

Cryptography in Chinese consists of two characters meaning "e;secret coded"e;.

This is a comprehensive overview of the basics of fuzzy control, which also brings together some recent research results in soft computing, in particular fuzzy logic using genetic algorithms and neural networks.

Real-Time Applications with Stochastic Task Execution Times presents three approaches to the analysis of the deadline miss ratio of applications with stochastic task execution times.