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, including divisibility relations and lattices. The lexicographic ordering on Cartesian products is also discussed, along with comparability in posets and total orderings.