Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

AuthorAigner, Martin. author
TitleCombinatorial Theory [electronic resource] / by Martin Aigner
ImprintNew York, NY : Springer New York, 1979
Connect tohttp://dx.doi.org/10.1007/978-1-4615-6666-3
Descript VIII, 484 p. online resource

SUMMARY

It is now generally recognized that the field of combinatorics has, over the past years, evolved into a fully-fledged branch of discrete mathematics whose potential with respect to computers and the natural sciences is only beginning to be realized. Still, two points seem to bother most authors: The apparent difficulty in defining the scope of combinatorics and the fact that combinatorics seems to consist of a vast variety of more or less unrelated methods and results. As to the scope of the field, there appears to be a growing consensus that combinatorics should be divided into three large parts: (a) Enumeration, including generating functions, inversion, and calculus of finite differences; (b) Order Theory, including finite posets and lattices, matroids, and existence results such as Hall's and Ramsey's; (c) Configurations, including designs, permutation groups, and coding theory. The present book covers most aspects of parts (a) and (b), but none of (c). The reasons for excluding (c) were twofold. First, there exist several older books on the subject, such as Ryser [1] (which I still think is the most seductive introduction to combinatorics), Hall [2], and more recent ones such as Cameron-Van Lint [1] on groups and designs, and Blake-Mullin [1] on coding theory, whereas no compreยญ hensive book exists on (a) and (b)


CONTENT

Preliminaries -- 1. Sets -- 2. Graphs -- 3. Posets -- 4. Miscellaneous Notation -- I. Mappings -- 1. Classes of Mappings -- 2. Fundamental Orders -- 3. Permutations -- 4. Patterns -- Notes -- II. Lattices -- 1. Distributive Lattices -- 2. Modular and Semimodular Lattices -- 3. Geometric Lattices -- 4. The Fundamental Examples -- Notes -- III. Counting Functions -- 1. The Elementary Counting Coefficients -- 2. Recursion and Inversion -- 3. Binomial Sequences -- 4. Order Functions -- Notes -- IV. Incidence Functions -- 1. The Incidence Algebra -- 2. Mรถbius Inversion -- 3. The Mรถbius Function -- 4. Valuations -- Notes -- V. Generating Functions -- 1. Ordered Structures -- 2. Unordered Structures -- 3. G-patterns -- 4. G,H-patterns -- Notes -- VI. Matroids: Introduction -- 1. Fundamental Concepts -- 2. Fundamental Examples -- 3. Construction of Matroids -- 4. Duality and Connectivity -- Notes -- VII. Matroids: Further Theory -- 1. Linear Matroids -- 2. Binary Matroids -- 3. Graphic Matroids -- 4. Transversal Matroids -- Notes -- VIII. Combinatorial Order Theory -- 1. Maximum-Minimum Theorems -- 2. Transversal Theorems -- 3. Sperner Theorems -- 4. Ramsey Theorems -- Notes -- List of Symbols


Mathematics Mathematics Mathematics general



Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram