This text offers an introduction to error-correcting linear codes for researchers and graduate students in mathematics, computer science and engineering. The book differs from other standard texts in its emphasis on the classification of codes by means of isometry classes. The relevant algebraic are developed rigorously. Cyclic codes are discussed in great detail. In the last four chapters these isometry classes are enumerated, and representatives are constructed algorithmically.

This book highlights recent developments in multidimensional data visualization, presenting both new methods and modifications on classic techniques. Throughout the book, various applications of multidimensional data visualization are presented including its uses in social sciences (economy, education, politics, psychology), environmetrics, and medicine (ophthalmology, sport medicine, pharmacology, sleep medicine). The book provides recent research results in optimization-based visualization. Evolutionary algorithms and a two-level optimization method, based on combinatorial optimization and quadratic programming, are analyzed in detail. The performance of these algorithms and the development of parallel versions are discussed. The utilization of new visualization techniques to improve the capabilies of artificial neural networks (self-organizing maps, feed-forward networks) is also discussed. The book includes over 100 detailed images presenting examples of the many different visualization techniques that the book presents. This book is intended for scientists and researchers in any field of study where complex and multidimensional data must be represented visually.

This text reviews the evolution of the field of visualization, providing innovative examples from various disciplines, highlighting the important role that visualization plays in extracting and organizing the concepts found in complex data. Features: presents a thorough introduction to the discipline of knowledge visualization, its current state of affairs and possible future developments; examines how tables have been used for information visualization in historical textual documents; discusses the application of visualization techniques for knowledge transfer in business relationships, and for the linguistic exploration and analysis of sensory descriptions; investigates the use of visualization to understand orchestral music scores, the optical theory behind Renaissance art, and to assist in the reconstruction of an historic church; describes immersive 360 degree stereographic visualization, knowledge-embedded embodied interaction, and a novel methodology for the analysis of architectural forms.

It is a pleasure for me to have the opportunity to write the foreword to this volume, which is dedicated to Professor Georgy Egorychev on the occasion of his seventieth birthday. I have learned a great deal from his creative and important work, as has the whole world of mathematics. From his life's work (so far) in having made d- tinguished contributions to ?elds as diverse as the theory of permanents, Lie groups, combinatorial identities, the Jacobian conjecture, etc., let me comment on just two of the most important of his research areas. The permanent of an nxn matrix A is Per(A)= a a ...a , (1) ? 1,i 2,i n,i 1 2 n extended over the n! permutations{i ,...,i} of{1,2,...,n}. Thus, the permanent 1 n is "like the determinant except for dropping the sign factors from the terms." H- ever by dropping those signs, one loses almost all of the friendly characteristics of determinants, such as the fact that det(AB)= det(A)det(B), the invariance under elementary row and column operations, and so forth. The permanent is a creature of multilinear algebra, rather than of linear algebra, and is much crankier to deal with in virtually all of its aspects, both theoretical and algorithmic.

Geometric Modeling and Algebraic Geometry, though closely related, are traditionally represented by two almost disjoint scientific communities. Both fields deal with objects defined by algebraic equations, but the objects are studied in different ways. In 12 chapters written by leading experts, this book presents recent results which rely on the interaction of both fields. Some of these results have been obtained from a major European project in geometric modeling.

In 2006 a special semester on Gr. obner bases and related methods was or- nized by RICAM and RISC, directed by Bruno Buchberger and Heinz Engl. The main focus of the semester were the development of the formal theory of Gr. obner bases (brie?y GB), the e?cient implementation of all algorithms related to this theory, and the promotion of recent and new applications of GB. The workshop D1 "Gr. obner bases in cryptography, coding theory and - gebraic combinatorics", Linz, May 1-6, 2006 (chairmen M. Klin, L. Perret, M. Sala) was one of the main ingredients of the semester. The last two days of this workshop, devoted to combinatorics, made it possible to bring together experts in algorithmic problems related to coherent con?gurations and as- ciation schemes with a community of people working in the area of GB. Each side was interested in understanding the computational problems and current algorithmicpossibilitiesoftheother,withaparticularobjectiveofintroducing the practical use of GB in algebraic combinatorics. Materials (mainly slides of lectures and posters) available from the site http://www.ricam.oeaw.ac.at/specsem/srs/groeb/schedule D1.htmlprovidea helpful and vivid picture of the successful exchange of scienti? c information during the workshop D1. Asafollow-uptothespecialsemester,10volumesofproceedingsarebeing published by di?erent publishers. The current collection of papers re?ects diverse investigations in the area of algebraic combinatorics (with or without explicit use of GB), but with a de?nite emphasis on algorithmic approaches.

In this new text, designed for sophomores studying mathematics and computer science, the authors cover the basics of difference equations and some of their applications in computing and in population biology. Each chapter leads to techniques that can be applied by hand to small examples or programmed for larger problems. Along the way, the reader will use linear algebra and graph theory, develop formal power series, solve combinatorial problems, visit Perron-Frobenius theory, discuss pseudorandom number generation and integer factorization, and apply the Fast Fourier Transform to multiply polynomials quickly. The book contains many worked examples and over 250 exercises. While these exercises are accessible to students and have been class-tested, they also suggest further problems and possible research topics.

The concept of Wiener chaos generalizes to an infinite-dimensional setting the properties of orthogonal polynomials associated with probability distributions on the real line. It plays a crucial role in modern probability theory, with applications ranging from Malliavin calculus to stochastic differential equations and from probabilistic approximations to mathematical finance. This book is concerned with combinatorial structures arising from the study of chaotic random variables related to infinitely divisible random measures. The combinatorial structures involved are those of partitions of finite sets, over which Moebius functions and related inversion formulae are defined. This combinatorial standpoint (which is originally due to Rota and Wallstrom) provides an ideal framework for diagrams, which are graphical devices used to compute moments and cumulants of random variables. Several applications are described, in particular, recent limit theorems for chaotic random variables. An Appendix presents a computer implementation in MATHEMATICA for many of the formulae.

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. Topological combinatorics is concerned with solutions to combinatorial problems by applying topological tools. In most cases these solutions are very elegant and the connection between combinatorics and topology often arises as an unexpected surprise. The textbook covers topics such as fair division, graph coloring problems, evasiveness of graph properties, and embedding problems from discrete geometry. The text contains a large number of figures that support the understanding of concepts and proofs. In many cases several alternative proofs for the same result are given, and each chapter ends with a series of exercises. The extensive appendix makes the book completely self-contained. The textbook is well suited for advanced undergraduate or beginning graduate mathematics students. Previous knowledge in topology or graph theory is helpful but not necessary. The text may be used as a basis for a one- or two-semester course as well as a supplementary text for a topology or combinatorics class.

Srinivasa Ramanujan was a mathematician brilliant beyond comparison who inspired many great mathematicians. There is extensive literature available on the work of Ramanujan. But what is missing in the literature is an analysis that would place his mathematics in context and interpret it in terms of modern developments. The 12 lectures by Hardy, delivered in 1936, served this purpose at the time they were given. This book presents Ramanujan's essential mathematical contributions and gives an informal account of some of the major developments that emanated from his work in the 20th and 21st centuries. It contends that his work still has an impact on many different fields of mathematical research. This book examines some of these themes in the landscape of 21st-century mathematics. These essays, based on the lectures given by the authors focus on a subset of Ramanujan's significant papers and show how these papers shaped the course of modern mathematics.

The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to have important applications in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, we are going to collect recent developments on the connected dominating set, which presents the state of the art in the study of connected dominating sets. The book consists of 16 chapters. Except the 1st one, each chapter is devoted to one problem, and consists of three parts, motivation and overview, problem complexity analysis, and approximation algorithm designs, which will lead the reader to see clearly about the background, formulation, existing important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete mathematics.

For the present edition four chapters have been added which form the fourth 1 part at the end of the book . Entitled The triumph of neoliberalism , the new partexplains how theimplementation worldwide oftheneoliberal agenda paved the way for the present crisis. As a matter of fact, the evidence provided in chapter 9 suggests that the present crisis already began to build up in the mid-1970s. It is around 1975 that (real) US wages reached a peak-level they would never regain in f- lowing decades. It was also around 1975 that the number of strikes began to fall sharply. The mid-1970s also marked the beginning of a huge in ow of immigrants (in large part of Hispanic origin) into the United States. The in ated supply of labor depressed wages and this had the consequence that consumption could be increased only by an unprecedented development of credit. Perhaps the reader may think that to blame the prevailing economic system for the unfolding depression is a fairly common and all too easy temptation.

From Combinatorics to Philosophy: The Legacy of G. -C. Rota provides an assessment of G. -C. Rota's legacy to current international research issues in mathematics, philosophy and computer science. This volume includes chapters by leading researchers, as well as a number of invited research papers. Rota's legacy connects European and Italian research communities to the USA by providing inspiration to several generations of researchers in combinatorics, philosophy and computer science. From Combinatorics to Philosophy: The Legacy of G. -C. Rota is of valuable interest to research institutions and university libraries worldwide. This book is also designed for advanced-level students in mathematics, computer science, and philosophy.

For the first two editions of the book Probability (GTM 95), each chapter included a comprehensive and diverse set of relevant exercises. While the work on the third edition was still in progress, it was decided that it would be more appropriate to publish a separate book that would comprise all of the exercises from previous editions, in addition to many new exercises. Most of the material in this book consists of exercises created by Shiryaev, collected and compiled over the course of many years while working on many interesting topics. Many of the exercises resulted from discussions that took place during special seminars for graduate and undergraduate students. Many of the exercises included in the book contain helpful hints and other relevant information. Lastly, the author has included an appendix at the end of the book that contains a summary of the main results, notation and terminology from Probability Theory that are used throughout the present book. This Appendix also contains additional material from Combinatorics, Potential Theory and Markov Chains, which is not covered in the book, but is nevertheless needed for many of the exercises included here.

Matrix-valued data sets - so-called second order tensor fields - have gained significant importance in scientific visualization and image processing due to recent developments such as diffusion tensor imaging. This book is the first edited volume that presents the state of the art in the visualization and processing of tensor fields. It contains some longer chapters dedicated to surveys and tutorials of specific topics, as well as a great deal of original work by leading experts that has not been published before. It serves as an overview for the inquiring scientist, as a basic foundation for developers and practitioners, and as as a textbook for specialized classes and seminars for graduate and doctoral students.

Now the most used texbook for introductory cryptography courses in both mathematics and computer science, the Third Edition builds upon previous editions by offering several new sections, topics, and exercises. The authors present the core principles of modern cryptography, with emphasis on formal definitions, rigorous proofs of security.

In this monograph, new combinatorial and computational approaches in the study of RNA structures are presented which enhance both mathematics and computational biology. It begins with an introductory chapter, which motivates and sets the background of this research. In the following chapter, all the concepts are systematically developed. The reader will find * integration of more than forty research papers covering topics like, RSK-algorithm, reflection principle, singularity analysis and random graph theory * systematic presentation of the theory of pseudo-knotted RNA structures including their generating function, uniform generation as well as central and discrete limit theorems * computational biology of pseudo-knotted RNA structures, including dynamic programming paradigms and a new folding algorithm * analysis of neutral networks of pseudo knotted RNA structures and their random graph theory, including neutral paths, giant components and connectivity All algorithms presented are freely available through springer.com and implemented in C. A proofs section at the end contains the necessary technicalities. This book will serve graduate students and researchers in the fields of discrete mathematics, mathematical and computational biology. It is suitable as a textbook for a graduate course in mathematical and computational biology.

Graphs on Surfaces: Dualities, Polynomials, and Knots offers an accessible and comprehensive treatment of recent developments on generalized duals of graphs on surfaces, and their applications. The authors illustrate the interdependency between duality, medial graphs and knots; how this interdependency is reflected in algebraic invariants of graphs and knots; and how it can be exploited to solve problems in graph and knot theory. Taking a constructive approach, the authors emphasize how generalized duals and related ideas arise by localizing classical constructions, such as geometric duals and Tait graphs, and then removing artificial restrictions in these constructions to obtain full extensions of them to embedded graphs. The authors demonstrate the benefits of these generalizations to embedded graphs in chapters describing their applications to graph polynomials and knots. Graphs on Surfaces: Dualities, Polynomials, and Knots also provides a self-contained introduction to graphs on surfaces, generalized duals, topological graph polynomials, and knot polynomials that is accessible both to graph theorists and to knot theorists. Directed at those with some familiarity with basic graph theory and knot theory, this book is appropriate for graduate students and researchers in either area. Because the area is advancing so rapidly, the authors give a comprehensive overview of the topic and include a robust bibliography, aiming to provide the reader with the necessary foundations to stay abreast of the field. The reader will come away from the text convinced of advantages of considering these higher genus analogues of constructions of plane and abstract graphs, and with a good understanding of how they arise.

The study of combinatorial block designs is a vibrant area of combinatorial mathematics with connections to finite geometries, graph theory, coding theory and statistics. The practice of ordering combinatorial objects can trace its roots to bell ringing which originated in 17th century England, but only emerged as a significant modern research area with the work of F. Gray and N. de Bruijn. These two fascinating areas of mathematics are brought together for the first time in this book. It presents new terminology and concepts which unify existing and recent results from a wide variety of sources. In order to provide a complete introduction and survey, the book begins with background material on combinatorial block designs and combinatorial orderings, including Gray codes -- the most common and well-studied combinatorial ordering concept -- and universal cycles. The central chapter discusses how ordering concepts can be applied to block designs, with definitions from existing (configuration orderings) and new (Gray codes and universal cycles for designs) research. Two chapters are devoted to a survey of results in the field, including illustrative proofs and examples. The book concludes with a discussion of connections to a broad range of applications in computer science, engineering and statistics. This book will appeal to both graduate students and researchers. Each chapter contains worked examples and proofs, complete reference lists, exercises and a list of conjectures and open problems. Practitioners will also find the book appealing for its accessible, self-contained introduction to the mathematics behind the applications.

This book focuses on the two psychological factors of naturalness and ease of viewing of three-dimensional high-definition television (3D HDTV) images. It has been said that distortions peculiar to stereoscopic images, such as the "puppet theater" effect or the "cardboard" effect, spoil the sense of presence. Whereas many earlier studies have focused on geometrical calculations about these distortions, this book instead describes the relationship between the naturalness of reproduced 3D HDTV images and the nonlinearity of depthwise reproduction. The ease of viewing of each scene is regarded as one of the causal factors of visual fatigue. Many of the earlier studies have been concerned with the accurate extraction of local parallax; however, this book describes the typical spatiotemporal distribution of parallax in 3D images. The purpose of the book is to examine the correlations between the psychological factors and amount of characteristics of parallax distribution in order to understand the characteristics of easy- and difficult-to-view images and then to seek to create a new 3D HDTV system that minimizes visual fatigue for the viewer. The book is an important resource for researchers who wish to investigate and better understand various psychological effects caused by stereoscopic images.

In a number of famous works, M. Kac showed that various methods of probability theory can be fruitfully applied to important problems of analysis. The interconnection between probability and analysis also plays a central role in the present book. However, our approach is mainly based on the application of analysis methods (the method of operator identities, integral equations theory, dual systems, integrable equations) to probability theory (Levy processes, M. Kac's problems, the principle of imperceptibility of the boundary, signal theory). The essential part of the book is dedicated to problems of statistical physics (classical and quantum cases). We consider the corresponding statistical problems (Gibbs-type formulas, non-extensive statistical mechanics, Boltzmann equation) from the game point of view (the game between energy and entropy). One chapter is dedicated to the construction of special examples instead of existence theorems (D. Larson's theorem, Ringrose's hypothesis, the Kadison-Singer and Gohberg-Krein questions). We also investigate the Bezoutiant operator. In this context, we do not make the assumption that the Bezoutiant operator is normally solvable, allowing us to investigate the special classes of the entire functions.

This work contains the proceedings of the "Mathematics and Culture" conference held in Venice in March 2002. The conference aims to act as a bridge across the various aspects of human knowledge. While keeping mathematics as its core, it is aimed at anyone endowed with cultural curiosity and interests, whether within or (even more so) outside mathematics. This volume therefore covers music, cinema, art, theatre and literature, with topics ranging from Tibet to comics.

This book is about graph energy. The authors have included many of the important results on graph energy, such as the complete solution to the conjecture on maximal energy of unicyclic graphs, the Wagner-Heuberger's result on the energy of trees, the energy of random graphs or the approach to energy using singular values. It contains an extensive coverage of recent results and a gradual development of topics and the inclusion of complete proofs from most of the important recent results in the area. The latter fact makes it a valuable reference for researchers looking to get into the field of graph energy, further stimulating it with occasional inclusion of open problems. The book provides a comprehensive survey of all results and common proof methods obtained in this field with an extensive reference section. The book is aimed mainly towards mathematicians, both researchers and doctoral students, with interest in the field of mathematical chemistry.

Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes ten new sections and more than 300 new exercises, most with solutions, reflecting numerous new developments since the publication of the first edition in 1986. The author brings the coverage up to date and includes a wide variety of additional applications and examples, as well as updated and expanded chapter bibliographies. Many of the less difficult new exercises have no solutions so that they can more easily be assigned to students. The material on P-partitions has been rearranged and generalized; the treatment of permutation statistics has been greatly enlarged; and there are also new sections on q-analogues of permutations, hyperplane arrangements, the cd-index, promotion and evacuation and differential posets.

The primary intent of the book is to introduce an array of beautiful problems in a variety of subjects quickly, pithily and completely rigorously to graduate students and advanced undergraduates. The book takes a number of specific problems and solves them, the needed tools developed along the way in the context of the particular problems. It treats a melange of topics from combinatorial probability theory, number theory, random graph theory and combinatorics. The problems in this book involve the asymptotic analysis of a discrete construct as some natural parameter of the system tends to infinity. Besides bridging discrete mathematics and mathematical analysis, the book makes a modest attempt at bridging disciplines. The problems were selected with an eye toward accessibility to a wide audience, including advanced undergraduate students. The book could be used for a seminar course in which students present the lectures."