Combinatorial Theory

Combinatorial Theory
Author: Martin Aigner
Publisher: Springer Science & Business Media
Total Pages: 493
Release: 2012-12-06
Genre: Mathematics
ISBN: 3642591019

This book offers a well-organized, easy-to-follow introduction to combinatorial theory, with examples, notes and exercises. ". . . a very good introduction to combinatorics. This book can warmly be recommended first of all to students interested in combinatorics." Publicationes Mathematicae Debrecen

Combinatorics: The Rota Way

Combinatorics: The Rota Way
Author: Joseph P. S. Kung
Publisher: Cambridge University Press
Total Pages: 397
Release: 2009-02-09
Genre: Mathematics
ISBN: 1139476769

Gian-Carlo Rota was one of the most original and colourful mathematicians of the 20th century. His work on the foundations of combinatorics focused on the algebraic structures that lie behind diverse combinatorial areas, and created a new area of algebraic combinatorics. Written by two of his former students, this book is based on notes from his influential graduate courses and on face-to-face discussions. Topics include sets and valuations, partially ordered sets, distributive lattices, partitions and entropy, matching theory, free matrices, doubly stochastic matrices, Moebius functions, chains and antichains, Sperner theory, commuting equivalence relations and linear lattices, modular and geometric lattices, valuation rings, generating functions, umbral calculus, symmetric functions, Baxter algebras, unimodality of sequences, and location of zeros of polynomials. Many exercises and research problems are included, and unexplored areas of possible research are discussed. A must-have for all students and researchers in combinatorics and related areas.

Foundations of Combinatorics with Applications

Foundations of Combinatorics with Applications
Author: Edward A. Bender
Publisher: Courier Corporation
Total Pages: 789
Release: 2013-01-18
Genre: Mathematics
ISBN: 0486151506

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.

Foundations of Combinatorial Topology

Foundations of Combinatorial Topology
Author: L. S. Pontryagin
Publisher: Courier Corporation
Total Pages: 112
Release: 2015-05-20
Genre: Mathematics
ISBN: 0486406857

Concise, rigorous introduction to homology theory features applications to dimension theory and fixed-point theorems. Lucid coverage of the field includes examinations of complexes and their Betti groups, invariance of the Betti groups, and continuous mappings and fixed points. Proofs are presented in a complete and careful manner. A beneficial text for a graduate-level course, "this little book is an extremely valuable addition to the literature of algebraic topology." — The Mathematical Gazette.

Combinatorial Set Theory

Combinatorial Set Theory
Author: Lorenz J. Halbeisen
Publisher: Springer
Total Pages: 586
Release: 2017-12-20
Genre: Mathematics
ISBN: 3319602314

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.

Combinatorics and Graph Theory

Combinatorics and Graph Theory
Author: John Harris
Publisher: Springer Science & Business Media
Total Pages: 392
Release: 2009-04-03
Genre: Mathematics
ISBN: 0387797114

These notes were first used in an introductory course team taught by the authors at Appalachian State University to advanced undergraduates and beginning graduates. The text was written with four pedagogical goals in mind: offer a variety of topics in one course, get to the main themes and tools as efficiently as possible, show the relationships between the different topics, and include recent results to convince students that mathematics is a living discipline.

Problems in Combinatorics and Graph Theory

Problems in Combinatorics and Graph Theory
Author: Ioan Tomescu
Publisher: Wiley-Interscience
Total Pages: 362
Release: 1985-04-30
Genre: Mathematics
ISBN:

Covers the most important combinatorial structures and techniques. This is a book of problems and solutions which range in difficulty and scope from the elementary/student-oriented to open questions at the research level. Each problem is accompanied by a complete and detailed solution together with appropriate references to the mathematical literature, helping the reader not only to learn but to apply the relevant discrete methods. The text is unique in its range and variety -- some problems include straightforward manipulations while others are more complicated and require insights and a solid foundation of combinatorics and/or graph theory. Includes a dictionary of terms that makes many of the challenging problems accessible to those whose mathematical education is limited to highschool algebra.

The History of Combinatorial Group Theory

The History of Combinatorial Group Theory
Author: B. Chandler
Publisher: Springer Science & Business Media
Total Pages: 240
Release: 2012-12-06
Genre: Mathematics
ISBN: 1461394872

One of the pervasive phenomena in the history of science is the development of independent disciplines from the solution or attempted solutions of problems in other areas of science. In the Twentieth Century, the creation of specialties witqin the sciences has accelerated to the point where a large number of scientists in any major branch of science cannot understand the work of a colleague in another subdiscipline of his own science. Despite this fragmentation, the development of techniques or solutions of problems in one area very often contribute fundamentally to solutions of problems in a seemingly unrelated field. Therefore, an examination of this phenomenon of the formation of independent disciplines within the sciences would contrib ute to the understanding of their evolution in modern times. We believe that in this context the history of combinatorial group theory in the late Nineteenth Century and the Twentieth Century can be used effectively as a case study. It is a reasonably well-defined independent specialty, and yet it is closely related to other mathematical disciplines. The fact that combinatorial group theory has, so far, not been influenced by the practical needs of science and technology makes it possible for us to use combinatorial group theory to exhibit the role of the intellectual aspects of the development of mathematics in a clearcut manner. There are other features of combinatorial group theory which appear to make it a reasona ble choice as the object of a historical study.

Notes on Introductory Combinatorics

Notes on Introductory Combinatorics
Author: George Polya
Publisher: Springer Science & Business Media
Total Pages: 202
Release: 2013-11-27
Genre: Science
ISBN: 1475711018

In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who ·was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into three types: enumerative, eXistential, and constructive. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations.