Using TPA to count linear extensions

  title={Using TPA to count linear extensions},
  author={Jacqueline Banks and Scott Garrabrant and Mark L. Huber and Anne Perizzolo},
A linear extension of a poset P is a permutation of the elements of the set that respects the partial order. Let L(P) denote the number of linear extensions. It is a #P complete problem to determine L(P) exactly for an arbitrary poset, and so randomized approximation algorithms that draw randomly from the set of linear extensions are used. In this work, the set of linear extensions is embedded in a larger state space with a continuous parameter β. The introduction of a continuous parameter… CONTINUE READING