Engineering Mathematics · topic
Partial orders, Hasse diagrams, extremal elements and bounds, chains, antichains and linear extensions; lattices with join and meet, bounded, distributive, complemented and Boolean lattices, sublattices, the M3 and N5 test and divisor lattices.
Many collections are ordered, but not totally: subsets ordered by inclusion, tasks ordered by "must finish before", integers ordered by divisibility. In each case some pairs are comparable and others are not. A partially ordered set (poset) captures this.
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.
