  An algorithm is presented that generates sets of size equal to the degree of
a given variety defined by a homogeneous ideal. This algorithm suggests a
versatile framework to study various problems in combinatorial algebraic
geometry and related fields.
