Ordered Sets: An Introduction
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Boston, MA
Birkhäuser Boston
2003
|
Schlagworte: | |
Online-Zugang: | Volltext |
Beschreibung: | 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 |
Beschreibung: | 1 Online-Ressource (XVII, 391 p) |
ISBN: | 9781461200536 9781461265917 |
DOI: | 10.1007/978-1-4612-0053-6 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV042419419 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 150317s2003 |||| o||u| ||||||eng d | ||
020 | |a 9781461200536 |c Online |9 978-1-4612-0053-6 | ||
020 | |a 9781461265917 |c Print |9 978-1-4612-6591-7 | ||
024 | 7 | |a 10.1007/978-1-4612-0053-6 |2 doi | |
035 | |a (OCoLC)863734320 | ||
035 | |a (DE-599)BVBBV042419419 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
082 | 0 | |a 511.3 |2 23 | |
084 | |a MAT 000 |2 stub | ||
100 | 1 | |a Schröder, Bernd S. W. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Ordered Sets |b An Introduction |c by Bernd S. W. Schröder |
264 | 1 | |a Boston, MA |b Birkhäuser Boston |c 2003 | |
300 | |a 1 Online-Ressource (XVII, 391 p) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
500 | |a 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 | ||
650 | 4 | |a Mathematics | |
650 | 4 | |a Algebra | |
650 | 4 | |a Combinatorics | |
650 | 4 | |a Logic, Symbolic and mathematical | |
650 | 4 | |a Algebraic topology | |
650 | 4 | |a Mathematical Logic and Foundations | |
650 | 4 | |a Order, Lattices, Ordered Algebraic Structures | |
650 | 4 | |a Algebraic Topology | |
650 | 4 | |a Mathematik | |
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 | |8 1\p |5 DE-604 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4612-0053-6 |x Verlag |3 Volltext |
912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
940 | 1 | |q ZDB-2-SMA_Archive | |
999 | |a oai:aleph.bib-bvb.de:BVB01-027854836 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804153090028339200 |
---|---|
any_adam_object | |
author | Schröder, Bernd S. W. |
author_facet | Schröder, Bernd S. W. |
author_role | aut |
author_sort | Schröder, Bernd S. W. |
author_variant | b s w s bsw bsws |
building | Verbundindex |
bvnumber | BV042419419 |
classification_tum | MAT 000 |
collection | ZDB-2-SMA ZDB-2-BAE |
ctrlnum | (OCoLC)863734320 (DE-599)BVBBV042419419 |
dewey-full | 511.3 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.3 |
dewey-search | 511.3 |
dewey-sort | 3511.3 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
doi_str_mv | 10.1007/978-1-4612-0053-6 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03561nmm a2200505zc 4500</leader><controlfield tag="001">BV042419419</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2003 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461200536</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4612-0053-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461265917</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4612-6591-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4612-0053-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863734320</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042419419</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="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schröder, Bernd S. W.</subfield><subfield code="e">Verfasser</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">by Bernd S. W. Schröder</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Birkhäuser Boston</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVII, 391 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebraic topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Foundations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Order, Lattices, Ordered Algebraic Structures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebraic Topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</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="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4612-0053-6</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027854836</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
id | DE-604.BV042419419 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T01:21:04Z |
institution | BVB |
isbn | 9781461200536 9781461265917 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027854836 |
oclc_num | 863734320 |
open_access_boolean | |
owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
physical | 1 Online-Ressource (XVII, 391 p) |
psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
publishDate | 2003 |
publishDateSearch | 2003 |
publishDateSort | 2003 |
publisher | Birkhäuser Boston |
record_format | marc |
spelling | Schröder, Bernd S. W. Verfasser aut Ordered Sets An Introduction by Bernd S. W. Schröder Boston, MA Birkhäuser Boston 2003 1 Online-Ressource (XVII, 391 p) txt rdacontent c rdamedia cr rdacarrier 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 Mathematics Algebra Combinatorics Logic, Symbolic and mathematical Algebraic topology Mathematical Logic and Foundations Order, Lattices, Ordered Algebraic Structures Algebraic Topology Mathematik Geordnete Menge (DE-588)4156748-1 gnd rswk-swf Geordnete Menge (DE-588)4156748-1 s 1\p DE-604 https://doi.org/10.1007/978-1-4612-0053-6 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Schröder, Bernd S. W. Ordered Sets An Introduction Mathematics Algebra Combinatorics Logic, Symbolic and mathematical Algebraic topology Mathematical Logic and Foundations Order, Lattices, Ordered Algebraic Structures Algebraic Topology Mathematik 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 by Bernd S. W. Schröder |
title_fullStr | Ordered Sets An Introduction by Bernd S. W. Schröder |
title_full_unstemmed | Ordered Sets An Introduction by Bernd S. W. Schröder |
title_short | Ordered Sets |
title_sort | ordered sets an introduction |
title_sub | An Introduction |
topic | Mathematics Algebra Combinatorics Logic, Symbolic and mathematical Algebraic topology Mathematical Logic and Foundations Order, Lattices, Ordered Algebraic Structures Algebraic Topology Mathematik Geordnete Menge (DE-588)4156748-1 gnd |
topic_facet | Mathematics Algebra Combinatorics Logic, Symbolic and mathematical Algebraic topology Mathematical Logic and Foundations Order, Lattices, Ordered Algebraic Structures Algebraic Topology Mathematik Geordnete Menge |
url | https://doi.org/10.1007/978-1-4612-0053-6 |
work_keys_str_mv | AT schroderberndsw orderedsetsanintroduction |