Ordered sets: an introduction
"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."--BO...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston [u.a.]
Birkhäuser
2003
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Zusammenfassung: | "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."--BOOK JACKET. |
| Beschreibung: | XVII, 391 S. graph. Darst. |
| ISBN: | 0817641289 3764341289 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV014371329 | ||
| 003 | DE-604 | ||
| 005 | 20030124 | ||
| 007 | t | ||
| 008 | 020603s2003 xxud||| |||| 00||| eng d | ||
| 016 | 7 | |a 966043863 |2 DE-101 | |
| 020 | |a 0817641289 |9 0-8176-4128-9 | ||
| 020 | |a 3764341289 |9 3-7643-4128-9 | ||
| 035 | |a (OCoLC)48851298 | ||
| 035 | |a (DE-599)BVBBV014371329 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-824 |a DE-355 |a DE-20 |a DE-634 |a DE-739 |a DE-11 | ||
| 050 | 0 | |a QA171.48 | |
| 082 | 0 | |a 511.3/2 |2 21 | |
| 084 | |a SK 150 |0 (DE-625)143218: |2 rvk | ||
| 084 | |a SK 180 |0 (DE-625)143222: |2 rvk | ||
| 100 | 1 | |a Schröder, Bernd S. W. |d 1966- |e Verfasser |0 (DE-588)135918871 |4 aut | |
| 245 | 1 | 0 | |a Ordered sets |b an introduction |c Bernd S. W. Schröder |
| 264 | 1 | |a Boston [u.a.] |b Birkhäuser |c 2003 | |
| 300 | |a XVII, 391 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 1 | |a "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."--BOOK JACKET. | |
| 650 | 4 | |a Ensembles ordonnés | |
| 650 | 4 | |a Ordered sets | |
| 650 | 0 | 7 | |a Geordnete Menge |0 (DE-588)4156748-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Geordnete Menge |0 (DE-588)4156748-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009844717&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-009844717 | ||
Datensatz im Suchindex
| _version_ | 1804129250684436480 |
|---|---|
| adam_text | Contents
Table of
Contents..........................
v
Concept Map of the Contents
.................... ix
Preface
............................... xi
Acknowledgements
........................ . xvi
1
The Basics
1
1.1
Definition and Examples
...................... 1
1.2
The Diagram
............................ 4
1.3
Order-Preserving Mappings/Isomorphism
............. 9
1.4
Fixed Points
............................. 12
1.5
Ordered Subsets/The Reconstruction Problem
........... 15
Exercises
.............................. 19
Remarks and Open Problems
.................... 22
2
Chains, Antichains and Fences
25
2.1
Chains and Zorn s Lemma
..................... 25
2.2
Well-ordered Sets
.......................... 29
2.3
A Remark on Duality
....................... . 32
2.4
The Rank of an Element
...................... 34
2.5
Antichains and Dilworth s Chain Decomposition Theorem
.... 36
2.6
Dedekind Numbers
......................... 39
2.7
Fences and Crowns
......................... 42
2.8
Connectivity
............................. 44
Exercises
.............................. 47
Remarks and Open Problems
.................... 51
Upper and Lower Bounds
55
3.1
Extremal Elements
......................... 55
3.2
Covers
................................ 62
3.3
Lowest Upper and Greatest Lower Bounds
............. 64
3.4
Chain-Completeness and the Abian-Brown Theorem
....... 69
Exercises
.............................. 72
Remarks and Open Problems
.................... 76
Retractions
77
4.1
Definition and Examples
...................... 77
4.2
Fixed Point Theorems
........................ 81
4.2.1
Removing Points
...................... 82
4.2.2
The Comparable Point Property
.............. 84
4.3
Dismantlability
........................... 86
4.3.1
(Connectedly) Collapsible Ordered Sets
.......... 90
4.4
The Fixed Point Property for Ordered Sets of Width
2
or Height
1 91
4.4.1
Width
2........................... 91
4.4.2
Height
1........................... 92
4.4.3
Minimal Automorphic Ordered Sets
............ 93
4.4.4
A Fixed Point Property for Graphs?
............ 94
4.5
Li and Milner s Structure Theorem
................. 95
4.6
Isotone Relations
.......................... 101
Exercises
.............................. 103
Remarks and Open Problems
.................... 108
Lattices 111
5.1
Definition and Examples
......................
Ill
5.2
Fixed Point Results/The Tarski-Davis Theorem
..........114
5.2.1
Preorders/The
Bernstein-Cantor-Schröder
Theorem
... 114
5.2.2
Other Results on the Structure of Fixed Point Sets
.....116
5.3
Embeddingsfflie
Dedekind-MacNeille Completion
....... . 119
5.4
Irreducible Points in Lattices
....................122
5.5
Finite Ordered Sets vs. Distributive Lattices
............123
5.6
More on Distributive Lattices
....................126
Exercises
..............................130
Remarks and Open Problems
....................135
Truncated Lattices
137
6.1
Definition and Examples
......................137
6.2
Recognizability and More
......................138
6.3
The Fixed Clique Property
.....................141
6.3.1
Simplicial Complexes
...................143
6.3.2
The Fixed Point Property for Truncated Lattices
......147
6.4
Triangulations
of
5 .........................148
6.5
Cutsets
................................152
6.6
Truncated
Noncomplemented
Lattices
...............154
Exercises
.............................. 156
Remarks and Open Problems
....................158
7
The Dimension of Ordered Sets
161
7.1
(Linear) Extensions of Orders
................... 161
7.2
Balancing Pairs
........................... 164
7.3
Defining the Dimension
.......................168
7.3.1
A Characterization of Realizers
..............171
7.4
Bounds on the Dimension
......................173
7.5
Ordered Sets of Dimension
2....................176
Exercises
..............................178
Remarks and Open Problems
....................182
8
Interval Orders
185
8.1
Definition and Examples
......................185
8.2
The Fixed Point Property for Interval Orders
............189
8.3
Dedekind s Problem for Interval Orders and Reconstruction
. ... 190
8.4
Interval Dimension
.........................193
Exercises
..............................195
Remarks and Open Problems
....................198
9
Lexicographic Sums
201
9.1
Definition and Examples
......................201
9.2
The Canonical Decomposition
...................206
9.3
Comparability
Invariance
......................208
9.4
Lexicographic Sums and Reconstruction
..............213
9.5
An Almost Lexicographic Construction
..............217
Exercises
.............................. 219
Remarks and Open Problems
....................224
10
Sets PQ
= Hom(ß,
Ρ)
and Products
227
10.1
Sets PQ
- Hom(ß,
Ρ)
.......................227
10.2
Finite Products
...........................230
10.2.1
Finite Products and the Fixed Point Property
....... 233
10.3
Infinite Products
...........................237
10.4
Hashimoto s Theorem and Automorphisms of Products
...... 240
10.4.1
Automorphisms of Products
................ 248
10.5
Arithmetic of Ordered Sets
.....................251
Exercises
..............................255
Remarks and Open Problems
....................259
11
Enumeration
263
11.1
Graded Ordered Sets
........................264
11.2
The Number of Graded Ordered Sets
................265
11.3
The Asymptotic Number of Graded Ordered Sets
.........268
11.4
The Number of Nonisomorphic Ordered Sets
...........277
11.5
The Number of Automorphisms
..................282
Exercises
..............................285
Remarks and Open Problems
....................289
12
Algorithmic Aspects
295
12.1
Algorithms
.............................296
12.2
Polynomial Efficiency
........................299
12.3
NP problems
............................303
12.3.1
Constraint Satisfaction Problems (CSPs)
..........305
12.3.2
Expanded Constraint Networks/
Cliques in r-colored Graphs
................308
12.4
NP-completeness
..........................309
12.5
So It s NP-complete
...........................312
12.5.1
Search Algorithms
.....................313
12.5.2
Algorithms That Enforce Local Consistency
........318
12.6
A Polynomial Algorithm for the Fixed Point Property in Graded
Ordered Sets of Bounded Width
..................324
Exercises
..............................326
Remarks and Open Problems
....................332
A A Primer on Algebraic Topology
337
A.I Chain Complexes
..........................338
A.2 The Lefschetz Number
.......................341
A.3 (Integer) Homology
.........................342
A.4 A Homological Reduction Theorem
................344
Remarks and Open Problems
....................349
В
Order vs. Analysis
351
B.I The Spaces
Ζ^(Ω,Κ)
........................351
В.
2
Fixed Point Theorems
........................352
B.3 An Application
...........................354
Remarks and Open Problems
....................356
References
359
Index
377
|
| any_adam_object | 1 |
| author | Schröder, Bernd S. W. 1966- |
| author_GND | (DE-588)135918871 |
| author_facet | Schröder, Bernd S. W. 1966- |
| author_role | aut |
| author_sort | Schröder, Bernd S. W. 1966- |
| author_variant | b s w s bsw bsws |
| building | Verbundindex |
| bvnumber | BV014371329 |
| callnumber-first | Q - Science |
| callnumber-label | QA171 |
| callnumber-raw | QA171.48 |
| callnumber-search | QA171.48 |
| callnumber-sort | QA 3171.48 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 150 SK 180 |
| ctrlnum | (OCoLC)48851298 (DE-599)BVBBV014371329 |
| dewey-full | 511.3/2 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/2 |
| dewey-search | 511.3/2 |
| dewey-sort | 3511.3 12 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01795nam a2200421zc 4500</leader><controlfield tag="001">BV014371329</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20030124 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">020603s2003 xxud||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">966043863</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0817641289</subfield><subfield code="9">0-8176-4128-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3764341289</subfield><subfield code="9">3-7643-4128-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)48851298</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014371329</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-824</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA171.48</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/2</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 150</subfield><subfield code="0">(DE-625)143218:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 180</subfield><subfield code="0">(DE-625)143222:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schröder, Bernd S. W.</subfield><subfield code="d">1966-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135918871</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Ordered sets</subfield><subfield code="b">an introduction</subfield><subfield code="c">Bernd S. W. Schröder</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">Birkhäuser</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 391 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1="1" ind2=" "><subfield code="a">"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."--BOOK JACKET.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ensembles ordonnés</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ordered sets</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Geordnete Menge</subfield><subfield code="0">(DE-588)4156748-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Geordnete Menge</subfield><subfield code="0">(DE-588)4156748-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009844717&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009844717</subfield></datafield></record></collection> |
| id | DE-604.BV014371329 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T19:02:09Z |
| institution | BVB |
| isbn | 0817641289 3764341289 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009844717 |
| oclc_num | 48851298 |
| open_access_boolean | |
| owner | DE-824 DE-355 DE-BY-UBR DE-20 DE-634 DE-739 DE-11 |
| owner_facet | DE-824 DE-355 DE-BY-UBR DE-20 DE-634 DE-739 DE-11 |
| physical | XVII, 391 S. graph. Darst. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Birkhäuser |
| record_format | marc |
| spelling | Schröder, Bernd S. W. 1966- Verfasser (DE-588)135918871 aut Ordered sets an introduction Bernd S. W. Schröder Boston [u.a.] Birkhäuser 2003 XVII, 391 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier "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."--BOOK JACKET. Ensembles ordonnés Ordered sets Geordnete Menge (DE-588)4156748-1 gnd rswk-swf Geordnete Menge (DE-588)4156748-1 s DE-604 Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009844717&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Schröder, Bernd S. W. 1966- Ordered sets an introduction Ensembles ordonnés Ordered sets Geordnete Menge (DE-588)4156748-1 gnd |
| subject_GND | (DE-588)4156748-1 |
| title | Ordered sets an introduction |
| title_auth | Ordered sets an introduction |
| title_exact_search | Ordered sets an introduction |
| title_full | Ordered sets an introduction Bernd S. W. Schröder |
| title_fullStr | Ordered sets an introduction Bernd S. W. Schröder |
| title_full_unstemmed | Ordered sets an introduction Bernd S. W. Schröder |
| title_short | Ordered sets |
| title_sort | ordered sets an introduction |
| title_sub | an introduction |
| topic | Ensembles ordonnés Ordered sets Geordnete Menge (DE-588)4156748-1 gnd |
| topic_facet | Ensembles ordonnés Ordered sets Geordnete Menge |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009844717&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT schroderberndsw orderedsetsanintroduction |