Pilaud, Vincent2025-11-072025-11-0720240218-0006https://hdl.handle.net/2445/224188We prove that the acyclic reorientation poset of a directed acyclic graph D is a lattice if and only if the transitive reduction of any induced subgraph of D is a forest. We then show that the acyclic reorientation lattice is always congruence normal, semidistributive (thus congruence uniform) if and only if D is filled, and distributive if and only if D is a forest. When the acyclic reorientation lattice is semidis- tributive, we introduce the ropes of D that encode the join irreducible acyclic reorientations and exploit this combinatorial model in three direc- tions. First, we describe the canonical join and meet representations of acyclic reorientations in terms of non-crossing rope diagrams. Second, we describe the congruences of the acyclic reorientation lattice in terms of lower ideals of a natural subrope order. Third, we use Minkowski sums of shard polytopes of ropes to construct a quotientope for any congruence of the acyclic reorientation lattice.58 p.application/pdfengcc-by (c) Pilaud, Vincent, 2024http://creativecommons.org/licenses/by/3.0/es/Geometria combinatòriaTeoria de grafsCombinatorial geometryGraph theoryinfo:eu-repo/semantics/article7543982025-11-07info:eu-repo/semantics/openAccess