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.

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.

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.

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.

This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.Just as with the first three editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.New to this edition are the Quick Check exercises at the end of each section. In all, the new edition contains about 240 new exercises. Extra examples were added to some sections where readers asked for them.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs, enumeration under group action, generating functions of labeled and unlabeled structures and algorithms and complexity.The book encourages students to learn more combinatorics, provides them with a not only useful but also enjoyable and engaging reading.The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to [email protected] previous edition of this textbook has been adopted at various schools including UCLA, MIT, University of Michigan, and Swarthmore College. It was also translated into Korean.

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.

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.

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.

Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field.

Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance.

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.

This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.Just as with the first two editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs (new to this edition), enumeration under group action (new to this edition), generating functions of labeled and unlabeled structures and algorithms and complexity.As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to [email protected].

In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. "Local Search in Combinatorial Optimization" covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science.

In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Muhlenbein, Carsten Peterson, Bo Soderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Ostergard."

Boolean functions are essential to systems for secure and reliable communication. This comprehensive survey of Boolean functions for cryptography and coding covers the whole domain and all important results, building on the author's influential articles with additional topics and recent results. A useful resource for researchers and graduate students, the book balances detailed discussions of properties and parameters with examples of various types of cryptographic attacks that motivate the consideration of these parameters. It provides all the necessary background on mathematics, cryptography, and coding, and an overview on recent applications, such as side channel attacks on smart cards, cloud computing through fully homomorphic encryption, and local pseudo-random generators. The result is a complete and accessible text on the state of the art in single and multiple output Boolean functions that illustrates the interaction between mathematics, computer science, and telecommunications.

In "The Structure of Affine Buildings," Richard Weiss gives a detailed presentation of the complete proof of the classification of Bruhat-Tits buildings first completed by Jacques Tits in 1986. The book includes numerous results about automorphisms, completions, and residues of these buildings. It also includes tables correlating the results in the locally finite case with the results of Tits's classification of absolutely simple algebraic groups defined over a local field. A companion to Weiss's "The Structure of Spherical Buildings," "The Structure of Affine Buildings" is organized around the classification of spherical buildings and their root data as it is carried out in Tits and Weiss's "Moufang Polygons."

There is a sympathy of ideas among the fields of knot theory, infinite discrete group theory, and the topology of 3-manifolds. This book contains fifteen papers in which new results are proved in all three of these fields. These papers are dedicated to the memory of Ralph H. Fox, one of the world's leading topologists, by colleagues, former students, and friends. In knot theory, papers have been contributed by Goldsmith, Levine, Lomonaco, Perko, Trotter, and Whitten. Of these several are devoted to the study of branched covering spaces over knots and links, while others utilize the braid groups of Artin. Cossey and Smythe, Stallings, and Strasser address themselves to group theory. In his contribution Stallings describes the calculation of the groups In/In+1 where I is the augmentation ideal in a group ring RG. As a consequence, one has for each k an example of a k-generator l-relator group with no free homomorphs. In the third part, papers by Birman, Cappell, Milnor, Montesinos, Papakyriakopoulos, and Shalen comprise the treatment of 3-manifolds. Milnor gives, besides important new results, an exposition of certain aspects of our current knowledge regarding the 3- dimensional Brieskorn manifolds.

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.

Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. This book, which stems from many years' experience of teaching, invites students into the subject and prepares them for more advanced texts. It is suitable as a class text or for individual study. The author provides proofs for many of the theorems to show the range of techniques available, and uses examples to link enumerative combinatorics to other areas of study. The main section of the book introduces the key tools of the subject (generating functions and recurrence relations), which are then used to study the most important combinatorial objects, namely subsets, partitions, and permutations of a set. Later chapters deal with more specialised topics, including permanents, SDRs, group actions and the Redfield-Polya theory of cycle indices, Moebius inversion, the Tutte polynomial, and species.

This book provides a timely overview of fuzzy graph theory, laying the foundation for future applications in a broad range of areas. It introduces readers to fundamental theories, such as Craine's work on fuzzy interval graphs, fuzzy analogs of Marczewski's theorem, and the Gilmore and Hoffman characterization. It also introduces them to the Fulkerson and Gross characterization and Menger's theorem, the applications of which will be discussed in a forthcoming book by the same authors. This book also discusses in detail important concepts such as connectivity, distance and saturation in fuzzy graphs. Thanks to the good balance between the basics of fuzzy graph theory and new findings obtained by the authors, the book offers an excellent reference guide for advanced undergraduate and graduate students in mathematics, engineering and computer science, and an inspiring read for all researchers interested in new developments in fuzzy logic and applied mathematics.

Dieses Lehrbuch vermittelt die Grundlagen und Konzepte der modernen Kombinatorik in anschaulicher Weise. Die verstandliche Darlegung richtet sich an Studierende der Mathematik, der Naturwissenschaften, der Informatik und der Wirtschaftswissenschaften und erlaubt einen einfachen und beispielorientierten Zugang zu den Methoden der Kombinatorik. Beginnend mit den Grundaufgaben der Kombinatorik wird der Leser Schritt fur Schritt mit weiterfuhrenden Themen wie erzeugende Funktionen, Rekurrenzgleichungen und der Moebiusinversion sowie Graphenpolynomen und endlichen Automaten vertraut gemacht. Eine Vielzahl von Beispielen und UEbungsaufgaben mit Loesungen erleichtern das Verstandnis und dienen der Vertiefung und praktischen Anwendung des Lehrstoffes. Die vorliegende dritte Auflage ist komplett durchgesehen und deutlich erweitert um das Thema Kombinatorische Klassen und weitere, auch fur die praktische Anwendung wichtige Graphenpolynome.