Name
Abstract | ||
|---|---|---|
The theory of ordered sets lies at the confluence of several branches of mathematics including set theory, lattice theory, combinatorial theory, and even aspects of modern operations research. While ordered sets are often peripheral to the mainstream of any of these theories there arise, from time to time, problems which are order-theoretic in substance. The aim of this work is to fashion a classification scheme for ordered sets which aimed at providing a unified vantage point for some of the problems encountered with ordered sets. This classification scheme is based on a structure theory much akin to the familiar subdirect representation theory so useful in general algebra. The novelry of the structure theory lies in the importance that we attach to, and the widespread use that we make of, the concept of retract. At present, some vindication for our classification scheme can be found by examining its effectiveness for totally ordered sets (e.g., well-ordered sets, the rationals, reals, etc.) as well as for those finite ordered sets that arise commonly in combinatorial investigations (e.g., crowns and fences). |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1016/0012-365X(81)90201-6 | Discrete Mathematics |
Field | DocType | Volume |
Set theory,Discrete mathematics,Monotonic function,Rational number,Combinatorics,Weak ordering,Algebra,Ordered pair,Structure (category theory),Partially ordered set,Mathematics,Special ordered set | Journal | 35 |
Issue | ISSN | Citations |
1-3 | Discrete Mathematics | 33 |
PageRank | References | Authors |
16.09 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dwight Duffus | 1 | 111 | 36.63 |
| Ivan Rival | 2 | 314 | 167.36 |