An ordered set - in order theory of mathematics - is an ambiguous term referring to a set that is either a partially ordered set or a totally ordered set. A set with a binary relation R on its elements that is reflexive (for all a in the set, aRa), antisymmetric (if aRb and bRa, then a = b) and transitive (if aRb and bRc, then aRc) is described as a partially ordered set or poset. If the binary relation is antisymmetric, transitive and also total (for all a and b in the set, aRb or bRa), then the set is a totally ordered set. If every non-empty subset has a least element, then the set is a well-ordered set.
In information theory, an ordered set is a non-data carrying set of bits as used in 8b/10b encoding.
Famous quotes containing the words ordered and/or set:
“In spite of our worries to the contrary, children are still being born with the innate ability to learn spontaneously, and neither they nor their parents need the sixteen-page instructional manual that came with a rattle ordered for our baby boy!”
—Neil Kurshan (20th century)
“Colleges, in like manner, have their indispensable office,to teach elements. But they can only highly serve us, when they aim not to drill, but to create; when they gather from far every ray of various genius to their hospitable halls, and, by the concentrated fires, set the hearts of their youth on flame.”
—Ralph Waldo Emerson (18031882)