Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of partial orderings, defining a relation on a set as reflexive, antisymmetric, and transitive. It explores examples of partial orderings on integers, divisibility relations, and power sets. The lecture also introduces lattices, which are partially ordered sets with least upper bounds and greatest lower bounds, and discusses lexicographic orderings on Cartesian products.