A combinatorial proof of Gotzmann's persistence theorem for monomial ideals
arXiv:math/0504429
Abstract
Gotzmann proved the persistence for minimal growth for ideals. His theorem is called Gotzmann's persistence theorem. In this paper, based on the combinatorics on binomial coefficients, a simple combinatorial proof of Gotzmann's persistence theorem in the special case of monomial ideals is given.