Partially Ordered Set

Autor:

In mathematics, especially order theory, a partially ordered set (or poset) formalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation that indicates that,... Viac o knihe

Produkt je dočasne nedostupný

35.29 €

bežná cena: 40.10 €

O knihe

In mathematics, especially order theory, a partially ordered set (or poset) formalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation that indicates that, for certain pairs of elements in the set, one of the elements precedes the other. These relations are called partial orders to reflect the fact that not every pair of elements of a poset need be related: for some pairs, neither element precedes the other in the poset. Thus, partial orders generalize the more familiar total orders, in which every pair is related. A finite poset can be visualized through its Hasse diagram, which depicts the ordering relation between certain pairs of elements and allows one to reconstruct the whole partial order structure.

  • Vydavateľstvo: Betascript Publishers
  • Formát: Paperback
  • Jazyk:
  • ISBN: 9786130310011

Generuje redakčný systém BUXUS CMS spoločnosti ui42.