A combinatorial proof of Gotzmann's persistence theorem for monomial ideals
Combinatorics
2008-04-11 v1 Commutative Algebra
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.
Cite
@article{arxiv.math/0504429,
title = {A combinatorial proof of Gotzmann's persistence theorem for monomial ideals},
author = {Satoshi Murai},
journal= {arXiv preprint arXiv:math/0504429},
year = {2008}
}