Elementary text, accessible to anyone with a background in high school geometry, covers problems inherent to coloring maps, homeomorphism, applications of Descartes' theorem, topological polygons, more. Includes 108 figures. 1967 edition.

An elementary text that can be understood by anyone with a background in high school geometry, Invitation to Combinatorial Topology offers a stimulating initiation to important topological ideas. This translation from the original French does full justice to the text's coherent presentation as well as to its rich historical content. Subjects include the problems inherent to coloring maps, homeomorphism, applications of Descartes' theorem, and topological polygons. Considerations of the topological classification of closed surfaces cover elementary operations, use of normal forms of polyhedra, reduction to normal form, and application to the geometric theory of functions. 1967 edition. 108 figures. Bibliography. Index.

This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. The four-part treatment begins with a section on counting and listing that covers basic counting, functions, decision trees, and sieving methods. The following section addresses fundamental concepts in graph theory and a sampler of graph topics. The third part examines a variety of applications relevant to computer science and mathematics, including induction and recursion, sorting theory, and rooted plane trees. The final section, on generating functions, offers students a powerful tool for studying counting problems. Numerous exercises appear throughout the text, along with notes and references. The text concludes with solutions to odd-numbered exercises and to all appendix exercises.

A conversational introduction to combinatorics for upper undergraduates, emphasizing problem solving and active student participation.

Combinatorial reciprocity is a very interesting phenomenon, which can be described as follows: A polynomial, whose values at positive integers count combinatorial objects of some sort, may give the number of combinatorial objects of a different sort when evaluated at negative integers (and suitably normalized). Such combinatorial reciprocity theorems occur in connections with graphs, partially ordered sets, polyhedra, and more. Using the combinatorial reciprocity theorems as a leitmotif, this book unfolds central ideas and techniques in enumerative and geometric combinatorics. Written in a friendly writing style, this is an accessible graduate textbook with almost 300 exercises, numerous illustrations, and pointers to the research literature. Topics include concise introductions to partially ordered sets, polyhedral geometry, and rational generating functions, followed by highly original chapters on subdivisions, geometric realizations of partially ordered sets, and hyperplane arrangements.

Topology is a relatively young and very important branch of mathematics, which studies the properties of objects that are preserved through deformations, twistings, and stretchings. This book deals with the topology of curves and surfaces as well as with the fundamental concepts of homotopy and homology, and does this in a lively and well-motivated way. This book is well suited for readers who are interested in finding out what topology is all about.

Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.