Linear extensions and directed clique counts via modular partitions

Daniela Egas Santander, Matteo Santoro, Jason P. Smith

Counting linear extensions is a fundamental problem in poset theory. It is known to be #P-complete, with polynomial-time formulas available in special cases. In this work, we devel…