A CHOICE "Outstanding Academic Title," the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, third edition continues to clearly show the usefulness of this subject for both students and researchers. The research in combinatorics of permutations has advanced rapidly since this book was published in a first edition. Now the third edition offers not only updated results, it remains the leading textbook for a course on the topic. Coverage is mostly enumerative, but there are algebraic, analytic, and topological parts as well, and applications. Since the publication of the second edition, there is tremendous progress in pattern avoidance (Chapters 4 and 5). There is also significant progress in the analytic combinatorics of permutations, which will be incorporated. *A completely new technique from extremal combinatorics disproved a long-standing conjecture, and this is presented in Chapter 4. *The area of universal permutations has undergone a lot of very recent progress, and that has been noticed outside the academic community as well. This also influenced the revision of Chapter 5. *New results in stack sorting are added to Chapter 8. *Chapter 9 applications to biology has been revised. The author's other works include Introduction to Enumerative and Analytic Combinatorics, second edition (CHOICE "Outstanding Academic Title") and Handbook of Enumerative Combinatorics, published by CRC Press. The author also serves as Series Editor for CRC's Discrete Mathematics and Its Applications.

The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers with a wide range of backgrounds including Mathematics, Computer Science/Computer Applications and Operational Research. While dealing with theorems and algorithms, emphasis is laid on constructions which consist of formal proofs, examples with applications. Uptill, there is scarcity of books in the open literature which cover all the things including most importantly various algorithms and applications with examples.

Algebraic logic is a subject in the interface between logic, algebra and geometry, it has strong connections with category theory and combinatorics. Tarski's quest for finding structure in logic leads to cylindric-like algebras as studied in this book, they are among the main players in Tarskian algebraic logic. Cylindric algebra theory can be viewed in many ways: as an algebraic form of definability theory, as a study of higher-dimensional relations, as an enrichment of Boolean Algebra theory, or, as logic in geometric form ("cylindric" in the name refers to geometric aspects). Cylindric-like algebras have a wide range of applications, in, e.g., natural language theory, data-base theory, stochastics, and even in relativity theory. The present volume, consisting of 18 survey papers, intends to give an overview of the main achievements and new research directions in the past 30 years, since the publication of the Henkin-Monk-Tarski monographs. It is dedicated to the memory of Leon Henkin.

This volume collects recent results in supply chain optimisation. It presents new approaches and methods based on operations research, artificial intelligence and advanced computing techniques for design of production systems, supply and inventory management, production planning and scheduling, location, transportation and logistics, and simulation in supply flow optimisation. The text presents a wide spectrum of optimisation problems taking into account supply chain paradigms, which are pivotal to improving productivity.

A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di?cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and H. S. White (1917) [129] The history of classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work - on various objects, including (what became later known as) Steiner triple systems - led to several classi?cation results. Almost a century earlier, in 1782, Euler [180] published some results on classifying small Latin squares, but for the ?rst few steps in this direction one should actually go at least as far back as ancient Greece and the proof that there are exactly ?ve Platonic solids. One of the most remarkable achievements in the early, pre-computer era is the classi?cation of the Steiner triple systems of order 15, quoted above. An onerous task that, today, no sensible person would attempt by hand calcu- tion. Because, with the exception of occasional parameters for which com- natorial arguments are e?ective (often to prove nonexistence or uniqueness), classi?cation in general is about algorithms and computation.

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.

This volume contains nine survey articles based on the invited lectures given at the 24th British Combinatorial Conference, held at Royal Holloway, University of London in July 2013. This biennial conference is a well-established international event, with speakers from around the world. The volume provides an up-to-date overview of current research in several areas of combinatorics, including graph theory, matroid theory and automatic counting, as well as connections to coding theory and Bent functions. Each article is clearly written and assumes little prior knowledge on the part of the reader. The authors are some of the world's foremost researchers in their fields, and here they summarise existing results and give a unique preview of cutting-edge developments. The book provides a valuable survey of the present state of knowledge in combinatorics, and will be useful to researchers and advanced graduate students, primarily in mathematics but also in computer science and statistics.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

The 400-year-old Kepler conjecture asserts that no packing of congruent balls in three dimensions can have a density exceeding the familiar pyramid-shaped cannonball arrangement. In this book, a new proof of the conjecture is presented that makes it accessible for the first time to a broad mathematical audience. The book also presents solutions to other previously unresolved conjectures in discrete geometry, including the strong dodecahedral conjecture on the smallest surface area of a Voronoi cell in a sphere packing. This book is also currently being used as a blueprint for a large-scale formal proof project, which aims to check every logical inference of the proof of the Kepler conjecture by computer. This is an indispensable resource for those who want to be brought up to date with research on the Kepler conjecture.

This book results from a long-term research effort aimed at tackling complex non-standard packing issues which arise in space engineering. The main research objective is to optimize cargo loading and arrangement, in compliance with a set of stringent rules. Complicated geometrical aspects are also taken into account, in addition to balancing conditions based on attitude control specifications.

Chapter 1 introduces the class of non-standard packing problems studied. Chapter 2 gives a detailed explanation of a general model for the orthogonal packing of tetris-like items in a convex domain. A number of additional conditions are looked at in depth, including the prefixed orientation of subsets of items, the presence of unusable holes, separation planes and structural elements, relative distance bounds as well as static and dynamic balancing requirements. The relative feasibility sub-problem which is a special case that does not have an optimization criterion is discussed in Chapter 3. This setting can be exploited by introducing an ad hoc objective function, aimed at facilitating the finding of integer-feasible solutions. The third chapter also discusses the issue of tightening the general MIP model by introducing valid inequalities. A MIP-based heuristic approach is developed in Chapter 4, where the basic concept of abstract configuration is presented. Chapter 5 is devoted to experimental results relevant to a real-world application framework. Chapter 6 adopts both extensions of the general MIP model and non-linear formulations to tackle two further non-standard packing issues. The final Chapter 7 presents conclusions and provides insights regarding prospective developments (including non-standard scheduling aspects).

Practitioners and researchers interested in advanced optimization model development and solution in the context of logistics, transportation systems, complex structures, manufacturing and electronics will find this book useful. The book can also be used in graduate courses on nonlinear - including global and mixed integer - optimization, as a valuable collection of practically meaningful object packing applications.

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.

Matroid theory is a vibrant area of research that provides a unified way to understand graph theory, linear algebra and combinatorics via finite geometry. This book provides the first comprehensive introduction to the field which will appeal to undergraduate students and to any mathematician interested in the geometric approach to matroids. Written in a friendly, fun-to-read style and developed from the authors' own undergraduate courses, the book is ideal for students. Beginning with a basic introduction to matroids, the book quickly familiarizes the reader with the breadth of the subject, and specific examples are used to illustrate the theory and to help students see matroids as more than just generalizations of graphs. Over 300 exercises are included, with many hints and solutions so students can test their understanding of the materials covered. The authors have also included several projects and open-ended research problems for independent study.

Partitions, q-Series, and Modular Forms contains a collection of research and survey papers that grew out of a Conference on Partitions, q-Series and Modular Forms at the University of Florida, Gainesville in March 2008. It will be of interest to researchers and graduate students that would like to learn of recent developments in the theory of q-series and modular and how it relates to number theory, combinatorics and special functions.

This innovative textbook introduces a new pattern-based approach to learning proof methods in the mathematical sciences. Readers will discover techniques that will enable them to learn new proofs across different areas of pure mathematics with ease. The patterns in proofs from diverse fields such as algebra, analysis, topology and number theory are explored. Specific topics examined include game theory, combinatorics and Euclidean geometry, enabling a broad familiarity. The author, an experienced lecturer and researcher renowned for his innovative view and intuitive style, illuminates a wide range of techniques and examples from duplicating the cube to triangulating polygons to the infinitude of primes to the fundamental theorem of algebra. Intended as a companion for undergraduate students, this text is an essential addition to every aspiring mathematician's toolkit.

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.