Ordered Sets: An Introduction

Front Cover
Springer Science & Business Media, 2003 - Mathematics - 391 pages
0 Reviews

This work is an introduction to the basic tools of the theory of (partially) ordered sets such as visualization via diagrams, subsets, homomorphisms, important order-theoretical constructions, and classes of ordered sets. Using a thematic approach, the author presents open or recently solved problems to motivate the development of constructions and investigations for new classes of ordered sets.

A wide range of material is presented, from classical results such as Dilworth's, Szpilrajn's and Hashimoto's Theorems to more recent results such as the Li--Milner Structure Theorem. Major topics covered include: chains and antichains, lowest upper and greatest lower bounds, retractions, lattices, the dimension of ordered sets, interval orders, lexicographic sums, products, enumeration, algorithmic approaches and the role of algebraic topology.

Since there are few prerequisites, the text can be used as a focused follow-up or companion to a first proof (set theory and relations) or graph theory class. After working through a comparatively lean core, the reader can choose from a diverse range of topics such as structure theory, enumeration or algorithmic aspects. Also presented are some key topics less customary to discrete mathematics/graph theory, including a concise introduction to homology for graphs, and the presentation of forward checking as a more efficient alternative to the standard backtracking algorithm. The coverage throughout provides a solid foundation upon which research can be started by a mathematically mature reader.

Rich in exercises, illustrations, and open problems, Ordered Sets: An Introduction is an excellent text for undergraduate and graduate students and a good resource for the interested researcher. Readers will discover order theory's role in discrete mathematics as a supplier of ideas as well as an attractive source of applications.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

V
xvii
VI
2
VII
7
VIII
10
IX
13
X
17
XI
20
XII
23
LXVII
171
LXVIII
174
LXIX
176
LXX
180
LXXI
183
LXXII
187
LXXIII
188
LXXIV
191

XIII
27
XIV
30
XV
32
XVI
34
XVII
37
XVIII
40
XIX
42
XX
45
XXI
49
XXII
53
XXIII
60
XXIV
62
XXV
67
XXVI
70
XXVII
74
XXVIII
75
XXX
79
XXXI
80
XXXII
82
XXXIII
84
XXXIV
88
XXXV
89
XXXVII
90
XXXVIII
91
XXXIX
92
XL
93
XLI
99
XLII
101
XLIII
106
XLIV
109
XLV
112
XLVI
114
XLVII
117
XLVIII
120
XLIX
121
L
124
LI
128
LII
133
LIII
135
LIV
136
LV
139
LVI
141
LVII
145
LVIII
146
LIX
150
LX
152
LXI
154
LXII
156
LXIII
159
LXIV
162
LXV
166
LXVI
169
LXXV
193
LXXVI
196
LXXVII
199
LXXIX
204
LXXX
206
LXXXI
211
LXXXII
215
LXXXIII
217
LXXXIV
222
LXXXV
225
LXXXVI
228
LXXXVII
231
LXXXVIII
235
LXXXIX
238
XC
246
XCI
249
XCII
253
XCIII
257
XCIV
261
XCV
262
XCVI
263
XCVII
266
XCVIII
275
XCIX
280
C
283
CI
287
CII
293
CIII
297
CIV
301
CV
303
CVI
306
CVII
307
CVIII
310
CIX
311
CX
316
CXI
322
CXII
324
CXIII
330
CXIV
335
CXV
336
CXVI
339
CXVII
340
CXVIII
342
CXIX
347
CXX
349
CXXI
350
CXXII
352
CXXIII
354
CXXIV
357
CXXV
375
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 376 - Exploiting the Deep Structure of Constraint Problems".

Bibliographic information