Logo - springer
Slogan - springer

Birkhäuser - Birkhäuser Mathematics | Ordered Sets - An Introduction

Ordered Sets

An Introduction

Schroeder, Bernd

2003, XVII, 391 p.

A product of Birkhäuser Basel
Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$59.99

(net) price for USA

ISBN 978-1-4612-0053-6

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$79.95

(net) price for USA

ISBN 978-0-8176-4128-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$79.95

(net) price for USA

ISBN 978-1-4612-6591-7

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

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.

Content Level » Research

Keywords » Algebraic topology - Arithmetic - Lattice - Lemma - calculus - combinatorics - discrete mathematics - graph theory - homology - ksa - mapping - proof - set theory

Related subjects » Birkhäuser Mathematics

Table of contents 

Preface * List of Figures * The Basics * Chains, Antichains and Fences * Upper and Lower Bounds * Retractions * Lattices * Truncated Lattices * The Dimension of Ordered Sets * Interval Orders * Lexicographic Sums * Sets P^Q = Hom (Q, P) and Products * Enumeration * Algorithmic Aspects * Appendix A: A Primer on Algebraic Topology * Appendix B: Order vs. Analysis * References * Index

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematical Logic and Foundations.

Additional information