Abstract
In this talk we consider the problem of finding sparse, nonnegative solutions to systems of linear Diophantine equations. As the main results, we show upper bounds on the number of nonzero entries of sparsest solutions. Using a geometric or an algebraic approach, one can give strong bounds in terms of the maximum absolute value of the entries of the constraint matrix, or in terms of subdeterminants of the constraint matrix.