This is the first book that focuses entirely on the fundamental questions in visualization. Unlike other existing books in the field, it contains discussions that go far beyond individual visual representations and individual visualization algorithms. It offers a collection of investigative discourses that probe these questions from different perspectives, including concepts that help frame these questions and their potential answers, mathematical methods that underpin the scientific reasoning of these questions, empirical methods that facilitate the validation and falsification of potential answers, and case studies that stimulate hypotheses about potential answers while providing practical evidence for such hypotheses. Readers are not instructed to follow a specific theory, but their attention is brought to a broad range of schools of thoughts and different ways of investigating fundamental questions. As such, the book represents the by now most significant collective effort for gathering a large collection of discourses on the foundation of data visualization. Data visualization is a relatively young scientific discipline. Over the last three decades, a large collection of computer-supported visualization techniques have been developed, and the merits and benefits of using these techniques have been evidenced by numerous applications in practice. These technical advancements have given rise to the scientific curiosity about some fundamental questions such as why and how visualization works, when it is useful or effective and when it is not, what are the primary factors affecting its usefulness and effectiveness, and so on. This book signifies timely and exciting opportunities to answer such fundamental questions by building on the wealth of knowledge and experience accumulated in developing and deploying visualization technology in practice.

A Path to Combinatorics for Undergraduates is a lively introduction not only to combinatorics, but also to mathematical ingenuity, rigor, and the joy of solving puzzles. This unique approach to combinatorics is centered around unconventional, essay-type combinatorial examples, followed by a number of carefully selected, challenging problems and extensive discussions of their solutions. Topics encompass permutations and combinations, binomial coefficients and their applications, bijections, inclusions and exclusions, and generating functions. Each chapter features fully-worked problems, including many from Olympiads and other competitions, as well as a number of problems original to the authors; at the end of each chapter are further exercises to reinforce understanding, encourage creativity, and build a repertory of problem-solving techniques.

The authors' previous text, 102 Combinatorial Problems, makes a fine companion volume to the present work, which is ideal for Olympiad participants and coaches, advanced high school students, undergraduates, and college instructors. The book's unusual problems and examples will interest seasoned mathematicians as well.

This work offers a contribution in the geometric form of the theory of several complex variables. Since complex Grassmann manifolds serve as classifying spaces of complex vector bundles, the cohomology structure of a complex Grassmann manifold is of importance for the construction of Chern classes of complex vector bundles. The cohomology ring of a Grassmannian is therefore of interest in topology, differential geometry, algebraic geometry, and complex analysis. Wilhelm Stoll treats certain aspects of the complex analysis point of view. This work originated with questions in value distribution theory. Here analytic sets and differential forms rather than the corresponding homology and cohomology classes are considered. On the Grassmann manifold, the cohomology ring is isomorphic to the ring of differential forms invariant under the unitary group, and each cohomology class is determined by a family of analytic sets.

This book arose from the Euroconference "Algebraic Combinatorics and Applications" held in Gössweinstein, Germany, in September 1999, where both senior and young researchers in pure mathematics, applied mathematics, computer science, physics, and chemistry from different European countries met. The main theme of the conference was group actions in various areas, a wide spectrum of which is presented in these proceedings. This volume will be a useful tool for researchers and graduate students in discrete mathematics and theoretical computer science.

The four-colour theorem is one of the famous problems of mathematics, that frustrated generations of mathematicians from its birth in 1852 to its solution (using substantial assistance from electronic computers) in 1976. The theorem asks whether four colours are sufficient to colour all conceivable maps, in such a way that countries with a common border are coloured with different colours.

The book discusses various attempts to solve this problem, and some of the mathematics which developed out of these attempts. Much of this mathematics has developed a life of its own, and forms a fascinating part of the subject now known as graph theory. The book is designed to be self-contained, and develops all the graph-theoretical tools needed as it goes along. It includes all the elementary graph theory that should be included in an introduction to the subject, before concentrating on specific topics relevant to the four-colour problem.

Appropriate for one- or two-semester, junior- to senior-level combinatorics courses. This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price. Please visit www.pearsonhighered.com/math-classics-series for a complete list of titles. This trusted best-seller covers the key combinatorial ideas-including the pigeon-hole principle, counting techniques, permutations and combinations, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (matchings, designs, graphs), and flows in networks. The 5th Edition incorporates feedback from users to the exposition throughout and adds a wealth of new exercises.

This book is intended as a teacher's manual and as an independent-study handbook for students and mathematical competitors. Based on a traditional teaching philosophy and a non-traditional writing approach (the stair-step method), this book consists of new problems with solutions created by the authors. The main idea of this approach is to start from relatively easy problems and "step-by-step" increase the level of difficulty toward effectively maximizing students' learning potential. In addition to providing solutions, a separate table of answers is also given at the end of the book. A broad view of mathematics is covered, well beyond the typical elementary level, by providing more in depth treatment of Geometry and Trigonometry, Number Theory, Algebra, Calculus, and Combinatorics.

Among the simplest combinatorial designs, triple systems are a natural generalization of graphs and have connections with geometry, algebra, group theory, finite fields, and cyclotomy. Applications of triple systems are found in coding theory, cryptography, computer science, and statistics. In many cases, triple systems provide the prototype for deep results in combinatorial design theory, and a number of important results were first understood in the context of triple systems and then generalized. This book attempts to survey current knowledge on the subject, to gather together common themes, and to provide an accurate portrait of the huge variety of problems and results. It includes representative samples of the major styles of proof technique and a comprehensive bibliography.

This book, now in a thoroughly revised second edition, provides a comprehensive and accessible introduction to modern set theory. Following an overview of basic notions in combinatorics and first-order logic, the author outlines the main topics of classical set theory in the second part, including Ramsey theory and the axiom of choice. The revised edition contains new permutation models and recent results in set theory without the axiom of choice. The third part explains the sophisticated technique of forcing in great detail, now including a separate chapter on Suslin's problem. The technique is used to show that certain statements are neither provable nor disprovable from the axioms of set theory. In the final part, some topics of classical set theory are revisited and further developed in light of forcing, with new chapters on Sacks Forcing and Shelah's astonishing construction of a model with finitely many Ramsey ultrafilters. Written for graduate students in axiomatic set theory, Combinatorial Set Theory will appeal to all researchers interested in the foundations of mathematics. With extensive reference lists and historical remarks at the end of each chapter, this book is suitable for self-study.

The second edition of this undergraduate textbook is now available in paperback. Covering up-to-date as well as established material, it is the only textbook which deals with all the main areas of number theory, taught in the third year of a mathematics course. Each chapter ends with a collection of problems, and hints and sketch solutions are provided at the end of the book, together with useful tables.

Diagram geometry provides a range of techniques that enable an interaction between group theory and geometry. These techniques allow the mathematician to get information on a multi-dimensional geometric object from some knowledge of its bi-dimensional properties. This book introduces these techniques and provides a survey of the development of the subject of diagram geometry. The first three chapters are descriptive; a number of examples are presented, basic concepts are explained, and the reader is introduced to the language of diagram geometries. The theory is developed in the next three chapters and in chapter 7 a number of characterizations are proved. This is continued in later chapters following a survey of more advanced concepts and techniques.

In China, lots of excellent students who are good at maths takes an active part in various maths contests and the best six senior high school students will be selected to form the IMO National Team to compete in the International Mathematical Olympiad. In the past ten years China's IMO Team has achieved outstanding results - they have won the first place almost every year.The author is one of the coaches of China's IMO National Team, whose students have won many gold medals many times in IMO.This book is part of the Mathematical Olympiad Series which discusses several aspects related to maths contests, such as algebra, number theory, combinatorics, graph theory and geometry. The book elaborates on methods of discrete extremization, such as inequality control, repeated extremum, partial adjustment, exploiting symmetry, polishing transform, space estimates, etc.

The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry.

This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum networks, networked economics, biological synchronization, and social networks. Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems.

The book's three sections look at foundations, multiagent networks, and networks as systems. The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol and its various extensions, including the behavior of the protocol over undirected, directed, switching, and random networks. They cover topics such as formation control, coverage, distributed estimation, social networks, and games over networks. And they explore intriguing aspects of viewing networks as systems, by making these networks amenable to control-theoretic analysis and automatic synthesis, by monitoring their dynamic evolution, and by examining higher-order interaction models in terms of simplicial complexes and their applications.

The book will interest graduate students working in systems and control, as well as in computer science and robotics. It will be a standard reference for researchers seeking a self-contained account of system-theoretic aspects of multiagent networks and their wide-ranging applications.

This book has been adopted as a textbook at the following universities: University of Stuttgart, Germany Royal Institute of Technology, Sweden Johannes Kepler University, Austria Georgia Tech, USA University of Washington, USA Ohio University, USA

The goal of this monograph is to develop Hopf theory in a new setting which features centrally a real hyperplane arrangement. The new theory is parallel to the classical theory of connected Hopf algebras, and relates to it when specialized to the braid arrangement. Joyal's theory of combinatorial species, ideas from Tits' theory of buildings, and Rota's work on incidence algebras inspire and find a common expression in this theory. The authors introduce notions of monoid, comonoid, bimonoid, and Lie monoid relative to a fixed hyperplane arrangement. They also construct universal bimonoids by using generalizations of the classical notions of shuffle and quasishuffle, and establish the Borel-Hopf, Poincare-Birkhoff-Witt, and Cartier-Milnor-Moore theorems in this setting. This monograph opens a vast new area of research. It will be of interest to students and researchers working in the areas of hyperplane arrangements, semigroup theory, Hopf algebras, algebraic Lie theory, operads, and category theory.

This book gives a new foundation for the theory of links in 3-space modeled on the modern developmentby Jaco, Shalen, Johannson, Thurston et al. of the theory of 3-manifolds. The basic construction is a method of obtaining any link by "splicing" links of the simplest kinds, namely those whose exteriors are Seifert fibered or hyperbolic. This approach to link theory is particularly attractive since most invariants of links are additive under splicing. Specially distinguished from this viewpoint is the class of links, none of whose splice components is hyperbolic. It includes all links constructed by cabling and connected sums, in particular all links of singularities of complex plane curves. One of the main contributions of this monograph is the calculation of invariants of these classes of links, such as the Alexander polynomials, monodromy, and Seifert forms.

Providing a self-contained resource for upper undergraduate courses in combinatorics, this text emphasizes computation, problem solving, and proof technique. In particular, the book places special emphasis the Principle of Inclusion and Exclusion and the Multiplication Principle. To this end, exercise sets are included at the end of every section, ranging from simple computations (evaluate a formula for a given set of values) to more advanced proofs. The exercises are designed to test students' understanding of new material, while reinforcing a working mastery of the key concepts previously developed in the book. Intuitive descriptions for many abstract techniques are included. Students often struggle with certain topics, such as generating functions, and this intuitive approach to the problem is helpful in their understanding. When possible, the book introduces concepts using combinatorial methods (as opposed to induction or algebra) to prove identities. Students are also asked to prove identities using combinatorial methods as part of their exercises. These methods have several advantages over induction or algebra.

This book introduces combinatorial analysis to the beginning student. The author begins with the theory of permutation and combinations and their applications to generating functions. In subsequent chapters, he presents Bell polynomials; the principle of inclusion and exclusion; the enumeration of permutations in cyclic representation; the theory of distributions; partitions, compositions, trees and linear graphs; and the enumeration of restricted permutations.

Originally published in 1980.

The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These paperback editions preserve the original texts of these important books while presenting them in durable paperback editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

This much-awaited new edition of Biggs' best-selling text includes new chapters on statements and proof, logical framework, and natural numbers and the integers, in addition to updated chapters, over 1000 tailored exercises and an accompanying website containing hints and solutions to all exercises. The text is designed explicitly for mathematicians and computer scientists seeking a first approach to this important topic.

Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is Laszlo Lovasz, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovasz's 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers.

Simplicial Global Optimization is centered on deterministic covering methods partitioning feasible region by simplices. This book looks into the advantages of simplicial partitioning in global optimization through applications where the search space may be significantly reduced while taking into account symmetries of the objective function by setting linear inequality constraints that are managed by initial partitioning. The authors provide an extensive experimental investigation and illustrates the impact of various bounds, types of subdivision, strategies of candidate selection on the performance of algorithms. A comparison of various Lipschitz bounds over simplices and an extension of Lipschitz global optimization with-out the Lipschitz constant to the case of simplicial partitioning is also depicted in this text. Applications benefiting from simplicial partitioning are examined in detail such as nonlinear least squares regression and pile placement optimization in grillage-type foundations. Researchers and engineers will benefit from simplicial partitioning algorithms such as Lipschitz branch and bound, Lipschitz optimization without the Lipschitz constant, heuristic partitioning presented. This book will leave readers inspired to develop simplicial versions of other algorithms for global optimization and even use other non-rectangular partitions for special applications.

Additive combinatorics is the theory of counting additive structures in sets. This theory has seen exciting developments and dramatic changes in direction in recent years thanks to its connections with areas such as number theory, ergodic theory and graph theory. This graduate-level 2006 text will allow students and researchers easy entry into this fascinating field. Here, the authors bring together in a self-contained and systematic manner the many different tools and ideas that are used in the modern theory, presenting them in an accessible, coherent, and intuitively clear manner, and providing immediate applications to problems in additive combinatorics. The power of these tools is well demonstrated in the presentation of recent advances such as Szemeredi's theorem on arithmetic progressions, the Kakeya conjecture and Erdos distance problems, and the developing field of sum-product estimates. The text is supplemented by a large number of exercises and new results.