Approximately Sampling Elements with Fixed Rank in Graded Posets

Prateek Bhakta, Ben Cousins, Matthew Fahrbach +1

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}…