On the lattice of the weak factorization systems on a finite lattice

Abstract: We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer systems. As an application we find a lower bound for the number of transfer systems on a boolean lattice.