""Algorithms for Games"" aims to provide a concrete example of the programming of a two-person game with complete information, and to demonstrate some of the methods of solutions; to show the reader that it is profitable not to fear a search, but rather to undertake it in a rational fashion, make a proper estimate of the dimensions of the "catastrophe," and use all suitable means to keep it down to a reasonable size. The book is dedicated to the study of methods for limiting the extent of a search. The game programming problem is very well suited to the study of the search problem, and in general for multi-step solution processes. With this in mind, the book focuses on the programming of games as the best means of developing the ideas and methods presented. While many of the examples are related to chess, only an elementary knowledge of the game is needed.

This volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held. at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets. Only twenty years later the Symposium on Partially Ordered Sets and Lattice Theory, held at Monterey, U.S.A., had solved many of the problems that had been originally posed. In 1981, the Symposium on Ordered Sets held at Banff, Canada, continued this tradition. It was marked by a landmark volume containing twenty-three articles on almost all current topics in the theory of ordered sets and its applications. Three years after, Graphs and Orders, also held at Banff, Canada, aimed to document the role of graphs in the theory of ordered sets and its applications. Because of its special place in the landscape of the mathematical sciences order is especially sensitive to new trends and developments. Today, the most important current in the theory and application of order springs from theoretical computer seience. Two themes of computer science lead the way. The first is data structure. Order is common to data structures."

Polynomial extremal problems (PEP) constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. Let: e = {: e 1, ...: en} be the vector in n-dimensional real linear space Rn; n PO(: e), PI (: e), ..., Pm (: e) are polynomial functions in R with real coefficients. In general, a PEP can be formulated in the following form: (0.1) find r = inf Po(: e) subject to constraints (0.2) Pi (: e) =0, i=l, ..., m (a constraint in the form of inequality can be written in the form of equality by introducing a new variable: for example, P( x) 0 is equivalent to P(: e) + y2 = 0). Boolean and mixed polynomial problems can be written in usual form by adding for each boolean variable z the equality: Z2 - Z = O. Let a = {al, ..., a } be integer vector with nonnegative entries {a;}f=l. n Denote by R a](: e) monomial in n variables of the form: n R a](: e) = IT: ef';;=1 d(a) = 2:7=1 ai is the total degree of monomial R a]. Each polynomial in n variables can be written as sum of monomials with nonzero coefficients: P(: e) = L caR a](: e), aEA{P) IX x Nondifferentiable optimization and polynomial problems where A(P) is the set of monomials contained in polynomial P

Intended for first- or second-year undergraduates, this introduction to discrete mathematics covers the usual topics of such a course, but applies constructivist principles that promote - indeed, require - active participation by the student. Working with the programming language ISETL, whose syntax is close to that of standard mathematical language, the student constructs the concepts in her or his mind as a result of constructing them on the computer in the syntax of ISETL. This dramatically different approach allows students to attempt to discover concepts in a "Socratic" dialog with the computer. The discussion avoids the formal "definition-theorem" approach and promotes active involvement by the reader by its questioning style. An instructor using this text can expect a lively class whose students develop a deep conceptual understanding rather than simply manipulative skills. Topics covered in this book include: the propositional calculus, operations on sets, basic counting methods, predicate calculus, relations, graphs, functions, and mathematical induction.

The research and development of pattern recognition have proven to be of importance in science, technology, and human activity. Many useful concepts and tools from different disciplines have been employed in pattern recognition. Among them is string matching, which receives much theoretical and practical attention. String matching is also an important topic in combinatorial optimization. This book is devoted to recent advances in pattern recognition and string matching. It consists of twenty eight chapters written by different authors, addressing a broad range of topics such as those from classifica tion, matching, mining, feature selection, and applications. Each chapter is self-contained, and presents either novel methodological approaches or applications of existing theories and techniques. The aim, intent, and motivation for publishing this book is to pro vide a reference tool for the increasing number of readers who depend upon pattern recognition or string matching in some way. This includes students and professionals in computer science, mathematics, statistics, and electrical engineering. We wish to thank all the authors for their valuable efforts, which made this book a reality. Thanks also go to all reviewers who gave generously of their time and expertise."

It is very tempting but a little bit dangerous to compare the style of two great mathematicians or of their schools. I think that it would be better to compare papers from both schools dedicated to one area, geometry and to leave conclusions to a reader of this volume. The collaboration of these two schools is not new. One of the best mathematics journals Functional Analysis and its Applications had I.M. Gelfand as its chief editor and V.I. Arnold as vice-chief editor. Appearances in one issue of the journal presenting remarkable papers from seminars of Arnold and Gelfand always left a strong impact on all of mathematics. We hope that this volume will have a similar impact. Papers from Arnold's seminar are devoted to three important directions developed by his school: Symplectic Geometry (F. Lalonde and D. McDuff), Theory of Singularities and its applications (F. Aicardi, I. Bogaevski, M. Kazarian), Geometry of Curves and Manifolds (S. Anisov, V. Chekanov, L. Guieu, E. Mourre and V. Ovsienko, S. Gusein-Zade and S. Natanzon). A little bit outside of these areas is a very interesting paper by M. Karoubi Produit cyclique d'espaces et operations de Steenrod.

In the last thirty years Computational Geometry has emerged as a new discipline from the field of design and analysis of algorithms. That dis cipline studies geometric problems from a computational point of view, and it has attracted enormous research interest. But that interest is mostly concerned with Euclidean Geometry (mainly the plane or Eu clidean 3-dimensional space). Of course, there are some important rea sons for this occurrence since the first applieations and the bases of all developments are in the plane or in 3-dimensional space. But, we can find also some exceptions, and so Voronoi diagrams on the sphere, cylin der, the cone, and the torus have been considered previously, and there are manY works on triangulations on the sphere and other surfaces. The exceptions mentioned in the last paragraph have appeared to try to answer some quest ions which arise in the growing list of areas in which the results of Computational Geometry are applicable, since, in practiee, many situations in those areas lead to problems of Com putational Geometry on surfaces (probably the sphere and the cylinder are the most common examples). We can mention here some specific areas in which these situations happen as engineering, computer aided design, manufacturing, geographie information systems, operations re search, roboties, computer graphics, solid modeling, etc."

The book is an introduction to the theory of convex polytopes and polyhedral sets, to algebraic geometry, and to the connections between these fields, known as the theory of toric varieties. The first part of the book covers the theory of polytopes and provides large parts of the mathematical background of linear optimization and of the geometrical aspects in computer science. The second part introduces toric varieties in an elementary way.

This work presents new and old constructions of nearrings. Links between properties of the multiplicative of nearrings (as regularity conditions and identities) and the structure of nearrings are studied. Primality and minimality properties of ideals are collected. Some types of simpler' nearrings are examined. Some nearrings of maps on a group are reviewed and linked with group-theoretical and geometrical questions.
Audience: Researchers working in nearring theory, group theory, semigroup theory, designs, and translation planes. Some of the material will be accessible to graduate students.

What is the "archetypal" image that comes to mind when one thinks of an infinite graph? What with a finite graph - when it is thought of as opposed to an infinite one? What structural elements are typical for either - by their presence or absence - yet provide a common ground for both? In planning the workshop on "Cycles and Rays" it had been intended from the outset to bring infinite graphs to the fore as much as possible. There never had been a graph theoretical meeting in which infinite graphs were more than "also rans", let alone one in which they were a central theme. In part, this is a matter of fashion, inasmuch as they are perceived as not readily lending themselves to applications, in part it is a matter of psychology stemming from the insecurity that many graph theorists feel in the face of set theory - on which infinite graph theory relies to a considerable extent. The result is that by and large, infinite graph theorists know what is happening in finite graphs but not conversely. Lack of knowledge about infinite graph theory can also be found in authoritative l sources. For example, a recent edition (1987) of a major mathematical encyclopaedia proposes to ". . . restrict [itself] to finite graphs, since only they give a typical theory". If anything, the reverse is true, and needless to say, the graph theoretical world knows better. One may wonder, however, by how much.

When? These are the proceedings of Finite Geometries, the Fourth Isle of Thorns Conference, which took place from Sunday 16 to Friday 21 July, 2000. It was organised by the editors of this volume. The Third Conference in 1990 was published as Advances in Finite Geometries and Designs by Oxford University Press and the Second Conference in 1980 was published as Finite Geometries and Designs by Cambridge University Press. The main speakers were A. R. Calderbank, P. J. Cameron, C. E. Praeger, B. Schmidt, H. Van Maldeghem. There were 64 participants and 42 contributions, all listed at the end of the volume. Conference web site http://www. maths. susx. ac. uk/Staff/JWPH/ Why? This collection of 21 articles describes the latest research and current state of the art in the following inter-linked areas: * combinatorial structures in finite projective and affine spaces, also known as Galois geometries, in which combinatorial objects such as blocking sets, spreads and partial spreads, ovoids, arcs and caps, as well as curves and hypersurfaces, are all of interest; * geometric and algebraic coding theory; * finite groups and incidence geometries, as in polar spaces, gener alized polygons and diagram geometries; * algebraic and geometric design theory, in particular designs which have interesting symmetric properties and difference sets, which play an important role, because of their close connections to both Galois geometry and coding theory.

This monograph extends this approach to the more general investigation of X-lattices, and these "tree lattices" are the main object of study. The authors present a coherent survey of the results on uniform tree lattices, and a (previously unpublished) development of the theory of non-uniform tree lattices, including some fundamental and recently proved existence theorems. Tree Lattices should be a helpful resource to researchers in the field, and may also be used for a graduate course on geometric methods in group theory.

This volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference, held in July 2007 at the University of Reading. This biennial conference is a well-established international event and the articles are of the high quality that befits the event. By its nature this volume provides an up-to-date overview of current research activity in several areas of combinatorics, ranging from graph theory to current applications of combinatorial mathematics, including efficient approximability of NP-hard optimization problems and cryptographic key management. The authors are some of the world's foremost researchers in their fields, and here they summarize existing results, and give a unique preview of work currently being written up. The book provides a valuable survey of the present state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science, statistics and engineering.

This introductory text in graph theory focuses on partial cubes, which are graphs that are isometrically embeddable into hypercubes of an arbitrary dimension, as well as bipartite graphs, and cubical graphs. Currently, "Graphs and Cubes" is the only book available on the market that presents a comprehensive coverage of cubical graph and partial cube theories. Many exercises, along with historical notes, are included at the end of every chapter, and readers are encouraged to explore the exercises fully, and use them as a basis for research projects.

The prerequisites for this text include familiarity with basic mathematical concepts and methods on the level of undergraduate courses in discrete mathematics, linear algebra, group theory, and topology of Euclidean spaces. While the book is intended for lower-division graduate students in mathematics, it will be of interest to a much wider audience; because of their rich structural properties, partial cubes appear in theoretical computer science, coding theory, genetics, and even the political and social sciences."

From the reviews: "This is a textbook in cryptography with emphasis on algebraic methods. It is supported by many exercises (with answers) making it appropriate for a course in mathematics or computer science. ...] Overall, this is an excellent expository text, and will be very useful to both the student and researcher." Mathematical Reviews

Recent progress in research, teaching and communication has arisen from the use of new tools in visualization. To be fruitful, visualization needs precision and beauty. This book is a source of mathematical illustrations by mathematicians as well as artists. It offers examples in many basic mathematical fields including polyhedra theory, group theory, solving polynomial equations, dynamical systems and differential topology.
For a long time, arts, architecture, music and painting have been the source of new developments in mathematics. And vice versa, artists have often found new techniques, themes and inspiration within mathematics. Here, while mathematicians provide mathematical tools for the analysis of musical creations, the contributions from sculptors emphasize the role of mathematics in their work.

This classic geometry text explores the theory of 3-dimensional convex polyhedra in a unique fashion, with exceptional detail. Vital and clearly written, the book includes the basics of convex polyhedra and collects the most general existence theorems for convex polyhedra that are proved by a new and unified method. This edition includes a comprehensive bibliography by V.A. Zalgaller, and related papers as supplements to the original text.

Parallel and distributed computation has been gaining a great lot of attention in the last decades. During this period, the advances attained in computing and communication technologies, and the reduction in the costs of those technolo gies, played a central role in the rapid growth of the interest in the use of parallel and distributed computation in a number of areas of engineering and sciences. Many actual applications have been successfully implemented in various plat forms varying from pure shared-memory to totally distributed models, passing through hybrid approaches such as distributed-shared memory architectures. Parallel and distributed computation differs from dassical sequential compu tation in some of the following major aspects: the number of processing units, independent local dock for each unit, the number of memory units, and the programming model. For representing this diversity, and depending on what level we are looking at the problem, researchers have proposed some models to abstract the main characteristics or parameters (physical components or logical mechanisms) of parallel computers. The problem of establishing a suitable model is to find a reasonable trade-off among simplicity, power of expression and universality. Then, be able to study and analyze more precisely the behavior of parallel applications."

This solid volume discusses all the key topics in detail, including classification, orbit structure, representations, universal constructions, and abstract analogues. Open problems are discussed as they arise and many useful exercises are included.

One of the greatest scientific challenges of the 21st century is how to master, organize and extract useful knowledge from the overwhelming flow of information made available by today 's data acquisition systems and computing resources. Visualization is the premium means of taking up this challenge. This book is based on selected lectures given by leading experts in scientific visualization during a workshop held at Schloss Dagstuhl, Germany. Topics include user issues in visualization, large data visualization, unstructured mesh processing for visualization, volumetric visualization, flow visualization, medical visualization and visualization systems. The book contains more than 350 color illustrations.

Combinatorics and Matrix Theory have a symbiotic, or mutually beneficial, relationship. This relationship is discussed in my paper The symbiotic relationship of combinatorics and matrix theoryl where I attempted to justify this description. One could say that a more detailed justification was given in my book with H. J. Ryser entitled Combinatorial Matrix Theon? where an attempt was made to give a broad picture of the use of combinatorial ideas in matrix theory and the use of matrix theory in proving theorems which, at least on the surface, are combinatorial in nature. In the book by Liu and Lai, this picture is enlarged and expanded to include recent developments and contributions of Chinese mathematicians, many of which have not been readily available to those of us who are unfamiliar with Chinese journals. Necessarily, there is some overlap with the book Combinatorial Matrix Theory. Some of the additional topics include: spectra of graphs, eulerian graph problems, Shannon capacity, generalized inverses of Boolean matrices, matrix rearrangements, and matrix completions. A topic to which many Chinese mathematicians have made substantial contributions is the combinatorial analysis of powers of nonnegative matrices, and a large chapter is devoted to this topic. This book should be a valuable resource for mathematicians working in the area of combinatorial matrix theory. Richard A. Brualdi University of Wisconsin - Madison 1 Linear Alg. Applies., vols. 162-4, 1992, 65-105 2Camhridge University Press, 1991.

Computers have stretched the limits of what is possible in mathematics. More: they have given rise to new fields of mathematical study; the analysis of new and traditional algorithms, the creation of new paradigms for implementing computational methods, the viewing of old techniques from a concrete algorithmic vantage point, to name but a few. Computational Algebra and Number Theory lies at the lively intersection of computer science and mathematics. It highlights the surprising width and depth of the field through examples drawn from current activity, ranging from category theory, graph theory and combinatorics, to more classical computational areas, such as group theory and number theory. Many of the papers in the book provide a survey of their topic, as well as a description of present research. Throughout the variety of mathematical and computational fields represented, the emphasis is placed on the common principles and the methods employed. Audience: Students, experts, and those performing current research in any of the topics mentioned above.

This book introduces a new theory in Computer Vision yielding elementary techniques to analyze digital images. These techniques are a mathematical formalization of the Gestalt theory. From the mathematical viewpoint the closest field to it is stochastic geometry, involving basic probability and statistics, in the context of image analysis. The book is mathematically self-contained, needing only basic understanding of probability and calculus. The text includes more than 130 illustrations, and numerous examples based on specific images on which the theory is tested. Detailed exercises at the end of each chapter help the reader develop a firm understanding of the concepts imparted.

An in-depth look at soft computing methods and their applications in the human sciences, such as the social and the behavioral sciences. Soft computing methods - including fuzzy systems, neural networks, evolutionary computing and probabilistic reasoning - are state-of-the-art methods in theory formation and model construction. The powerful application areas of these methods in the human sciences are demonstrated, including the replacement of statistical models by simpler numerical or linguistic soft computing models and the use of computer simulations with approximate and linguistic constituents.

"Dr. Niskanen's work opens new vistas in application of soft computing, fuzzy logic and fuzzy set theory to the human sciences. This book is likely to be viewed in retrospect as a landmark in its field"
(Lotfi A. Zadeh, Berkeley)

Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields.