Excellent text for upper-level undergraduate and graduate students shows how geometric and algebraic ideas met and grew together into an important branch of mathematics. Lucid coverage of vector fields, surfaces, homology of complexes, much more. Some knowledge of differential equations and multivariate calculus required. Many problems and exercises (some solutions) integrated into the text. 1979 edition. Bibliography.

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.

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.

There is a tradition in Russia that holds that mathematics can be both challenging and fun. One fine outgrowth of that tradition is the magazine, ""Kvant"", which has been enjoyed by many of the best students since its founding in 1970. The articles in ""Kvant"" assume only a minimal background, that of a good high school student, yet are capable of entertaining mathematicians of almost any level. Sometimes the articles require careful thought or a moment's work with a pencil and paper. However, the industrious reader will be generously rewarded by the elegance and beauty of the subjects.This book is the third collection of articles from ""Kvant"" to be published by the AMS. The volume is devoted mainly to combinatorics and discrete mathematics. Several of the topics are well known: nonrepeating sequences, detecting a counterfeit coin, and linear inequalities in economics, but they are discussed here with the entertaining and engaging style typical of the magazine. The two previous collections treat aspects of algebra and analysis, including connections to number theory and other topics. They were published as Volumes 14 and 15 in the ""Mathematical World"" series. The articles are written so as to present genuine mathematics in a conceptual, entertaining, and accessible way. The books are designed to be used by students and teachers who love mathematics and want to study its various aspects, deepening and expanding upon the school curriculum.

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.

When information is transmitted, errors are likely to occur. This problem has become increasingly important as tremendous amounts of information are transferred electronically every day. Coding theory examines efficient ways of packaging data so that these errors can be detected, or even corrected. The traditional tools of coding theory have come from combinatorics and group theory. Since the work of Goppa in the late 1970s, however, coding theorists have added techniques from algebraic geometry to their toolboxes. In particular, by re-interpreting the Reed-Solomon codes as coming from evaluating functions associated to divisors on the projective line, one can see how to define new codes based on other divisors or on other algebraic curves. For instance, using modular curves over finite fields, Tsfasman, Vladut, and Zink showed that one can define a sequence of codes with asymptotically better parameters than any previously known codes. This monograph is based on a series of lectures the author gave as part of the IAS/PCMI programme on arithmetic algebraic geometry. Here, the reader is introduced to the field of algebraic geometric coding theory.

Famous mathematical constants include the ratio of circular circumference to diameter, = 3.14 ..., and the natural logarithm base, e = 2.718 .... Students and professionals can often name a few others, but there are many more buried in the literature and awaiting discovery. How do such constants arise, and why are they important? Here the author renews the search he began in his book Mathematical Constants, adding another 133 essays that broaden the landscape. Topics include the minimality of soap film surfaces, prime numbers, elliptic curves and modular forms, Poisson-Voronoi tessellations, random triangles, Brownian motion, uncertainty inequalities, Prandtl-Blasius flow (from fluid dynamics), Lyapunov exponents, knots and tangles, continued fractions, Galton-Watson trees, electrical capacitance (from potential theory), Zermelo's navigation problem, and the optimal control of a pendulum. Unsolved problems appear virtually everywhere as well. This volume continues an outstanding scholarly attempt to bring together all significant mathematical constants in one place.

This book is a survey on the problem of choosing from a tournament. It brings together under a unified and self-contained presentation results and concepts from Graph Theory, Choice Theory, Decision Science and Social Choice which were discovered in the last ten years. Classical scoring and ranking methods are introduced, including the Slater orderings, as well as new statistical methods for describing a tournament, graph-theoretical methods based on the covering relation and game-theoretical methods. As an illustration, results are applied to the classical problem of Majority Voting: How to deal with the Condorcet Paradox.

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.

Free probability theory is a highly noncommutative probability theory, with independence based on free products instead of tensor products. The theory models random matrices in the large $N$ limit and operator algebra free products. It has led to a surge of new results on the von Neumann algebras of free groups. This is a volume of papers from a workshop on Random Matrices and Operator Algebra Free Products, held at The Fields Institute for Research in the Mathematical Sciences in March 1995. Over the last few years, there has been much progress on the operator algebra and noncommutative probability sides of the subject. New links with the physics of masterfields and the combinatorics of noncrossing partitions have emerged. Moreover there is a growing free entropy theory. The idea of this workshop was to bring together people working in all these directions and from an even broader free products area where future developments might lead.

This book grew out of the fourth Special Year at DIMACS, which was devoted to the subject of combinatorial optimization. During the special year, a number of workshops, small and large, dealt with various aspects of this theme. Organizers of the workshops and selected participants were asked to write surveys about the hottest results and ideas in their fields. Therefore, this book is not a set of conference proceedings but rather a carefully refereed collection of invited survey articles written by outstanding researchers. Aimed at researchers in discrete mathematics, operations research, and the theory of computing, this book offers an in-depth look at many topics not treated in textbooks.

Combinatorics on words has arisen independently within several branches of mathematics, for instance, number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's Combinatorics on Words. Since its publication, the area has developed and the authors now aim to present several more topics as well as giving deeper insights into subjects that were discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area. This book is both a comprehensive introduction to the subject and a valuable reference source for researchers.

This book, the first volume in the ""DIMACS"" book series, contains the proceedings of the first DIMACS workshop. The workshop, which was held in June 1989 in Morristown, New Jersey, focused on polyhedral combinatorics. Two series of lectures were presented by L. Lovasz and A. Schrijver and there were a number of shorter lectures. The topics covered include multicommodity flows, graph matchings and colorings, the traveling salesman problem, integer programming, and complexity theory. Aimed at researchers in combinatorics and combinatorial optimization, this book will provide readers with an overview of recent advances in combinatorial optimization.

The solutions to each problem are written from a first principles approach, which would further augment the understanding of the important and recurring concepts in each chapter. Moreover, the solutions are written in a relatively self-contained manner, with very little knowledge of undergraduate mathematics assumed. In that regard, the solutions manual appeals to a wide range of readers, from secondary school and junior college students, undergraduates, to teachers and professors.

Dieses Buch richtet sich an Studierende verschiedener Fachrichtungen, die das Softwarepaket Octave als kostenfreien und praktischen Lernassistenten nutzen moechten. Es stellt dar, wie sich Octave zur Loesung mathematischer Probleme aus technischen und ingenieurwissenschaftlichen Anwendungen einsetzen lasst. Nebenbei koennen mit diesem Buch elementare Programmierkenntnisse erlernt oder aufgefrischt werden. Da Octave Parallelen zu dem kostenpflichtigen, haufig auf Rechnerarbeitsplatzen in Hochschulen und forschungsorientierten Einrichtungen installierten Softwarepaket MATLAB aufweist, lassen sich die in diesem Buch besprochenen Inhalte und Methoden bequem in die Hochschule und daruber hinaus in die spatere Berufspraxis ubertragen. Das Buch eignet sich damit auch fur Anwender, die in ihrem Berufsleben mathematische Probleme mit Octave oder MATLAB zu loesen haben. Behandelt werden die wichtigsten Grundlagen und Methoden von Octave: elementare Rechnungen mit reellen und komplexen Zahlen, die besonders wichtige Arbeit mit Matrizen und Vektoren, die Arbeit mit Zeichenketten, die Loesung von linearen Gleichungssystemen, die Erstellung von Grafiken mit und ohne animierten Inhalten, die Nutzung und die eigene Programmierung von Octave-Skripten und Octave-Funktionen. Lernenden wird an ausgewahlten Beispielen aus den Bereichen Lineare Algebra, Analysis und numerische Mathematik erlautert, wie Octave zur UEberprufung und Korrektur von Rechenergebnissen bzw. Rechenwegen sowie zum Verstehen und Entdecken von mathematischen Sachverhalten eingesetzt werden kann. Ausserdem werden die Loesung linearer und nichtlinearer Optimierungsprobleme, die Approximation von Daten und Funktionen (Methode der kleinsten Quadrate, Interpolation mit Polynomen und Splines), die Loesung nichtlinearer Gleichungssysteme sowie ausgewahlte Grundlagen der beschreibenden Statistik und Wahrscheinlichkeitsrechnung behandelt. UEbungsaufgaben laden zum Mitmachen ein und helfen, die besprochenen Inhalte zu verstehen, anzuwenden und auf die Aufgaben und Probleme aus den eigenen Mathematikvorlesungen zu ubertragen. Zu jeder Aufgabe gibt es mehr oder weniger ausfuhrliche Musterloesungen. Zusatzmaterialien zum Download erganzen das Buch, wobei die enthaltenen Skripte und Funktionen von den Lesern als Ausgangspunkt fur eigene Programmiertatigkeiten genutzt werden koennen und sollen.

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.

Wie sieht eine Kurve aus, die die ganze Ebene oder den Raum vollstandig ausfullt? Kann man einen Polyeder flexibel bewegen, ja sogar umstulpen? Was ist die projektive Ebene oder der vierdimensionale Raum? Gibt es Seifenblasen, die keine runden Kugel sind? Wie kann man die komplizierte Struktur von Stroemungen besser verstehen? In diesem Buch erleben Sie die Mathematik von ihrer anschaulichen Seite und finden faszinierende und bisher nie gesehene Bilder, die Ihnen illustrative Antworten zu all diesen Fragestellungen geben. Zu allen Bildern gibt es kurze Erklarungstexte, viele Literaturhinweise und jede Menge Web-Links. Das Buch ist fur alle Freunde der Mathematik, die nicht nur trockenen Text und endlose Formeln sehen wollen. Vom Schuler zum Lehrer, vom Studenten zum Professor. Es soll sie alle inspirieren und anregen, sich mit diesem oder jenem vermeintlich nur Insidern vorbehaltenem Thema zu beschaftigen. Lernen Sie die Mathematik von einer ganz neuen und bunten Seite kennen. Die Neuauflage ist vollstandig durchgesehen und um acht Doppelseiten mit neuen und spektakularen Bildern erganzt.

One of the traditional ways mathematical ideas and even new areas of mathematics are created is from experiments. One of the best-known examples is that of the Fermat hypothesis, which was conjectured by Fermat in his attempts to find integer solutions for the famous Fermat equation. This hypothesis led to the creation of a whole field of knowledge, but it was proved only after several hundred years. This book, based on the author's lectures, presents several new directions of mathematical research. All of these directions are based on numerical experiments conducted by the author, which led to new hypotheses that currently remain open, i.e., are neither proved nor disproved. The hypotheses range from geometry and topology (statistics of plane curves and smooth functions) to combinatorics (combinatorial complexity and random permutations) to algebra and number theory (continuous fractions and Galois groups). For each subject, the author describes the problem and presents numerical results that led him to a particular conjecture. In the majority of cases there is an indication of how the readers can approach the formulated conjectures (at least by conducting more numerical experiments). Written in Arnold's unique style, the book is intended for a wide range of mathematicians, from high school students interested in exploring unusual areas of mathematics on their own, to college and graduate students, to researchers interested in gaining a new, somewhat nontraditional perspective on doing mathematics. In the interest of fostering a greater awareness and appreciation of mathematics and its connections to other disciplines and everyday life, MSRI and the AMS are publishing books in the Mathematical Circles Library series as a service to young people, their parents and teachers, and the mathematics profession.

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.

Completely updated and containing two new chapters, this title covers spatial analysis and urban management using graph theory simulation.? Highly practical, the simulation approach allows readers to solve classic problems such as placement of high-speed roads, the capacity of a network, pollution emission control, and more.

Emphasizes a Problem Solving Approach
A first course in combinatorics

Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics.

New to the Second Edition
This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet 's pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises.

Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and P lya 's counting theorem.

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.

Wick ordering of creation and annihilation operators is of fundamental importance for computing averages and correlations in quantum field theory and, by extension, in the Hudson-Parthasarathy theory of quantum stochastic processes, quantum mechanics, stochastic processes, and probability. This book develops the unified combinatorial framework behind these examples, starting with the simplest mathematically, and working up to the Fock space setting for quantum fields. Emphasizing ideas from combinatorics such as the role of lattice of partitions for multiple stochastic integrals by Wallstrom-Rota and combinatorial species by Joyal, it presents insights coming from quantum probability. It also introduces a 'field calculus' which acts as a succinct alternative to standard Feynman diagrams and formulates quantum field theory (cumulant moments, Dyson-Schwinger equation, tree expansions, 1-particle irreducibility) in this language. Featuring many worked examples, the book is aimed at mathematical physicists, quantum field theorists, and probabilists, including graduate and advanced undergraduate students.

This volume contains nine survey articles which provide expanded accounts of plenary seminars given at the British Combinatorial Conference at the University of Strathclyde in July 2017. This biennial conference is a well-established international event attracting speakers from around the world. Written by internationally recognised experts in the field, these articles represent a timely snapshot of the state of the art in the different areas of combinatorics. Topics covered include the robustness of graph properties, the spt-function of Andrews, switching techniques for edge decompositions of graphs, monotone cellular automata, and applications of relative entropy in additive combinatorics. The book will be useful to researchers and advanced graduate students, primarily in mathematics but also in computer science and statistics.

Ramsey theory is a fast-growing area of combinatorics with deep connections to other fields of mathematics such as topological dynamics, ergodic theory, mathematical logic, and algebra. The area of Ramsey theory dealing with Ramsey-type phenomena in higher dimensions is particularly useful. "Introduction to Ramsey Spaces" presents in a systematic way a method for building higher-dimensional Ramsey spaces from basic one-dimensional principles. It is the first book-length treatment of this area of Ramsey theory, and emphasizes applications for related and surrounding fields of mathematics, such as set theory, combinatorics, real and functional analysis, and topology. In order to facilitate accessibility, the book gives the method in its axiomatic form with examples that cover many important parts of Ramsey theory both finite and infinite.

An exciting new direction for combinatorics, this book will interest graduate students and researchers working in mathematical subdisciplines requiring the mastery and practice of high-dimensional Ramsey theory.