Abstract
We show how the availability of the greedy algorithm for finding the minimun number of coins in the money exchange problem is related to the Cohen–Macaulay property of the toric projective curves given by the coin values.
*Partially supported by junta de Castilla y León VA 27/98 and DGES PB97-0370.
Acknowledgments
Notes
*Partially supported by junta de Castilla y León VA 27/98 and DGES PB97-0370.