A combinatorial proof of Gotzmann's persistence theorem for monomial ideals (Q2462343): Difference between revisions

\textit{G. Gotzmann} [Math. Z. 158, 61--70 (1978; Zbl 0352.13009)] proved the persistence for minimal growth of Hilbert functions of homogeneous ideals in a polynomial ring. \textit{A. Aramova, J. Herzog} and \textit{T. Hibi} [J. Algebra 191, No. 1, 174--211 (1997; Zbl 0897.13030)] proved Gotzmann's theorem for exterior algebras. \textit{M. L. Green} gave a simple proof of Gotzmann's theorem [in: Generic initial ideals, Progr. Math. 166, 119--186 (1998; Zbl 0933.13002)] using generic initial ideals. In the special case of monomial ideals, Gotzmann [loc. cit.] proved the persistence theorem using Castelnuovo-Mumford regularity. All of these proofs are completely algebraic, in this paper the author gives a simple combinatorial proof only using the combinatorics of binomial coefficients.